/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/weaver/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 12:06:17,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 12:06:17,407 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 12:06:17,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 12:06:17,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 12:06:17,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 12:06:17,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 12:06:17,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 12:06:17,458 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 12:06:17,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 12:06:17,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 12:06:17,469 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 12:06:17,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 12:06:17,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 12:06:17,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 12:06:17,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 12:06:17,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 12:06:17,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 12:06:17,471 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 12:06:17,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 12:06:17,471 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 12:06:17,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 12:06:17,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 12:06:17,473 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 12:06:17,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 12:06:17,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:06:17,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 12:06:17,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 12:06:17,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 12:06:17,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 12:06:17,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 12:06:17,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 12:06:17,475 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 12:06:17,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 12:06:17,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 12:06:17,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 12:06:17,806 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 12:06:17,806 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 12:06:17,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2023-11-17 12:06:19,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 12:06:19,318 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 12:06:19,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2023-11-17 12:06:19,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02aed673/99eb565fe2424587b50f556f324e5a5b/FLAGabe01ac0a [2023-11-17 12:06:19,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02aed673/99eb565fe2424587b50f556f324e5a5b [2023-11-17 12:06:19,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 12:06:19,343 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 12:06:19,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 12:06:19,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 12:06:19,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 12:06:19,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:06:19" (1/1) ... [2023-11-17 12:06:19,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3167871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:06:19, skipping insertion in model container [2023-11-17 12:06:19,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:06:19" (1/1) ... [2023-11-17 12:06:19,376 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 12:06:19,525 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c[2781,2794] [2023-11-17 12:06:19,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:06:19,546 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 12:06:19,568 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c[2781,2794] [2023-11-17 12:06:19,578 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:06:19,595 INFO L206 MainTranslator]: Completed translation [2023-11-17 12:06:19,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:06:19 WrapperNode [2023-11-17 12:06:19,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 12:06:19,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 12:06:19,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 12:06:19,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 12:06:19,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:06:19" (1/1) ... [2023-11-17 12:06:19,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:06:19" (1/1) ... [2023-11-17 12:06:19,642 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 289 [2023-11-17 12:06:19,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 12:06:19,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 12:06:19,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 12:06:19,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 12:06:19,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:06:19" (1/1) ... [2023-11-17 12:06:19,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:06:19" (1/1) ... [2023-11-17 12:06:19,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:06:19" (1/1) ... [2023-11-17 12:06:19,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:06:19" (1/1) ... [2023-11-17 12:06:19,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:06:19" (1/1) ... [2023-11-17 12:06:19,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:06:19" (1/1) ... [2023-11-17 12:06:19,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:06:19" (1/1) ... [2023-11-17 12:06:19,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:06:19" (1/1) ... [2023-11-17 12:06:19,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 12:06:19,683 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 12:06:19,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 12:06:19,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 12:06:19,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:06:19" (1/1) ... [2023-11-17 12:06:19,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:06:19,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:19,727 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 12:06:19,743 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 12:06:19,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 12:06:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 12:06:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 12:06:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 12:06:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 12:06:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 12:06:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 12:06:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 12:06:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 12:06:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 12:06:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 12:06:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 12:06:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 12:06:19,770 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 12:06:19,919 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 12:06:19,923 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 12:06:20,473 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 12:06:21,035 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 12:06:21,035 INFO L307 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-17 12:06:21,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:06:21 BoogieIcfgContainer [2023-11-17 12:06:21,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 12:06:21,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 12:06:21,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 12:06:21,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 12:06:21,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:06:19" (1/3) ... [2023-11-17 12:06:21,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e185ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:06:21, skipping insertion in model container [2023-11-17 12:06:21,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:06:19" (2/3) ... [2023-11-17 12:06:21,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e185ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:06:21, skipping insertion in model container [2023-11-17 12:06:21,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:06:21" (3/3) ... [2023-11-17 12:06:21,046 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2023-11-17 12:06:21,083 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 12:06:21,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 12:06:21,083 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 12:06:21,138 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 12:06:21,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 56 flow [2023-11-17 12:06:21,211 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2023-11-17 12:06:21,211 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:06:21,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 3/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-11-17 12:06:21,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 21 transitions, 56 flow [2023-11-17 12:06:21,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2023-11-17 12:06:21,230 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 12:06:21,246 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 18 transitions, 48 flow [2023-11-17 12:06:21,251 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 18 transitions, 48 flow [2023-11-17 12:06:21,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 18 transitions, 48 flow [2023-11-17 12:06:21,271 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2023-11-17 12:06:21,272 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:06:21,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-11-17 12:06:21,273 INFO L119 LiptonReduction]: Number of co-enabled transitions 54 [2023-11-17 12:06:21,350 INFO L134 LiptonReduction]: Checked pairs total: 54 [2023-11-17 12:06:21,350 INFO L136 LiptonReduction]: Total number of compositions: 1 [2023-11-17 12:06:21,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 12:06:21,378 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;@66d65d1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:06:21,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 12:06:21,391 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 12:06:21,391 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-11-17 12:06:21,391 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:06:21,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:21,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:21,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:21,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:21,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1022804469, now seen corresponding path program 1 times [2023-11-17 12:06:21,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:21,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088456369] [2023-11-17 12:06:21,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:21,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:22,065 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 12:06:22,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:22,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088456369] [2023-11-17 12:06:22,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088456369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:06:22,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:06:22,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 12:06:22,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796854807] [2023-11-17 12:06:22,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:06:22,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 12:06:22,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:22,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 12:06:22,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 12:06:22,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:22,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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 12:06:22,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:22,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:22,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:22,348 INFO L124 PetriNetUnfolderBase]: 101/165 cut-off events. [2023-11-17 12:06:22,348 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-17 12:06:22,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 165 events. 101/165 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 481 event pairs, 9 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 267. Up to 111 conditions per place. [2023-11-17 12:06:22,352 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 28 selfloop transitions, 10 changer transitions 1/41 dead transitions. [2023-11-17 12:06:22,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 41 transitions, 187 flow [2023-11-17 12:06:22,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:06:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:06:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2023-11-17 12:06:22,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2023-11-17 12:06:22,380 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 65 transitions. [2023-11-17 12:06:22,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 65 transitions. [2023-11-17 12:06:22,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:22,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 65 transitions. [2023-11-17 12:06:22,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 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 12:06:22,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:06:22,392 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:06:22,395 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 5 states and 65 transitions. [2023-11-17 12:06:22,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 41 transitions, 187 flow [2023-11-17 12:06:22,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 41 transitions, 169 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 12:06:22,402 INFO L231 Difference]: Finished difference. Result has 24 places, 26 transitions, 101 flow [2023-11-17 12:06:22,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=24, PETRI_TRANSITIONS=26} [2023-11-17 12:06:22,412 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2023-11-17 12:06:22,413 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 26 transitions, 101 flow [2023-11-17 12:06:22,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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 12:06:22,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:22,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:22,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 12:06:22,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:22,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:22,418 INFO L85 PathProgramCache]: Analyzing trace with hash -737727020, now seen corresponding path program 1 times [2023-11-17 12:06:22,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:22,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969038606] [2023-11-17 12:06:22,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:22,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:22,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:22,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969038606] [2023-11-17 12:06:22,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969038606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:06:22,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:06:22,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:06:22,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61321739] [2023-11-17 12:06:22,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:06:22,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:06:22,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:22,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:06:22,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:06:22,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:22,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 26 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 12:06:22,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:22,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:22,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:22,789 INFO L124 PetriNetUnfolderBase]: 131/225 cut-off events. [2023-11-17 12:06:22,789 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2023-11-17 12:06:22,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 225 events. 131/225 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 777 event pairs, 43 based on Foata normal form. 12/215 useless extension candidates. Maximal degree in co-relation 385. Up to 117 conditions per place. [2023-11-17 12:06:22,795 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 33 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2023-11-17 12:06:22,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 236 flow [2023-11-17 12:06:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:06:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:06:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2023-11-17 12:06:22,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2023-11-17 12:06:22,797 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 47 transitions. [2023-11-17 12:06:22,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 47 transitions. [2023-11-17 12:06:22,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:22,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 47 transitions. [2023-11-17 12:06:22,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 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 12:06:22,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 12:06:22,799 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 12:06:22,800 INFO L175 Difference]: Start difference. First operand has 24 places, 26 transitions, 101 flow. Second operand 4 states and 47 transitions. [2023-11-17 12:06:22,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 236 flow [2023-11-17 12:06:22,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 41 transitions, 230 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-17 12:06:22,803 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 153 flow [2023-11-17 12:06:22,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2023-11-17 12:06:22,804 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 9 predicate places. [2023-11-17 12:06:22,804 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 153 flow [2023-11-17 12:06:22,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 12:06:22,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:22,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:22,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 12:06:22,805 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:22,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:22,806 INFO L85 PathProgramCache]: Analyzing trace with hash 501723767, now seen corresponding path program 1 times [2023-11-17 12:06:22,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:22,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892386873] [2023-11-17 12:06:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:22,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:23,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:23,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892386873] [2023-11-17 12:06:23,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892386873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:06:23,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:06:23,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:06:23,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038986068] [2023-11-17 12:06:23,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:06:23,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:06:23,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:23,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:06:23,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:06:23,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:23,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 12:06:23,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:23,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:23,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:23,136 INFO L124 PetriNetUnfolderBase]: 105/186 cut-off events. [2023-11-17 12:06:23,137 INFO L125 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES. [2023-11-17 12:06:23,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 186 events. 105/186 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 614 event pairs, 30 based on Foata normal form. 5/190 useless extension candidates. Maximal degree in co-relation 546. Up to 104 conditions per place. [2023-11-17 12:06:23,139 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 29 selfloop transitions, 4 changer transitions 4/39 dead transitions. [2023-11-17 12:06:23,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 270 flow [2023-11-17 12:06:23,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:06:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:06:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2023-11-17 12:06:23,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2023-11-17 12:06:23,141 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 45 transitions. [2023-11-17 12:06:23,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 45 transitions. [2023-11-17 12:06:23,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:23,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 45 transitions. [2023-11-17 12:06:23,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 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 12:06:23,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 12:06:23,143 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 12:06:23,143 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 153 flow. Second operand 4 states and 45 transitions. [2023-11-17 12:06:23,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 270 flow [2023-11-17 12:06:23,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 266 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-17 12:06:23,146 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 139 flow [2023-11-17 12:06:23,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2023-11-17 12:06:23,147 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2023-11-17 12:06:23,147 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 139 flow [2023-11-17 12:06:23,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 12:06:23,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:23,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:23,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 12:06:23,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:23,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:23,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1968695862, now seen corresponding path program 1 times [2023-11-17 12:06:23,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:23,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146233938] [2023-11-17 12:06:23,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:23,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:23,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:23,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146233938] [2023-11-17 12:06:23,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146233938] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:23,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797183727] [2023-11-17 12:06:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:23,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:23,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:23,337 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 12:06:23,365 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 12:06:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:23,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 12:06:23,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:23,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:23,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797183727] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:23,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 12:06:23,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-11-17 12:06:23,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995830090] [2023-11-17 12:06:23,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:06:23,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 12:06:23,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:23,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 12:06:23,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-17 12:06:23,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:23,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 12:06:23,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:23,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:23,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:23,693 INFO L124 PetriNetUnfolderBase]: 82/139 cut-off events. [2023-11-17 12:06:23,693 INFO L125 PetriNetUnfolderBase]: For 342/342 co-relation queries the response was YES. [2023-11-17 12:06:23,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 139 events. 82/139 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 379 event pairs, 12 based on Foata normal form. 14/151 useless extension candidates. Maximal degree in co-relation 489. Up to 89 conditions per place. [2023-11-17 12:06:23,697 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 28 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2023-11-17 12:06:23,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 249 flow [2023-11-17 12:06:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:06:23,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:06:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2023-11-17 12:06:23,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2023-11-17 12:06:23,699 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 48 transitions. [2023-11-17 12:06:23,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 48 transitions. [2023-11-17 12:06:23,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:23,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 48 transitions. [2023-11-17 12:06:23,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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 12:06:23,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:06:23,703 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:06:23,703 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 139 flow. Second operand 5 states and 48 transitions. [2023-11-17 12:06:23,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 249 flow [2023-11-17 12:06:23,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 207 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-11-17 12:06:23,709 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 138 flow [2023-11-17 12:06:23,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2023-11-17 12:06:23,711 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2023-11-17 12:06:23,711 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 138 flow [2023-11-17 12:06:23,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 12:06:23,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:23,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:23,723 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 12:06:23,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:23,919 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:23,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:23,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1625074313, now seen corresponding path program 1 times [2023-11-17 12:06:23,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:23,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616207402] [2023-11-17 12:06:23,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:23,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:24,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:24,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616207402] [2023-11-17 12:06:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616207402] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:24,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277730832] [2023-11-17 12:06:24,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:24,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:24,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:24,054 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 12:06:24,076 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 12:06:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:24,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 12:06:24,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:24,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:24,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277730832] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:24,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 12:06:24,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2023-11-17 12:06:24,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335548023] [2023-11-17 12:06:24,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:06:24,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 12:06:24,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:24,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 12:06:24,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-17 12:06:24,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:24,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 12:06:24,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:24,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:24,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:24,345 INFO L124 PetriNetUnfolderBase]: 62/107 cut-off events. [2023-11-17 12:06:24,345 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-11-17 12:06:24,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 107 events. 62/107 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 229 event pairs, 7 based on Foata normal form. 9/113 useless extension candidates. Maximal degree in co-relation 371. Up to 86 conditions per place. [2023-11-17 12:06:24,347 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 27 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2023-11-17 12:06:24,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 230 flow [2023-11-17 12:06:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:06:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:06:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2023-11-17 12:06:24,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2023-11-17 12:06:24,349 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 48 transitions. [2023-11-17 12:06:24,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 48 transitions. [2023-11-17 12:06:24,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:24,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 48 transitions. [2023-11-17 12:06:24,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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 12:06:24,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:06:24,351 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:06:24,351 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 138 flow. Second operand 5 states and 48 transitions. [2023-11-17 12:06:24,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 230 flow [2023-11-17 12:06:24,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 227 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 12:06:24,354 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 159 flow [2023-11-17 12:06:24,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2023-11-17 12:06:24,357 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2023-11-17 12:06:24,357 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 159 flow [2023-11-17 12:06:24,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 12:06:24,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:24,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:24,366 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 12:06:24,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:24,566 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:24,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:24,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1396970963, now seen corresponding path program 1 times [2023-11-17 12:06:24,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:24,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12320235] [2023-11-17 12:06:24,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:24,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:26,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:26,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12320235] [2023-11-17 12:06:26,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12320235] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:26,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402940640] [2023-11-17 12:06:26,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:26,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:26,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:26,425 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 12:06:26,447 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 12:06:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:26,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-17 12:06:26,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:26,861 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 69 treesize of output 49 [2023-11-17 12:06:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:26,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:27,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:06:27,243 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 180 treesize of output 124 [2023-11-17 12:06:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:27,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402940640] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:06:27,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:06:27,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2023-11-17 12:06:27,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692803319] [2023-11-17 12:06:27,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:06:27,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-17 12:06:27,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:27,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-17 12:06:27,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-11-17 12:06:27,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:27,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 159 flow. Second operand has 18 states, 18 states have (on average 7.0) internal successors, (126), 18 states have internal predecessors, (126), 0 states have call successors, (0), 0 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 12:06:27,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:27,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:27,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:27,939 INFO L124 PetriNetUnfolderBase]: 91/165 cut-off events. [2023-11-17 12:06:27,939 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2023-11-17 12:06:27,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 165 events. 91/165 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 454 event pairs, 0 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 574. Up to 101 conditions per place. [2023-11-17 12:06:27,942 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 38 selfloop transitions, 26 changer transitions 4/70 dead transitions. [2023-11-17 12:06:27,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 70 transitions, 461 flow [2023-11-17 12:06:27,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 12:06:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-17 12:06:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 120 transitions. [2023-11-17 12:06:27,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2023-11-17 12:06:27,945 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 120 transitions. [2023-11-17 12:06:27,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 120 transitions. [2023-11-17 12:06:27,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:27,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 120 transitions. [2023-11-17 12:06:27,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:06:27,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 22.0) internal successors, (286), 13 states have internal predecessors, (286), 0 states have call successors, (0), 0 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 12:06:27,949 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 22.0) internal successors, (286), 13 states have internal predecessors, (286), 0 states have call successors, (0), 0 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 12:06:27,949 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 159 flow. Second operand 12 states and 120 transitions. [2023-11-17 12:06:27,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 70 transitions, 461 flow [2023-11-17 12:06:27,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 12:06:27,953 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 360 flow [2023-11-17 12:06:27,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=360, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2023-11-17 12:06:27,955 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2023-11-17 12:06:27,955 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 360 flow [2023-11-17 12:06:27,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.0) internal successors, (126), 18 states have internal predecessors, (126), 0 states have call successors, (0), 0 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 12:06:27,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:27,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:27,969 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 12:06:28,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:28,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:28,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash -681177235, now seen corresponding path program 2 times [2023-11-17 12:06:28,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:28,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115006930] [2023-11-17 12:06:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:29,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:29,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115006930] [2023-11-17 12:06:29,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115006930] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:29,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458756007] [2023-11-17 12:06:29,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:06:29,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:29,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:29,419 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 12:06:29,437 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 12:06:29,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:06:29,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:06:29,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-17 12:06:29,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:29,565 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 12:06:29,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:06:29,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:06:29,812 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 69 treesize of output 49 [2023-11-17 12:06:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:29,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:30,584 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* c_~j~0 4))) (.cse3 (+ c_~A~0.offset (* c_~i~0 4))) (.cse4 (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0)) (.cse5 (< 2147483647 (+ c_~bag2~0 c_~sum2~0)))) (and (or (forall ((v_ArrVal_130 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_130) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse3))) (or (< 2147483647 (+ c_~bag1~0 .cse0)) (< (+ c_~bag1~0 .cse0 2147483648) 0) (= (+ c_~bag2~0 (select .cse1 .cse2) c_~sum2~0) (+ c_~bag1~0 .cse0 c_~sum1~0)))))) .cse4 .cse5) (forall ((v_ArrVal_130 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_130) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse2)) (.cse7 (select .cse8 .cse3))) (or (< (+ c_~bag2~0 .cse6 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse6)) (< 2147483647 (+ c_~bag1~0 .cse7)) (< (+ c_~bag1~0 .cse7 2147483648) 0) (= (+ c_~bag2~0 .cse6 c_~sum2~0) (+ c_~bag1~0 .cse7 c_~sum1~0)))))) (or (< 2147483647 (+ c_~bag1~0 c_~sum1~0)) (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0) (and (forall ((v_ArrVal_130 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_130) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse2))) (or (< (+ c_~bag2~0 .cse9 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse9)) (= (+ c_~bag2~0 .cse9 c_~sum2~0) (+ c_~bag1~0 (select .cse10 .cse3) c_~sum1~0)))))) (or (forall ((v_ArrVal_130 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_130) c_~A~0.base))) (= (+ c_~bag2~0 (select .cse11 .cse2) c_~sum2~0) (+ c_~bag1~0 (select .cse11 .cse3) c_~sum1~0)))) .cse4 .cse5))))) is different from false [2023-11-17 12:06:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:30,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458756007] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:06:30,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:06:30,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2023-11-17 12:06:30,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248869750] [2023-11-17 12:06:30,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:06:30,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 12:06:30,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:30,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 12:06:30,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=272, Unknown=1, NotChecked=34, Total=380 [2023-11-17 12:06:30,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:30,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 360 flow. Second operand has 20 states, 20 states have (on average 6.75) internal successors, (135), 20 states have internal predecessors, (135), 0 states have call successors, (0), 0 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 12:06:30,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:30,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:30,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:31,070 INFO L124 PetriNetUnfolderBase]: 97/176 cut-off events. [2023-11-17 12:06:31,070 INFO L125 PetriNetUnfolderBase]: For 475/479 co-relation queries the response was YES. [2023-11-17 12:06:31,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 176 events. 97/176 cut-off events. For 475/479 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 4 based on Foata normal form. 1/173 useless extension candidates. Maximal degree in co-relation 770. Up to 124 conditions per place. [2023-11-17 12:06:31,072 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 33 selfloop transitions, 27 changer transitions 4/66 dead transitions. [2023-11-17 12:06:31,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 580 flow [2023-11-17 12:06:31,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 12:06:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 12:06:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2023-11-17 12:06:31,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2023-11-17 12:06:31,074 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 99 transitions. [2023-11-17 12:06:31,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 99 transitions. [2023-11-17 12:06:31,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:31,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 99 transitions. [2023-11-17 12:06:31,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 0 states have call successors, (0), 0 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 12:06:31,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 22.0) internal successors, (242), 11 states have internal predecessors, (242), 0 states have call successors, (0), 0 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 12:06:31,076 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 22.0) internal successors, (242), 11 states have internal predecessors, (242), 0 states have call successors, (0), 0 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 12:06:31,076 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 360 flow. Second operand 10 states and 99 transitions. [2023-11-17 12:06:31,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 580 flow [2023-11-17 12:06:31,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 518 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-11-17 12:06:31,081 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 430 flow [2023-11-17 12:06:31,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=430, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2023-11-17 12:06:31,082 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 36 predicate places. [2023-11-17 12:06:31,083 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 430 flow [2023-11-17 12:06:31,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.75) internal successors, (135), 20 states have internal predecessors, (135), 0 states have call successors, (0), 0 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 12:06:31,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:31,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:31,094 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 12:06:31,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:31,291 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:31,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2046852201, now seen corresponding path program 3 times [2023-11-17 12:06:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:31,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989576184] [2023-11-17 12:06:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:32,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:32,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989576184] [2023-11-17 12:06:32,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989576184] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:32,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587337344] [2023-11-17 12:06:32,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:06:32,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:32,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:32,733 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 12:06:32,759 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 12:06:32,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 12:06:32,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:06:32,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-17 12:06:32,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:32,874 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 12:06:32,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:06:32,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:06:33,083 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 69 treesize of output 49 [2023-11-17 12:06:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:33,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:33,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587337344] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:06:33,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:06:33,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2023-11-17 12:06:33,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701064826] [2023-11-17 12:06:33,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:06:33,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 12:06:33,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:33,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 12:06:33,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=309, Unknown=3, NotChecked=0, Total=380 [2023-11-17 12:06:33,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:33,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 430 flow. Second operand has 20 states, 20 states have (on average 6.75) internal successors, (135), 20 states have internal predecessors, (135), 0 states have call successors, (0), 0 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 12:06:33,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:33,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:33,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:34,374 INFO L124 PetriNetUnfolderBase]: 111/197 cut-off events. [2023-11-17 12:06:34,375 INFO L125 PetriNetUnfolderBase]: For 604/606 co-relation queries the response was YES. [2023-11-17 12:06:34,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 197 events. 111/197 cut-off events. For 604/606 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 580 event pairs, 2 based on Foata normal form. 1/195 useless extension candidates. Maximal degree in co-relation 871. Up to 137 conditions per place. [2023-11-17 12:06:34,378 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 41 selfloop transitions, 32 changer transitions 4/79 dead transitions. [2023-11-17 12:06:34,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 79 transitions, 704 flow [2023-11-17 12:06:34,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 12:06:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-17 12:06:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 130 transitions. [2023-11-17 12:06:34,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2023-11-17 12:06:34,380 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 130 transitions. [2023-11-17 12:06:34,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 130 transitions. [2023-11-17 12:06:34,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:34,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 130 transitions. [2023-11-17 12:06:34,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 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 12:06:34,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 22.0) internal successors, (308), 14 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 12:06:34,383 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 22.0) internal successors, (308), 14 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 12:06:34,383 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 430 flow. Second operand 13 states and 130 transitions. [2023-11-17 12:06:34,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 79 transitions, 704 flow [2023-11-17 12:06:34,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 612 flow, removed 11 selfloop flow, removed 8 redundant places. [2023-11-17 12:06:34,389 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 470 flow [2023-11-17 12:06:34,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=470, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2023-11-17 12:06:34,392 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 42 predicate places. [2023-11-17 12:06:34,392 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 470 flow [2023-11-17 12:06:34,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.75) internal successors, (135), 20 states have internal predecessors, (135), 0 states have call successors, (0), 0 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 12:06:34,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:34,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:34,403 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 12:06:34,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:34,601 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:34,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:34,602 INFO L85 PathProgramCache]: Analyzing trace with hash 959448279, now seen corresponding path program 4 times [2023-11-17 12:06:34,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:34,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867964151] [2023-11-17 12:06:34,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:34,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:35,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:35,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867964151] [2023-11-17 12:06:35,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867964151] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:35,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898467292] [2023-11-17 12:06:35,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:06:35,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:35,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:35,607 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 12:06:35,626 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 12:06:35,727 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:06:35,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:06:35,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-17 12:06:35,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:35,983 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 61 treesize of output 41 [2023-11-17 12:06:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:36,044 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:36,364 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:06:36,365 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 218 treesize of output 158 [2023-11-17 12:06:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:36,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898467292] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:06:36,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:06:36,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2023-11-17 12:06:36,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322591926] [2023-11-17 12:06:36,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:06:36,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 12:06:36,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:36,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 12:06:36,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2023-11-17 12:06:36,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:36,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 470 flow. Second operand has 20 states, 20 states have (on average 6.85) internal successors, (137), 20 states have internal predecessors, (137), 0 states have call successors, (0), 0 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 12:06:36,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:36,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:36,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:38,558 INFO L124 PetriNetUnfolderBase]: 341/590 cut-off events. [2023-11-17 12:06:38,558 INFO L125 PetriNetUnfolderBase]: For 1954/1956 co-relation queries the response was YES. [2023-11-17 12:06:38,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3077 conditions, 590 events. 341/590 cut-off events. For 1954/1956 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2472 event pairs, 2 based on Foata normal form. 4/585 useless extension candidates. Maximal degree in co-relation 2470. Up to 233 conditions per place. [2023-11-17 12:06:38,565 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 96 selfloop transitions, 123 changer transitions 18/239 dead transitions. [2023-11-17 12:06:38,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 239 transitions, 2156 flow [2023-11-17 12:06:38,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-17 12:06:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-11-17 12:06:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 364 transitions. [2023-11-17 12:06:38,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2023-11-17 12:06:38,568 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 364 transitions. [2023-11-17 12:06:38,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 364 transitions. [2023-11-17 12:06:38,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:38,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 364 transitions. [2023-11-17 12:06:38,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 10.4) internal successors, (364), 35 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 12:06:38,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 22.0) internal successors, (792), 36 states have internal predecessors, (792), 0 states have call successors, (0), 0 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 12:06:38,572 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 22.0) internal successors, (792), 36 states have internal predecessors, (792), 0 states have call successors, (0), 0 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 12:06:38,572 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 470 flow. Second operand 35 states and 364 transitions. [2023-11-17 12:06:38,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 239 transitions, 2156 flow [2023-11-17 12:06:38,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 239 transitions, 1984 flow, removed 19 selfloop flow, removed 12 redundant places. [2023-11-17 12:06:38,586 INFO L231 Difference]: Finished difference. Result has 93 places, 151 transitions, 1619 flow [2023-11-17 12:06:38,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1619, PETRI_PLACES=93, PETRI_TRANSITIONS=151} [2023-11-17 12:06:38,588 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 72 predicate places. [2023-11-17 12:06:38,588 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 151 transitions, 1619 flow [2023-11-17 12:06:38,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 20 states have internal predecessors, (137), 0 states have call successors, (0), 0 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 12:06:38,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:38,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:38,599 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 12:06:38,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:38,797 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:38,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:38,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2137670995, now seen corresponding path program 5 times [2023-11-17 12:06:38,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:38,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242493104] [2023-11-17 12:06:38,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:38,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:40,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:40,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242493104] [2023-11-17 12:06:40,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242493104] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:40,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224100591] [2023-11-17 12:06:40,145 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 12:06:40,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:40,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:40,147 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 12:06:40,168 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 12:06:40,253 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:06:40,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:06:40,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-17 12:06:40,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:40,473 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 61 treesize of output 41 [2023-11-17 12:06:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:40,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:40,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:06:40,730 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 218 treesize of output 162 [2023-11-17 12:06:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:41,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224100591] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:06:41,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:06:41,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2023-11-17 12:06:41,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411025867] [2023-11-17 12:06:41,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:06:41,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-17 12:06:41,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:41,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-17 12:06:41,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-11-17 12:06:41,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:41,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 151 transitions, 1619 flow. Second operand has 18 states, 18 states have (on average 7.0) internal successors, (126), 18 states have internal predecessors, (126), 0 states have call successors, (0), 0 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 12:06:41,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:41,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:41,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:41,430 INFO L124 PetriNetUnfolderBase]: 336/581 cut-off events. [2023-11-17 12:06:41,430 INFO L125 PetriNetUnfolderBase]: For 2649/2649 co-relation queries the response was YES. [2023-11-17 12:06:41,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 581 events. 336/581 cut-off events. For 2649/2649 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2461 event pairs, 20 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 3317. Up to 512 conditions per place. [2023-11-17 12:06:41,437 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 123 selfloop transitions, 41 changer transitions 4/170 dead transitions. [2023-11-17 12:06:41,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 170 transitions, 2051 flow [2023-11-17 12:06:41,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 12:06:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 12:06:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2023-11-17 12:06:41,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4297520661157025 [2023-11-17 12:06:41,439 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 104 transitions. [2023-11-17 12:06:41,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 104 transitions. [2023-11-17 12:06:41,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:41,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 104 transitions. [2023-11-17 12:06:41,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 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 12:06:41,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 22.0) internal successors, (264), 12 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 12:06:41,442 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 22.0) internal successors, (264), 12 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 12:06:41,442 INFO L175 Difference]: Start difference. First operand has 93 places, 151 transitions, 1619 flow. Second operand 11 states and 104 transitions. [2023-11-17 12:06:41,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 170 transitions, 2051 flow [2023-11-17 12:06:41,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 170 transitions, 1533 flow, removed 251 selfloop flow, removed 7 redundant places. [2023-11-17 12:06:41,469 INFO L231 Difference]: Finished difference. Result has 96 places, 154 transitions, 1265 flow [2023-11-17 12:06:41,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1265, PETRI_PLACES=96, PETRI_TRANSITIONS=154} [2023-11-17 12:06:41,470 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 75 predicate places. [2023-11-17 12:06:41,470 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 154 transitions, 1265 flow [2023-11-17 12:06:41,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.0) internal successors, (126), 18 states have internal predecessors, (126), 0 states have call successors, (0), 0 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 12:06:41,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:41,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:41,481 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 12:06:41,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:41,679 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:41,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:41,679 INFO L85 PathProgramCache]: Analyzing trace with hash -790284103, now seen corresponding path program 6 times [2023-11-17 12:06:41,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:41,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249512690] [2023-11-17 12:06:41,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:41,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:42,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:42,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249512690] [2023-11-17 12:06:42,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249512690] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:42,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657903885] [2023-11-17 12:06:42,186 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 12:06:42,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:42,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:42,188 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 12:06:42,205 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 12:06:42,293 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-17 12:06:42,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:06:42,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 12:06:42,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:42,345 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 12:06:42,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:06:42,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:06:42,637 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 61 treesize of output 41 [2023-11-17 12:06:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:42,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:43,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657903885] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:06:43,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:06:43,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 18 [2023-11-17 12:06:43,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778808100] [2023-11-17 12:06:43,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:06:43,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 12:06:43,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:43,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 12:06:43,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=278, Unknown=1, NotChecked=0, Total=342 [2023-11-17 12:06:43,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:43,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 154 transitions, 1265 flow. Second operand has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 19 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:06:43,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:43,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:43,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:45,683 INFO L124 PetriNetUnfolderBase]: 402/689 cut-off events. [2023-11-17 12:06:45,683 INFO L125 PetriNetUnfolderBase]: For 1567/1567 co-relation queries the response was YES. [2023-11-17 12:06:45,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3156 conditions, 689 events. 402/689 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3055 event pairs, 0 based on Foata normal form. 2/679 useless extension candidates. Maximal degree in co-relation 3048. Up to 280 conditions per place. [2023-11-17 12:06:45,691 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 105 selfloop transitions, 143 changer transitions 6/256 dead transitions. [2023-11-17 12:06:45,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 256 transitions, 2236 flow [2023-11-17 12:06:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-17 12:06:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-17 12:06:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 292 transitions. [2023-11-17 12:06:45,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2023-11-17 12:06:45,696 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 292 transitions. [2023-11-17 12:06:45,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 292 transitions. [2023-11-17 12:06:45,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:45,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 292 transitions. [2023-11-17 12:06:45,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 10.428571428571429) internal successors, (292), 28 states have internal predecessors, (292), 0 states have call successors, (0), 0 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 12:06:45,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 22.0) internal successors, (638), 29 states have internal predecessors, (638), 0 states have call successors, (0), 0 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 12:06:45,700 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 22.0) internal successors, (638), 29 states have internal predecessors, (638), 0 states have call successors, (0), 0 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 12:06:45,700 INFO L175 Difference]: Start difference. First operand has 96 places, 154 transitions, 1265 flow. Second operand 28 states and 292 transitions. [2023-11-17 12:06:45,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 256 transitions, 2236 flow [2023-11-17 12:06:45,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 256 transitions, 2120 flow, removed 7 selfloop flow, removed 9 redundant places. [2023-11-17 12:06:45,721 INFO L231 Difference]: Finished difference. Result has 117 places, 186 transitions, 1799 flow [2023-11-17 12:06:45,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1799, PETRI_PLACES=117, PETRI_TRANSITIONS=186} [2023-11-17 12:06:45,722 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 96 predicate places. [2023-11-17 12:06:45,722 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 186 transitions, 1799 flow [2023-11-17 12:06:45,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 19 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:06:45,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:45,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:45,733 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 12:06:45,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-17 12:06:45,931 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:45,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:45,932 INFO L85 PathProgramCache]: Analyzing trace with hash 627885565, now seen corresponding path program 7 times [2023-11-17 12:06:45,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:45,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614048685] [2023-11-17 12:06:45,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:45,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:46,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:46,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614048685] [2023-11-17 12:06:46,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614048685] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:46,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516137873] [2023-11-17 12:06:46,884 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 12:06:46,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:46,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:46,885 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 12:06:46,908 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 12:06:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:46,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-17 12:06:47,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:47,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:06:47,017 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 10 treesize of output 8 [2023-11-17 12:06:47,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 12:06:47,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:06:47,254 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 16 treesize of output 11 [2023-11-17 12:06:47,361 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 69 treesize of output 49 [2023-11-17 12:06:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:47,395 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:48,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:06:48,258 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 44 treesize of output 33 [2023-11-17 12:06:48,261 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 246 treesize of output 214 [2023-11-17 12:06:48,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-11-17 12:06:48,267 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 14 treesize of output 12 [2023-11-17 12:06:48,284 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:06:48,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 1 [2023-11-17 12:06:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:48,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516137873] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:06:48,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:06:48,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-11-17 12:06:48,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132571395] [2023-11-17 12:06:48,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:06:48,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-17 12:06:48,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:48,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-17 12:06:48,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=460, Unknown=5, NotChecked=0, Total=552 [2023-11-17 12:06:48,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:48,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 186 transitions, 1799 flow. Second operand has 24 states, 24 states have (on average 6.708333333333333) internal successors, (161), 24 states have internal predecessors, (161), 0 states have call successors, (0), 0 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 12:06:48,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:48,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:48,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:48,749 INFO L124 PetriNetUnfolderBase]: 417/718 cut-off events. [2023-11-17 12:06:48,749 INFO L125 PetriNetUnfolderBase]: For 2258/2258 co-relation queries the response was YES. [2023-11-17 12:06:48,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3755 conditions, 718 events. 417/718 cut-off events. For 2258/2258 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3187 event pairs, 12 based on Foata normal form. 1/709 useless extension candidates. Maximal degree in co-relation 3639. Up to 546 conditions per place. [2023-11-17 12:06:48,758 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 138 selfloop transitions, 67 changer transitions 5/212 dead transitions. [2023-11-17 12:06:48,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 212 transitions, 2359 flow [2023-11-17 12:06:48,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 12:06:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 12:06:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2023-11-17 12:06:48,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681818181818182 [2023-11-17 12:06:48,760 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 103 transitions. [2023-11-17 12:06:48,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 103 transitions. [2023-11-17 12:06:48,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:48,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 103 transitions. [2023-11-17 12:06:48,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 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 12:06:48,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 22.0) internal successors, (242), 11 states have internal predecessors, (242), 0 states have call successors, (0), 0 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 12:06:48,761 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 22.0) internal successors, (242), 11 states have internal predecessors, (242), 0 states have call successors, (0), 0 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 12:06:48,762 INFO L175 Difference]: Start difference. First operand has 117 places, 186 transitions, 1799 flow. Second operand 10 states and 103 transitions. [2023-11-17 12:06:48,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 212 transitions, 2359 flow [2023-11-17 12:06:48,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 212 transitions, 2094 flow, removed 77 selfloop flow, removed 12 redundant places. [2023-11-17 12:06:48,782 INFO L231 Difference]: Finished difference. Result has 118 places, 191 transitions, 1809 flow [2023-11-17 12:06:48,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1809, PETRI_PLACES=118, PETRI_TRANSITIONS=191} [2023-11-17 12:06:48,783 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 97 predicate places. [2023-11-17 12:06:48,783 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 191 transitions, 1809 flow [2023-11-17 12:06:48,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.708333333333333) internal successors, (161), 24 states have internal predecessors, (161), 0 states have call successors, (0), 0 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 12:06:48,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:48,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:48,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-17 12:06:48,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:48,989 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:48,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:48,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1496982647, now seen corresponding path program 8 times [2023-11-17 12:06:48,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:48,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041069727] [2023-11-17 12:06:48,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:48,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:49,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:49,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041069727] [2023-11-17 12:06:49,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041069727] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:49,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202923044] [2023-11-17 12:06:49,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:06:49,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:49,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:49,633 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 12:06:49,652 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 12:06:49,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:06:49,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:06:49,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-17 12:06:49,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:49,773 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 12:06:49,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:06:49,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:06:49,925 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 16 treesize of output 11 [2023-11-17 12:06:49,996 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 69 treesize of output 49 [2023-11-17 12:06:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:50,044 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:50,621 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_291 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ .cse0 2147483648) 0) (= .cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_291 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (= (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2023-11-17 12:06:50,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:06:50,631 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 44 treesize of output 33 [2023-11-17 12:06:50,633 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 246 treesize of output 214 [2023-11-17 12:06:50,637 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 16 treesize of output 14 [2023-11-17 12:06:50,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-11-17 12:06:50,651 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:06:50,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 1 [2023-11-17 12:06:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-17 12:06:50,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202923044] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:06:50,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:06:50,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-11-17 12:06:50,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227506249] [2023-11-17 12:06:50,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:06:50,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 12:06:50,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:50,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 12:06:50,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=347, Unknown=7, NotChecked=38, Total=462 [2023-11-17 12:06:50,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:50,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 191 transitions, 1809 flow. Second operand has 22 states, 22 states have (on average 6.636363636363637) internal successors, (146), 22 states have internal predecessors, (146), 0 states have call successors, (0), 0 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 12:06:50,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:50,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:50,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:51,199 INFO L124 PetriNetUnfolderBase]: 423/733 cut-off events. [2023-11-17 12:06:51,200 INFO L125 PetriNetUnfolderBase]: For 2583/2583 co-relation queries the response was YES. [2023-11-17 12:06:51,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3834 conditions, 733 events. 423/733 cut-off events. For 2583/2583 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3357 event pairs, 25 based on Foata normal form. 1/716 useless extension candidates. Maximal degree in co-relation 3706. Up to 640 conditions per place. [2023-11-17 12:06:51,209 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 156 selfloop transitions, 50 changer transitions 5/213 dead transitions. [2023-11-17 12:06:51,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 213 transitions, 2327 flow [2023-11-17 12:06:51,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 12:06:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-17 12:06:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2023-11-17 12:06:51,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45075757575757575 [2023-11-17 12:06:51,211 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 119 transitions. [2023-11-17 12:06:51,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 119 transitions. [2023-11-17 12:06:51,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:51,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 119 transitions. [2023-11-17 12:06:51,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 12:06:51,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 22.0) internal successors, (286), 13 states have internal predecessors, (286), 0 states have call successors, (0), 0 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 12:06:51,212 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 22.0) internal successors, (286), 13 states have internal predecessors, (286), 0 states have call successors, (0), 0 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 12:06:51,212 INFO L175 Difference]: Start difference. First operand has 118 places, 191 transitions, 1809 flow. Second operand 12 states and 119 transitions. [2023-11-17 12:06:51,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 213 transitions, 2327 flow [2023-11-17 12:06:51,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 213 transitions, 2169 flow, removed 17 selfloop flow, removed 7 redundant places. [2023-11-17 12:06:51,232 INFO L231 Difference]: Finished difference. Result has 124 places, 193 transitions, 1800 flow [2023-11-17 12:06:51,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1800, PETRI_PLACES=124, PETRI_TRANSITIONS=193} [2023-11-17 12:06:51,233 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 103 predicate places. [2023-11-17 12:06:51,233 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 193 transitions, 1800 flow [2023-11-17 12:06:51,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.636363636363637) internal successors, (146), 22 states have internal predecessors, (146), 0 states have call successors, (0), 0 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 12:06:51,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:51,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:51,244 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 12:06:51,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-17 12:06:51,441 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:51,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1228241773, now seen corresponding path program 9 times [2023-11-17 12:06:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:51,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175109973] [2023-11-17 12:06:51,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:51,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:52,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:52,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175109973] [2023-11-17 12:06:52,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175109973] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:52,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885447850] [2023-11-17 12:06:52,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:06:52,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:52,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:52,049 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:06:52,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-17 12:06:52,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 12:06:52,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:06:52,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 12:06:52,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:52,201 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 12:06:52,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:06:52,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:06:52,382 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 16 treesize of output 11 [2023-11-17 12:06:52,471 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 69 treesize of output 49 [2023-11-17 12:06:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:52,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:53,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:06:53,164 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 97 treesize of output 61 [2023-11-17 12:06:53,167 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 488 treesize of output 440 [2023-11-17 12:06:53,175 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 64 treesize of output 52 [2023-11-17 12:06:53,183 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 9 treesize of output 7 [2023-11-17 12:06:53,196 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:06:53,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 1 [2023-11-17 12:06:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:53,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885447850] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:06:53,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:06:53,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2023-11-17 12:06:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692579976] [2023-11-17 12:06:53,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:06:53,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-17 12:06:53,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:53,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-17 12:06:53,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=424, Unknown=2, NotChecked=0, Total=506 [2023-11-17 12:06:53,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:53,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 193 transitions, 1800 flow. Second operand has 23 states, 23 states have (on average 6.608695652173913) internal successors, (152), 23 states have internal predecessors, (152), 0 states have call successors, (0), 0 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 12:06:53,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:53,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:53,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:53,897 INFO L124 PetriNetUnfolderBase]: 429/746 cut-off events. [2023-11-17 12:06:53,897 INFO L125 PetriNetUnfolderBase]: For 2456/2456 co-relation queries the response was YES. [2023-11-17 12:06:53,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3820 conditions, 746 events. 429/746 cut-off events. For 2456/2456 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3418 event pairs, 12 based on Foata normal form. 1/729 useless extension candidates. Maximal degree in co-relation 3689. Up to 601 conditions per place. [2023-11-17 12:06:53,905 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 142 selfloop transitions, 73 changer transitions 4/221 dead transitions. [2023-11-17 12:06:53,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 221 transitions, 2374 flow [2023-11-17 12:06:53,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-17 12:06:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-17 12:06:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2023-11-17 12:06:53,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2023-11-17 12:06:53,907 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 141 transitions. [2023-11-17 12:06:53,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 141 transitions. [2023-11-17 12:06:53,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:53,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 141 transitions. [2023-11-17 12:06:53,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 9.4) internal successors, (141), 15 states have internal predecessors, (141), 0 states have call successors, (0), 0 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 12:06:53,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 22.0) internal successors, (352), 16 states have internal predecessors, (352), 0 states have call successors, (0), 0 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 12:06:53,909 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 22.0) internal successors, (352), 16 states have internal predecessors, (352), 0 states have call successors, (0), 0 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 12:06:53,909 INFO L175 Difference]: Start difference. First operand has 124 places, 193 transitions, 1800 flow. Second operand 15 states and 141 transitions. [2023-11-17 12:06:53,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 221 transitions, 2374 flow [2023-11-17 12:06:53,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 221 transitions, 2286 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-11-17 12:06:53,929 INFO L231 Difference]: Finished difference. Result has 133 places, 200 transitions, 1962 flow [2023-11-17 12:06:53,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1712, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1962, PETRI_PLACES=133, PETRI_TRANSITIONS=200} [2023-11-17 12:06:53,930 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 112 predicate places. [2023-11-17 12:06:53,930 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 200 transitions, 1962 flow [2023-11-17 12:06:53,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.608695652173913) internal successors, (152), 23 states have internal predecessors, (152), 0 states have call successors, (0), 0 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 12:06:53,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:53,930 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:53,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-17 12:06:54,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-17 12:06:54,138 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:54,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:54,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1222946410, now seen corresponding path program 10 times [2023-11-17 12:06:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:54,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060835744] [2023-11-17 12:06:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:54,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:54,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060835744] [2023-11-17 12:06:54,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060835744] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:54,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791800303] [2023-11-17 12:06:54,266 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:06:54,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:54,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:54,268 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:06:54,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-17 12:06:54,391 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:06:54,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:06:54,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 12:06:54,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:54,455 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:54,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791800303] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:06:54,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:06:54,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-17 12:06:54,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321781209] [2023-11-17 12:06:54,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:06:54,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 12:06:54,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:54,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 12:06:54,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-17 12:06:54,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:54,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 200 transitions, 1962 flow. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 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 12:06:54,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:54,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:54,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:54,748 INFO L124 PetriNetUnfolderBase]: 336/673 cut-off events. [2023-11-17 12:06:54,748 INFO L125 PetriNetUnfolderBase]: For 3515/3521 co-relation queries the response was YES. [2023-11-17 12:06:54,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3624 conditions, 673 events. 336/673 cut-off events. For 3515/3521 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3548 event pairs, 62 based on Foata normal form. 64/731 useless extension candidates. Maximal degree in co-relation 3540. Up to 251 conditions per place. [2023-11-17 12:06:54,756 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 152 selfloop transitions, 27 changer transitions 11/192 dead transitions. [2023-11-17 12:06:54,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 192 transitions, 2313 flow [2023-11-17 12:06:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 12:06:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 12:06:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2023-11-17 12:06:54,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935064935064935 [2023-11-17 12:06:54,758 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 76 transitions. [2023-11-17 12:06:54,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 76 transitions. [2023-11-17 12:06:54,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:54,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 76 transitions. [2023-11-17 12:06:54,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 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 12:06:54,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 0 states have call successors, (0), 0 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 12:06:54,759 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 0 states have call successors, (0), 0 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 12:06:54,759 INFO L175 Difference]: Start difference. First operand has 133 places, 200 transitions, 1962 flow. Second operand 7 states and 76 transitions. [2023-11-17 12:06:54,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 192 transitions, 2313 flow [2023-11-17 12:06:54,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 192 transitions, 2134 flow, removed 26 selfloop flow, removed 14 redundant places. [2023-11-17 12:06:54,781 INFO L231 Difference]: Finished difference. Result has 124 places, 150 transitions, 1535 flow [2023-11-17 12:06:54,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1535, PETRI_PLACES=124, PETRI_TRANSITIONS=150} [2023-11-17 12:06:54,783 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 103 predicate places. [2023-11-17 12:06:54,783 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 150 transitions, 1535 flow [2023-11-17 12:06:54,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 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 12:06:54,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:54,784 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:54,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-17 12:06:54,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-17 12:06:54,992 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:54,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:54,992 INFO L85 PathProgramCache]: Analyzing trace with hash -76700553, now seen corresponding path program 11 times [2023-11-17 12:06:54,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:54,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424645885] [2023-11-17 12:06:54,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:55,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:55,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424645885] [2023-11-17 12:06:55,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424645885] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:55,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68391699] [2023-11-17 12:06:55,116 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 12:06:55,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:55,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:55,117 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:06:55,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-17 12:06:55,243 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:06:55,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:06:55,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-17 12:06:55,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:55,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:06:55,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68391699] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:06:55,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:06:55,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2023-11-17 12:06:55,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386271019] [2023-11-17 12:06:55,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:06:55,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 12:06:55,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:55,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 12:06:55,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-11-17 12:06:55,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:55,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 150 transitions, 1535 flow. Second operand has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 0 states have call successors, (0), 0 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 12:06:55,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:55,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:55,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:55,892 INFO L124 PetriNetUnfolderBase]: 219/442 cut-off events. [2023-11-17 12:06:55,893 INFO L125 PetriNetUnfolderBase]: For 2593/2593 co-relation queries the response was YES. [2023-11-17 12:06:55,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2631 conditions, 442 events. 219/442 cut-off events. For 2593/2593 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1957 event pairs, 4 based on Foata normal form. 63/499 useless extension candidates. Maximal degree in co-relation 2585. Up to 136 conditions per place. [2023-11-17 12:06:55,900 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 88 selfloop transitions, 61 changer transitions 19/170 dead transitions. [2023-11-17 12:06:55,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 170 transitions, 1930 flow [2023-11-17 12:06:55,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 12:06:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-17 12:06:55,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 243 transitions. [2023-11-17 12:06:55,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2023-11-17 12:06:55,902 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 243 transitions. [2023-11-17 12:06:55,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 243 transitions. [2023-11-17 12:06:55,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:55,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 243 transitions. [2023-11-17 12:06:55,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 10.125) internal successors, (243), 24 states have internal predecessors, (243), 0 states have call successors, (0), 0 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 12:06:55,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 22.0) internal successors, (550), 25 states have internal predecessors, (550), 0 states have call successors, (0), 0 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 12:06:55,904 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 22.0) internal successors, (550), 25 states have internal predecessors, (550), 0 states have call successors, (0), 0 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 12:06:55,904 INFO L175 Difference]: Start difference. First operand has 124 places, 150 transitions, 1535 flow. Second operand 24 states and 243 transitions. [2023-11-17 12:06:55,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 170 transitions, 1930 flow [2023-11-17 12:06:55,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 170 transitions, 1710 flow, removed 18 selfloop flow, removed 20 redundant places. [2023-11-17 12:06:55,919 INFO L231 Difference]: Finished difference. Result has 128 places, 111 transitions, 1350 flow [2023-11-17 12:06:55,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1350, PETRI_PLACES=128, PETRI_TRANSITIONS=111} [2023-11-17 12:06:55,920 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 107 predicate places. [2023-11-17 12:06:55,920 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 111 transitions, 1350 flow [2023-11-17 12:06:55,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 0 states have call successors, (0), 0 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 12:06:55,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:55,921 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:55,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-17 12:06:56,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-17 12:06:56,128 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:56,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:56,129 INFO L85 PathProgramCache]: Analyzing trace with hash -856330559, now seen corresponding path program 12 times [2023-11-17 12:06:56,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:56,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119580946] [2023-11-17 12:06:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:56,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:06:56,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:56,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119580946] [2023-11-17 12:06:56,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119580946] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:56,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040650661] [2023-11-17 12:06:56,264 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 12:06:56,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:56,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:56,266 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:06:56,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-17 12:06:56,398 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 12:06:56,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:06:56,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 12:06:56,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:06:56,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:06:56,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040650661] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:06:56,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:06:56,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 12:06:56,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590632212] [2023-11-17 12:06:56,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:06:56,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 12:06:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:56,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 12:06:56,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-17 12:06:56,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:56,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 111 transitions, 1350 flow. Second operand has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 12:06:56,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:56,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:56,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:56,701 INFO L124 PetriNetUnfolderBase]: 176/330 cut-off events. [2023-11-17 12:06:56,701 INFO L125 PetriNetUnfolderBase]: For 3457/3457 co-relation queries the response was YES. [2023-11-17 12:06:56,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 330 events. 176/330 cut-off events. For 3457/3457 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1205 event pairs, 20 based on Foata normal form. 19/347 useless extension candidates. Maximal degree in co-relation 2136. Up to 245 conditions per place. [2023-11-17 12:06:56,706 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 81 selfloop transitions, 23 changer transitions 0/106 dead transitions. [2023-11-17 12:06:56,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 106 transitions, 1497 flow [2023-11-17 12:06:56,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 12:06:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 12:06:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2023-11-17 12:06:56,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2023-11-17 12:06:56,708 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 70 transitions. [2023-11-17 12:06:56,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 70 transitions. [2023-11-17 12:06:56,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:56,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 70 transitions. [2023-11-17 12:06:56,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 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 12:06:56,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 states have internal predecessors, (198), 0 states have call successors, (0), 0 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 12:06:56,709 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 states have internal predecessors, (198), 0 states have call successors, (0), 0 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 12:06:56,709 INFO L175 Difference]: Start difference. First operand has 128 places, 111 transitions, 1350 flow. Second operand 8 states and 70 transitions. [2023-11-17 12:06:56,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 106 transitions, 1497 flow [2023-11-17 12:06:56,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 106 transitions, 1094 flow, removed 181 selfloop flow, removed 13 redundant places. [2023-11-17 12:06:56,727 INFO L231 Difference]: Finished difference. Result has 102 places, 98 transitions, 865 flow [2023-11-17 12:06:56,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=865, PETRI_PLACES=102, PETRI_TRANSITIONS=98} [2023-11-17 12:06:56,728 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 81 predicate places. [2023-11-17 12:06:56,729 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 98 transitions, 865 flow [2023-11-17 12:06:56,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 12:06:56,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:56,729 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:56,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-17 12:06:56,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:56,941 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:56,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:56,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1974418962, now seen corresponding path program 13 times [2023-11-17 12:06:56,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:56,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471833763] [2023-11-17 12:06:56,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:56,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:06:57,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:57,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471833763] [2023-11-17 12:06:57,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471833763] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:57,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378116928] [2023-11-17 12:06:57,069 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 12:06:57,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:57,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:57,070 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:06:57,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-17 12:06:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:57,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 12:06:57,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:06:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:06:57,251 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:06:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:06:57,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378116928] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:06:57,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:06:57,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-17 12:06:57,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783486944] [2023-11-17 12:06:57,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:06:57,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 12:06:57,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:06:57,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 12:06:57,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-17 12:06:57,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:06:57,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 98 transitions, 865 flow. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 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 12:06:57,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:06:57,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:06:57,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:06:57,486 INFO L124 PetriNetUnfolderBase]: 193/360 cut-off events. [2023-11-17 12:06:57,487 INFO L125 PetriNetUnfolderBase]: For 2250/2250 co-relation queries the response was YES. [2023-11-17 12:06:57,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1906 conditions, 360 events. 193/360 cut-off events. For 2250/2250 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1332 event pairs, 10 based on Foata normal form. 10/370 useless extension candidates. Maximal degree in co-relation 1869. Up to 221 conditions per place. [2023-11-17 12:06:57,494 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 82 selfloop transitions, 27 changer transitions 0/111 dead transitions. [2023-11-17 12:06:57,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 111 transitions, 1162 flow [2023-11-17 12:06:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 12:06:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 12:06:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2023-11-17 12:06:57,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2023-11-17 12:06:57,496 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 70 transitions. [2023-11-17 12:06:57,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 70 transitions. [2023-11-17 12:06:57,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:06:57,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 70 transitions. [2023-11-17 12:06:57,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 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 12:06:57,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 states have internal predecessors, (198), 0 states have call successors, (0), 0 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 12:06:57,497 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 states have internal predecessors, (198), 0 states have call successors, (0), 0 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 12:06:57,497 INFO L175 Difference]: Start difference. First operand has 102 places, 98 transitions, 865 flow. Second operand 8 states and 70 transitions. [2023-11-17 12:06:57,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 111 transitions, 1162 flow [2023-11-17 12:06:57,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 111 transitions, 1103 flow, removed 14 selfloop flow, removed 9 redundant places. [2023-11-17 12:06:57,509 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 906 flow [2023-11-17 12:06:57,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=906, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2023-11-17 12:06:57,509 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 77 predicate places. [2023-11-17 12:06:57,509 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 906 flow [2023-11-17 12:06:57,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 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 12:06:57,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:06:57,510 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:06:57,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-17 12:06:57,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-17 12:06:57,717 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:06:57,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:06:57,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1774795193, now seen corresponding path program 14 times [2023-11-17 12:06:57,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:06:57,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023431540] [2023-11-17 12:06:57,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:06:57,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:06:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:06:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:06:59,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:06:59,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023431540] [2023-11-17 12:06:59,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023431540] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:06:59,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870672270] [2023-11-17 12:06:59,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:06:59,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:06:59,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:06:59,201 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:06:59,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-17 12:06:59,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:06:59,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:06:59,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 12:06:59,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:07:00,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:07:00,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 224 treesize of output 176 [2023-11-17 12:07:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:07:00,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:07:02,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:07:02,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 913 treesize of output 417 [2023-11-17 12:07:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:07:21,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870672270] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:07:21,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:07:21,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2023-11-17 12:07:21,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36936488] [2023-11-17 12:07:21,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:07:21,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-17 12:07:21,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:07:21,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-17 12:07:21,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2023-11-17 12:07:21,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:07:21,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 906 flow. Second operand has 31 states, 31 states have (on average 6.612903225806452) internal successors, (205), 31 states have internal predecessors, (205), 0 states have call successors, (0), 0 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 12:07:21,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:07:21,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:07:21,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:07:24,506 INFO L124 PetriNetUnfolderBase]: 682/1247 cut-off events. [2023-11-17 12:07:24,507 INFO L125 PetriNetUnfolderBase]: For 9117/9117 co-relation queries the response was YES. [2023-11-17 12:07:24,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7263 conditions, 1247 events. 682/1247 cut-off events. For 9117/9117 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6601 event pairs, 25 based on Foata normal form. 2/1249 useless extension candidates. Maximal degree in co-relation 7229. Up to 346 conditions per place. [2023-11-17 12:07:24,518 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 216 selfloop transitions, 129 changer transitions 43/390 dead transitions. [2023-11-17 12:07:24,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 390 transitions, 4213 flow [2023-11-17 12:07:24,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 12:07:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-11-17 12:07:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 349 transitions. [2023-11-17 12:07:24,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807162534435262 [2023-11-17 12:07:24,524 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 349 transitions. [2023-11-17 12:07:24,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 349 transitions. [2023-11-17 12:07:24,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:07:24,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 349 transitions. [2023-11-17 12:07:24,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 10.575757575757576) internal successors, (349), 33 states have internal predecessors, (349), 0 states have call successors, (0), 0 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 12:07:24,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 22.0) internal successors, (748), 34 states have internal predecessors, (748), 0 states have call successors, (0), 0 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 12:07:24,531 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 22.0) internal successors, (748), 34 states have internal predecessors, (748), 0 states have call successors, (0), 0 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 12:07:24,531 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 906 flow. Second operand 33 states and 349 transitions. [2023-11-17 12:07:24,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 390 transitions, 4213 flow [2023-11-17 12:07:24,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 390 transitions, 4049 flow, removed 48 selfloop flow, removed 9 redundant places. [2023-11-17 12:07:24,571 INFO L231 Difference]: Finished difference. Result has 142 places, 233 transitions, 3063 flow [2023-11-17 12:07:24,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3063, PETRI_PLACES=142, PETRI_TRANSITIONS=233} [2023-11-17 12:07:24,572 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 121 predicate places. [2023-11-17 12:07:24,572 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 233 transitions, 3063 flow [2023-11-17 12:07:24,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.612903225806452) internal successors, (205), 31 states have internal predecessors, (205), 0 states have call successors, (0), 0 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 12:07:24,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:07:24,572 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:07:24,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-17 12:07:24,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:07:24,779 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:07:24,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:07:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2143799435, now seen corresponding path program 15 times [2023-11-17 12:07:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:07:24,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577736416] [2023-11-17 12:07:24,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:07:24,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:07:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:07:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:07:27,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:07:27,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577736416] [2023-11-17 12:07:27,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577736416] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:07:27,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261049345] [2023-11-17 12:07:27,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:07:27,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:07:27,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:07:27,426 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:07:27,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-17 12:07:27,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 12:07:27,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:07:27,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-17 12:07:27,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:07:28,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:07:28,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 283 treesize of output 187 [2023-11-17 12:07:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:07:28,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:07:29,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:07:29,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 913 treesize of output 405 [2023-11-17 12:07:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:07:37,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261049345] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:07:37,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:07:37,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 27 [2023-11-17 12:07:37,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115241928] [2023-11-17 12:07:37,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:07:37,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 12:07:37,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:07:37,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 12:07:37,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2023-11-17 12:07:37,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:07:37,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 233 transitions, 3063 flow. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 12:07:37,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:07:37,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:07:37,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:07:39,377 INFO L124 PetriNetUnfolderBase]: 804/1450 cut-off events. [2023-11-17 12:07:39,377 INFO L125 PetriNetUnfolderBase]: For 10456/10456 co-relation queries the response was YES. [2023-11-17 12:07:39,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9564 conditions, 1450 events. 804/1450 cut-off events. For 10456/10456 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 7813 event pairs, 30 based on Foata normal form. 4/1454 useless extension candidates. Maximal degree in co-relation 9513. Up to 1141 conditions per place. [2023-11-17 12:07:39,404 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 216 selfloop transitions, 162 changer transitions 9/389 dead transitions. [2023-11-17 12:07:39,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 389 transitions, 5684 flow [2023-11-17 12:07:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-17 12:07:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-11-17 12:07:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 288 transitions. [2023-11-17 12:07:39,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222873900293255 [2023-11-17 12:07:39,406 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 288 transitions. [2023-11-17 12:07:39,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 288 transitions. [2023-11-17 12:07:39,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:07:39,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 288 transitions. [2023-11-17 12:07:39,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 9.290322580645162) internal successors, (288), 31 states have internal predecessors, (288), 0 states have call successors, (0), 0 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 12:07:39,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 22.0) internal successors, (704), 32 states have internal predecessors, (704), 0 states have call successors, (0), 0 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 12:07:39,409 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 22.0) internal successors, (704), 32 states have internal predecessors, (704), 0 states have call successors, (0), 0 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 12:07:39,409 INFO L175 Difference]: Start difference. First operand has 142 places, 233 transitions, 3063 flow. Second operand 31 states and 288 transitions. [2023-11-17 12:07:39,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 389 transitions, 5684 flow [2023-11-17 12:07:39,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 389 transitions, 4945 flow, removed 350 selfloop flow, removed 7 redundant places. [2023-11-17 12:07:39,508 INFO L231 Difference]: Finished difference. Result has 175 places, 333 transitions, 4446 flow [2023-11-17 12:07:39,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2648, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=4446, PETRI_PLACES=175, PETRI_TRANSITIONS=333} [2023-11-17 12:07:39,509 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 154 predicate places. [2023-11-17 12:07:39,509 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 333 transitions, 4446 flow [2023-11-17 12:07:39,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 12:07:39,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:07:39,509 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:07:39,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-17 12:07:39,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:07:39,717 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:07:39,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:07:39,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1348772251, now seen corresponding path program 16 times [2023-11-17 12:07:39,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:07:39,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660079416] [2023-11-17 12:07:39,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:07:39,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:07:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:07:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:07:41,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:07:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660079416] [2023-11-17 12:07:41,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660079416] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:07:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476249467] [2023-11-17 12:07:41,488 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:07:41,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:07:41,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:07:41,490 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:07:41,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-17 12:07:41,604 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:07:41,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:07:41,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-17 12:07:41,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:07:42,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:07:42,063 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 228 treesize of output 162 [2023-11-17 12:07:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:07:42,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:07:43,413 INFO L349 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2023-11-17 12:07:43,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 913 treesize of output 377 [2023-11-17 12:07:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:07:45,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476249467] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:07:45,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:07:45,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 26 [2023-11-17 12:07:45,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669454070] [2023-11-17 12:07:45,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:07:45,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-17 12:07:45,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:07:45,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-17 12:07:45,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2023-11-17 12:07:45,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:07:45,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 333 transitions, 4446 flow. Second operand has 27 states, 27 states have (on average 6.814814814814815) internal successors, (184), 27 states have internal predecessors, (184), 0 states have call successors, (0), 0 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 12:07:45,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:07:45,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:07:45,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:07:53,542 INFO L124 PetriNetUnfolderBase]: 1215/2100 cut-off events. [2023-11-17 12:07:53,543 INFO L125 PetriNetUnfolderBase]: For 17425/17425 co-relation queries the response was YES. [2023-11-17 12:07:53,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14292 conditions, 2100 events. 1215/2100 cut-off events. For 17425/17425 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 11831 event pairs, 6 based on Foata normal form. 7/2107 useless extension candidates. Maximal degree in co-relation 14231. Up to 505 conditions per place. [2023-11-17 12:07:53,570 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 253 selfloop transitions, 444 changer transitions 19/718 dead transitions. [2023-11-17 12:07:53,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 718 transitions, 9588 flow [2023-11-17 12:07:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-17 12:07:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2023-11-17 12:07:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 669 transitions. [2023-11-17 12:07:53,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45386702849389415 [2023-11-17 12:07:53,574 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 669 transitions. [2023-11-17 12:07:53,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 669 transitions. [2023-11-17 12:07:53,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:07:53,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 669 transitions. [2023-11-17 12:07:53,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 68 states, 67 states have (on average 9.985074626865671) internal successors, (669), 67 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:07:53,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 68 states, 68 states have (on average 22.0) internal successors, (1496), 68 states have internal predecessors, (1496), 0 states have call successors, (0), 0 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 12:07:53,579 INFO L81 ComplementDD]: Finished complementDD. Result has 68 states, 68 states have (on average 22.0) internal successors, (1496), 68 states have internal predecessors, (1496), 0 states have call successors, (0), 0 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 12:07:53,579 INFO L175 Difference]: Start difference. First operand has 175 places, 333 transitions, 4446 flow. Second operand 67 states and 669 transitions. [2023-11-17 12:07:53,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 718 transitions, 9588 flow [2023-11-17 12:07:53,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 718 transitions, 9000 flow, removed 249 selfloop flow, removed 17 redundant places. [2023-11-17 12:07:53,708 INFO L231 Difference]: Finished difference. Result has 238 places, 548 transitions, 8438 flow [2023-11-17 12:07:53,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3927, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=269, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=8438, PETRI_PLACES=238, PETRI_TRANSITIONS=548} [2023-11-17 12:07:53,709 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 217 predicate places. [2023-11-17 12:07:53,709 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 548 transitions, 8438 flow [2023-11-17 12:07:53,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.814814814814815) internal successors, (184), 27 states have internal predecessors, (184), 0 states have call successors, (0), 0 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 12:07:53,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:07:53,709 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:07:53,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-17 12:07:53,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:07:53,910 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:07:53,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:07:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1238288749, now seen corresponding path program 17 times [2023-11-17 12:07:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:07:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319145085] [2023-11-17 12:07:53,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:07:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:07:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:07:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:07:55,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:07:55,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319145085] [2023-11-17 12:07:55,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319145085] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:07:55,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227135315] [2023-11-17 12:07:55,415 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 12:07:55,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:07:55,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:07:55,416 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:07:55,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-17 12:07:55,530 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:07:55,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:07:55,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-17 12:07:55,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:07:56,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:07:56,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 161 [2023-11-17 12:07:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:07:56,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:07:57,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:07:57,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 913 treesize of output 405 [2023-11-17 12:08:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:08:07,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227135315] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:08:07,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:08:07,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 25 [2023-11-17 12:08:07,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771987463] [2023-11-17 12:08:07,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:08:07,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-17 12:08:07,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:08:07,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-17 12:08:07,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2023-11-17 12:08:07,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:08:07,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 548 transitions, 8438 flow. Second operand has 26 states, 26 states have (on average 6.846153846153846) internal successors, (178), 26 states have internal predecessors, (178), 0 states have call successors, (0), 0 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 12:08:07,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:08:07,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:08:07,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:08:09,371 INFO L124 PetriNetUnfolderBase]: 1195/2090 cut-off events. [2023-11-17 12:08:09,371 INFO L125 PetriNetUnfolderBase]: For 20872/20872 co-relation queries the response was YES. [2023-11-17 12:08:09,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15358 conditions, 2090 events. 1195/2090 cut-off events. For 20872/20872 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 11931 event pairs, 66 based on Foata normal form. 4/2092 useless extension candidates. Maximal degree in co-relation 15285. Up to 1884 conditions per place. [2023-11-17 12:08:09,396 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 508 selfloop transitions, 78 changer transitions 11/599 dead transitions. [2023-11-17 12:08:09,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 599 transitions, 9874 flow [2023-11-17 12:08:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 12:08:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-17 12:08:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 226 transitions. [2023-11-17 12:08:09,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2023-11-17 12:08:09,398 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 226 transitions. [2023-11-17 12:08:09,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 226 transitions. [2023-11-17 12:08:09,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:08:09,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 226 transitions. [2023-11-17 12:08:09,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 9.416666666666666) internal successors, (226), 24 states have internal predecessors, (226), 0 states have call successors, (0), 0 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 12:08:09,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 22.0) internal successors, (550), 25 states have internal predecessors, (550), 0 states have call successors, (0), 0 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 12:08:09,400 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 22.0) internal successors, (550), 25 states have internal predecessors, (550), 0 states have call successors, (0), 0 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 12:08:09,400 INFO L175 Difference]: Start difference. First operand has 238 places, 548 transitions, 8438 flow. Second operand 24 states and 226 transitions. [2023-11-17 12:08:09,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 599 transitions, 9874 flow [2023-11-17 12:08:09,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 599 transitions, 8446 flow, removed 603 selfloop flow, removed 38 redundant places. [2023-11-17 12:08:09,693 INFO L231 Difference]: Finished difference. Result has 228 places, 552 transitions, 7265 flow [2023-11-17 12:08:09,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=7024, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=7265, PETRI_PLACES=228, PETRI_TRANSITIONS=552} [2023-11-17 12:08:09,695 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 207 predicate places. [2023-11-17 12:08:09,695 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 552 transitions, 7265 flow [2023-11-17 12:08:09,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.846153846153846) internal successors, (178), 26 states have internal predecessors, (178), 0 states have call successors, (0), 0 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 12:08:09,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:08:09,695 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:08:09,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-17 12:08:09,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:08:09,898 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:08:09,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:08:09,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1978079687, now seen corresponding path program 18 times [2023-11-17 12:08:09,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:08:09,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637513261] [2023-11-17 12:08:09,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:08:09,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:08:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:08:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:08:11,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:08:11,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637513261] [2023-11-17 12:08:11,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637513261] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:08:11,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663281213] [2023-11-17 12:08:11,473 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 12:08:11,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:08:11,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:08:11,477 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:08:11,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-17 12:08:11,597 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 12:08:11,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:08:11,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-17 12:08:11,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:08:12,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:08:12,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 158 [2023-11-17 12:08:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:08:12,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:08:13,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:08:13,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 944 treesize of output 416 [2023-11-17 12:08:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:08:23,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663281213] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:08:23,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:08:23,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 26 [2023-11-17 12:08:23,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185219979] [2023-11-17 12:08:23,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:08:23,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-17 12:08:23,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:08:23,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-17 12:08:23,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2023-11-17 12:08:23,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:08:23,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 552 transitions, 7265 flow. Second operand has 27 states, 27 states have (on average 6.7407407407407405) internal successors, (182), 27 states have internal predecessors, (182), 0 states have call successors, (0), 0 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 12:08:23,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:08:23,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:08:23,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:08:24,758 INFO L124 PetriNetUnfolderBase]: 1213/2116 cut-off events. [2023-11-17 12:08:24,758 INFO L125 PetriNetUnfolderBase]: For 14090/14090 co-relation queries the response was YES. [2023-11-17 12:08:24,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13890 conditions, 2116 events. 1213/2116 cut-off events. For 14090/14090 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 12086 event pairs, 72 based on Foata normal form. 2/2116 useless extension candidates. Maximal degree in co-relation 13821. Up to 1937 conditions per place. [2023-11-17 12:08:24,784 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 518 selfloop transitions, 79 changer transitions 11/610 dead transitions. [2023-11-17 12:08:24,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 610 transitions, 8950 flow [2023-11-17 12:08:24,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 12:08:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-17 12:08:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 194 transitions. [2023-11-17 12:08:24,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4199134199134199 [2023-11-17 12:08:24,790 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 194 transitions. [2023-11-17 12:08:24,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 194 transitions. [2023-11-17 12:08:24,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:08:24,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 194 transitions. [2023-11-17 12:08:24,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 9.238095238095237) internal successors, (194), 21 states have internal predecessors, (194), 0 states have call successors, (0), 0 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 12:08:24,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 22.0) internal successors, (484), 22 states have internal predecessors, (484), 0 states have call successors, (0), 0 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 12:08:24,792 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 22.0) internal successors, (484), 22 states have internal predecessors, (484), 0 states have call successors, (0), 0 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 12:08:24,792 INFO L175 Difference]: Start difference. First operand has 228 places, 552 transitions, 7265 flow. Second operand 21 states and 194 transitions. [2023-11-17 12:08:24,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 610 transitions, 8950 flow [2023-11-17 12:08:25,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 610 transitions, 8605 flow, removed 24 selfloop flow, removed 18 redundant places. [2023-11-17 12:08:25,014 INFO L231 Difference]: Finished difference. Result has 237 places, 569 transitions, 7451 flow [2023-11-17 12:08:25,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=6927, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=7451, PETRI_PLACES=237, PETRI_TRANSITIONS=569} [2023-11-17 12:08:25,015 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 216 predicate places. [2023-11-17 12:08:25,015 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 569 transitions, 7451 flow [2023-11-17 12:08:25,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.7407407407407405) internal successors, (182), 27 states have internal predecessors, (182), 0 states have call successors, (0), 0 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 12:08:25,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:08:25,016 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:08:25,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-17 12:08:25,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-17 12:08:25,223 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:08:25,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:08:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1397077243, now seen corresponding path program 19 times [2023-11-17 12:08:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:08:25,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598933826] [2023-11-17 12:08:25,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:08:25,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:08:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:08:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:08:27,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:08:27,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598933826] [2023-11-17 12:08:27,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598933826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:08:27,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657433201] [2023-11-17 12:08:27,663 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 12:08:27,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:08:27,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:08:27,664 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:08:27,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-17 12:08:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:08:27,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-17 12:08:27,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:08:28,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:08:28,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 283 treesize of output 187 [2023-11-17 12:08:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:08:28,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:08:29,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:08:29,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 944 treesize of output 416 [2023-11-17 12:08:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:08:38,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657433201] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:08:38,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:08:38,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 27 [2023-11-17 12:08:38,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83443736] [2023-11-17 12:08:38,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:08:38,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 12:08:38,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:08:38,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 12:08:38,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2023-11-17 12:08:38,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:08:38,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 569 transitions, 7451 flow. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 12:08:38,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:08:38,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:08:38,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:08:40,927 INFO L124 PetriNetUnfolderBase]: 1282/2240 cut-off events. [2023-11-17 12:08:40,927 INFO L125 PetriNetUnfolderBase]: For 14439/14439 co-relation queries the response was YES. [2023-11-17 12:08:40,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14579 conditions, 2240 events. 1282/2240 cut-off events. For 14439/14439 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 12880 event pairs, 60 based on Foata normal form. 5/2243 useless extension candidates. Maximal degree in co-relation 14505. Up to 1779 conditions per place. [2023-11-17 12:08:40,951 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 448 selfloop transitions, 203 changer transitions 19/672 dead transitions. [2023-11-17 12:08:40,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 672 transitions, 9834 flow [2023-11-17 12:08:40,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-17 12:08:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-11-17 12:08:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 287 transitions. [2023-11-17 12:08:40,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4208211143695015 [2023-11-17 12:08:40,953 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 287 transitions. [2023-11-17 12:08:40,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 287 transitions. [2023-11-17 12:08:40,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:08:40,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 287 transitions. [2023-11-17 12:08:40,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 9.258064516129032) internal successors, (287), 31 states have internal predecessors, (287), 0 states have call successors, (0), 0 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 12:08:40,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 22.0) internal successors, (704), 32 states have internal predecessors, (704), 0 states have call successors, (0), 0 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 12:08:40,955 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 22.0) internal successors, (704), 32 states have internal predecessors, (704), 0 states have call successors, (0), 0 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 12:08:40,956 INFO L175 Difference]: Start difference. First operand has 237 places, 569 transitions, 7451 flow. Second operand 31 states and 287 transitions. [2023-11-17 12:08:40,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 672 transitions, 9834 flow [2023-11-17 12:08:41,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 672 transitions, 9670 flow, removed 43 selfloop flow, removed 15 redundant places. [2023-11-17 12:08:41,162 INFO L231 Difference]: Finished difference. Result has 263 places, 614 transitions, 8684 flow [2023-11-17 12:08:41,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=7287, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=8684, PETRI_PLACES=263, PETRI_TRANSITIONS=614} [2023-11-17 12:08:41,163 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 242 predicate places. [2023-11-17 12:08:41,163 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 614 transitions, 8684 flow [2023-11-17 12:08:41,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 12:08:41,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:08:41,164 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:08:41,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-17 12:08:41,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-17 12:08:41,371 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:08:41,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:08:41,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1385778969, now seen corresponding path program 20 times [2023-11-17 12:08:41,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:08:41,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732920325] [2023-11-17 12:08:41,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:08:41,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:08:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:08:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:08:42,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:08:42,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732920325] [2023-11-17 12:08:42,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732920325] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:08:42,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741022314] [2023-11-17 12:08:42,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:08:42,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:08:42,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:08:42,982 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:08:42,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-17 12:08:43,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:08:43,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:08:43,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-17 12:08:43,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:08:43,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:08:43,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 120 [2023-11-17 12:08:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:08:43,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:08:45,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:08:45,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 906 treesize of output 424 [2023-11-17 12:08:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:08:56,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741022314] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:08:56,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:08:56,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 27 [2023-11-17 12:08:56,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014473681] [2023-11-17 12:08:56,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:08:56,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 12:08:56,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:08:56,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 12:08:56,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2023-11-17 12:08:56,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:08:56,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 614 transitions, 8684 flow. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 12:08:56,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:08:56,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:08:56,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:08:58,094 INFO L124 PetriNetUnfolderBase]: 1305/2260 cut-off events. [2023-11-17 12:08:58,094 INFO L125 PetriNetUnfolderBase]: For 16026/16026 co-relation queries the response was YES. [2023-11-17 12:08:58,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15462 conditions, 2260 events. 1305/2260 cut-off events. For 16026/16026 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 12928 event pairs, 93 based on Foata normal form. 2/2260 useless extension candidates. Maximal degree in co-relation 15378. Up to 2069 conditions per place. [2023-11-17 12:08:58,161 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 553 selfloop transitions, 109 changer transitions 8/672 dead transitions. [2023-11-17 12:08:58,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 672 transitions, 10562 flow [2023-11-17 12:08:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-17 12:08:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-17 12:08:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 205 transitions. [2023-11-17 12:08:58,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4051383399209486 [2023-11-17 12:08:58,162 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 205 transitions. [2023-11-17 12:08:58,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 205 transitions. [2023-11-17 12:08:58,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:08:58,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 205 transitions. [2023-11-17 12:08:58,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 8.91304347826087) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 0 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 12:08:58,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 22.0) internal successors, (528), 24 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 12:08:58,164 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 22.0) internal successors, (528), 24 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 12:08:58,164 INFO L175 Difference]: Start difference. First operand has 263 places, 614 transitions, 8684 flow. Second operand 23 states and 205 transitions. [2023-11-17 12:08:58,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 672 transitions, 10562 flow [2023-11-17 12:08:58,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 672 transitions, 10166 flow, removed 145 selfloop flow, removed 18 redundant places. [2023-11-17 12:08:58,388 INFO L231 Difference]: Finished difference. Result has 270 places, 642 transitions, 9041 flow [2023-11-17 12:08:58,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=8288, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=9041, PETRI_PLACES=270, PETRI_TRANSITIONS=642} [2023-11-17 12:08:58,389 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 249 predicate places. [2023-11-17 12:08:58,389 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 642 transitions, 9041 flow [2023-11-17 12:08:58,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 12:08:58,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:08:58,390 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:08:58,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-17 12:08:58,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:08:58,597 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:08:58,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:08:58,598 INFO L85 PathProgramCache]: Analyzing trace with hash -765525131, now seen corresponding path program 21 times [2023-11-17 12:08:58,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:08:58,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249305818] [2023-11-17 12:08:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:08:58,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:08:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:09:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:09:02,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:09:02,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249305818] [2023-11-17 12:09:02,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249305818] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:09:02,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720230524] [2023-11-17 12:09:02,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:09:02,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:09:02,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:09:02,368 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:09:02,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-17 12:09:02,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 12:09:02,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:09:02,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-17 12:09:02,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:09:03,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:09:03,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 124 [2023-11-17 12:09:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:09:03,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:09:04,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:09:04,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 906 treesize of output 424 [2023-11-17 12:09:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:09:16,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720230524] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:09:16,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:09:16,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 27 [2023-11-17 12:09:16,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736759967] [2023-11-17 12:09:16,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:09:16,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 12:09:16,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:09:16,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 12:09:16,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2023-11-17 12:09:16,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:09:16,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 642 transitions, 9041 flow. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 12:09:16,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:09:16,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:09:16,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:09:21,379 INFO L124 PetriNetUnfolderBase]: 1472/2562 cut-off events. [2023-11-17 12:09:21,380 INFO L125 PetriNetUnfolderBase]: For 19543/19543 co-relation queries the response was YES. [2023-11-17 12:09:21,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17765 conditions, 2562 events. 1472/2562 cut-off events. For 19543/19543 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 15101 event pairs, 99 based on Foata normal form. 3/2563 useless extension candidates. Maximal degree in co-relation 17677. Up to 1339 conditions per place. [2023-11-17 12:09:21,414 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 486 selfloop transitions, 312 changer transitions 14/814 dead transitions. [2023-11-17 12:09:21,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 814 transitions, 12549 flow [2023-11-17 12:09:21,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-11-17 12:09:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-11-17 12:09:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 468 transitions. [2023-11-17 12:09:21,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41711229946524064 [2023-11-17 12:09:21,417 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 468 transitions. [2023-11-17 12:09:21,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 468 transitions. [2023-11-17 12:09:21,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:09:21,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 468 transitions. [2023-11-17 12:09:21,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 9.176470588235293) internal successors, (468), 51 states have internal predecessors, (468), 0 states have call successors, (0), 0 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 12:09:21,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 22.0) internal successors, (1144), 52 states have internal predecessors, (1144), 0 states have call successors, (0), 0 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 12:09:21,421 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 22.0) internal successors, (1144), 52 states have internal predecessors, (1144), 0 states have call successors, (0), 0 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 12:09:21,421 INFO L175 Difference]: Start difference. First operand has 270 places, 642 transitions, 9041 flow. Second operand 51 states and 468 transitions. [2023-11-17 12:09:21,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 814 transitions, 12549 flow [2023-11-17 12:09:21,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 814 transitions, 12206 flow, removed 115 selfloop flow, removed 16 redundant places. [2023-11-17 12:09:21,706 INFO L231 Difference]: Finished difference. Result has 315 places, 715 transitions, 11160 flow [2023-11-17 12:09:21,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=8747, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=11160, PETRI_PLACES=315, PETRI_TRANSITIONS=715} [2023-11-17 12:09:21,707 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 294 predicate places. [2023-11-17 12:09:21,708 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 715 transitions, 11160 flow [2023-11-17 12:09:21,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 12:09:21,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:09:21,708 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:09:21,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-11-17 12:09:21,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:09:21,909 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:09:21,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:09:21,909 INFO L85 PathProgramCache]: Analyzing trace with hash -843712091, now seen corresponding path program 22 times [2023-11-17 12:09:21,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:09:21,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384061915] [2023-11-17 12:09:21,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:09:21,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:09:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:09:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:09:28,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:09:28,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384061915] [2023-11-17 12:09:28,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384061915] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:09:28,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30129659] [2023-11-17 12:09:28,036 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:09:28,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:09:28,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:09:28,037 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:09:28,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-17 12:09:28,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:09:28,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:09:28,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-17 12:09:28,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:09:28,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:09:28,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 124 [2023-11-17 12:09:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:09:28,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:09:30,034 INFO L349 Elim1Store]: treesize reduction 40, result has 18.4 percent of original size [2023-11-17 12:09:30,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 906 treesize of output 396 [2023-11-17 12:09:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:09:31,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30129659] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:09:31,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:09:31,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 27 [2023-11-17 12:09:31,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040919185] [2023-11-17 12:09:31,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:09:31,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 12:09:31,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:09:31,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 12:09:31,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2023-11-17 12:09:31,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:09:31,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 715 transitions, 11160 flow. Second operand has 28 states, 28 states have (on average 6.75) internal successors, (189), 28 states have internal predecessors, (189), 0 states have call successors, (0), 0 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 12:09:31,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:09:31,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:09:31,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:09:40,670 INFO L124 PetriNetUnfolderBase]: 1823/3172 cut-off events. [2023-11-17 12:09:40,670 INFO L125 PetriNetUnfolderBase]: For 28835/28835 co-relation queries the response was YES. [2023-11-17 12:09:40,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23585 conditions, 3172 events. 1823/3172 cut-off events. For 28835/28835 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 19462 event pairs, 10 based on Foata normal form. 6/3176 useless extension candidates. Maximal degree in co-relation 23485. Up to 960 conditions per place. [2023-11-17 12:09:40,710 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 375 selfloop transitions, 614 changer transitions 21/1012 dead transitions. [2023-11-17 12:09:40,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 1012 transitions, 16618 flow [2023-11-17 12:09:40,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-17 12:09:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-11-17 12:09:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 538 transitions. [2023-11-17 12:09:40,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4446280991735537 [2023-11-17 12:09:40,713 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 538 transitions. [2023-11-17 12:09:40,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 538 transitions. [2023-11-17 12:09:40,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:09:40,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 538 transitions. [2023-11-17 12:09:40,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 9.781818181818181) internal successors, (538), 55 states have internal predecessors, (538), 0 states have call successors, (0), 0 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 12:09:40,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 22.0) internal successors, (1232), 56 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 12:09:40,717 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 22.0) internal successors, (1232), 56 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 12:09:40,717 INFO L175 Difference]: Start difference. First operand has 315 places, 715 transitions, 11160 flow. Second operand 55 states and 538 transitions. [2023-11-17 12:09:40,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 1012 transitions, 16618 flow [2023-11-17 12:09:41,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 1012 transitions, 16047 flow, removed 223 selfloop flow, removed 24 redundant places. [2023-11-17 12:09:41,148 INFO L231 Difference]: Finished difference. Result has 355 places, 879 transitions, 15225 flow [2023-11-17 12:09:41,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=10651, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=463, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=15225, PETRI_PLACES=355, PETRI_TRANSITIONS=879} [2023-11-17 12:09:41,149 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 334 predicate places. [2023-11-17 12:09:41,150 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 879 transitions, 15225 flow [2023-11-17 12:09:41,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.75) internal successors, (189), 28 states have internal predecessors, (189), 0 states have call successors, (0), 0 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 12:09:41,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:09:41,150 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:09:41,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-11-17 12:09:41,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-17 12:09:41,357 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:09:41,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:09:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1904515943, now seen corresponding path program 23 times [2023-11-17 12:09:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:09:41,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353706986] [2023-11-17 12:09:41,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:09:41,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:09:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:09:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:09:44,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:09:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353706986] [2023-11-17 12:09:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353706986] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:09:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075101143] [2023-11-17 12:09:44,788 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 12:09:44,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:09:44,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:09:44,790 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:09:44,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-17 12:09:44,912 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-17 12:09:44,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:09:44,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-17 12:09:44,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:09:45,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:09:45,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 124 [2023-11-17 12:09:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:09:45,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:09:46,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:09:46,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 951 treesize of output 443 [2023-11-17 12:09:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:09:54,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075101143] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:09:54,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:09:54,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 26 [2023-11-17 12:09:54,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61941093] [2023-11-17 12:09:54,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:09:54,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-17 12:09:54,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:09:54,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-17 12:09:54,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2023-11-17 12:09:54,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:09:54,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 879 transitions, 15225 flow. Second operand has 27 states, 27 states have (on average 6.62962962962963) internal successors, (179), 27 states have internal predecessors, (179), 0 states have call successors, (0), 0 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 12:09:54,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:09:54,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:09:54,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:09:57,365 INFO L124 PetriNetUnfolderBase]: 1869/3223 cut-off events. [2023-11-17 12:09:57,365 INFO L125 PetriNetUnfolderBase]: For 35617/35617 co-relation queries the response was YES. [2023-11-17 12:09:57,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26071 conditions, 3223 events. 1869/3223 cut-off events. For 35617/35617 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 19638 event pairs, 120 based on Foata normal form. 2/3221 useless extension candidates. Maximal degree in co-relation 25963. Up to 2969 conditions per place. [2023-11-17 12:09:57,406 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 791 selfloop transitions, 158 changer transitions 8/959 dead transitions. [2023-11-17 12:09:57,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 959 transitions, 18259 flow [2023-11-17 12:09:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 12:09:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-17 12:09:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 261 transitions. [2023-11-17 12:09:57,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2023-11-17 12:09:57,413 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 261 transitions. [2023-11-17 12:09:57,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 261 transitions. [2023-11-17 12:09:57,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:09:57,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 261 transitions. [2023-11-17 12:09:57,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 9.0) internal successors, (261), 29 states have internal predecessors, (261), 0 states have call successors, (0), 0 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 12:09:57,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 22.0) internal successors, (660), 30 states have internal predecessors, (660), 0 states have call successors, (0), 0 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 12:09:57,415 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 22.0) internal successors, (660), 30 states have internal predecessors, (660), 0 states have call successors, (0), 0 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 12:09:57,415 INFO L175 Difference]: Start difference. First operand has 355 places, 879 transitions, 15225 flow. Second operand 29 states and 261 transitions. [2023-11-17 12:09:57,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 959 transitions, 18259 flow [2023-11-17 12:09:57,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 959 transitions, 17203 flow, removed 231 selfloop flow, removed 28 redundant places. [2023-11-17 12:09:57,963 INFO L231 Difference]: Finished difference. Result has 358 places, 921 transitions, 15529 flow [2023-11-17 12:09:57,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=14202, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=879, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=741, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=15529, PETRI_PLACES=358, PETRI_TRANSITIONS=921} [2023-11-17 12:09:57,964 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 337 predicate places. [2023-11-17 12:09:57,964 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 921 transitions, 15529 flow [2023-11-17 12:09:57,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.62962962962963) internal successors, (179), 27 states have internal predecessors, (179), 0 states have call successors, (0), 0 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 12:09:57,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:09:57,965 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:09:57,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-11-17 12:09:58,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-17 12:09:58,171 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:09:58,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:09:58,171 INFO L85 PathProgramCache]: Analyzing trace with hash -278246289, now seen corresponding path program 24 times [2023-11-17 12:09:58,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:09:58,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814892577] [2023-11-17 12:09:58,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:09:58,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:09:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:09:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:09:59,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:09:59,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814892577] [2023-11-17 12:09:59,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814892577] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:09:59,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257298526] [2023-11-17 12:09:59,315 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 12:09:59,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:09:59,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:09:59,316 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:09:59,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-17 12:09:59,442 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 12:09:59,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:09:59,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-17 12:09:59,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:09:59,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:09:59,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 120 [2023-11-17 12:10:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:10:00,076 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:10:01,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:10:01,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 951 treesize of output 443 [2023-11-17 12:10:09,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:10:09,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257298526] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:10:09,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:10:09,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 25 [2023-11-17 12:10:09,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045486528] [2023-11-17 12:10:09,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:10:09,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-17 12:10:09,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:10:09,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-17 12:10:09,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2023-11-17 12:10:09,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:10:09,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 921 transitions, 15529 flow. Second operand has 26 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 26 states have internal predecessors, (174), 0 states have call successors, (0), 0 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 12:10:09,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:10:09,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:10:09,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:10:11,169 INFO L124 PetriNetUnfolderBase]: 1881/3246 cut-off events. [2023-11-17 12:10:11,170 INFO L125 PetriNetUnfolderBase]: For 32411/32411 co-relation queries the response was YES. [2023-11-17 12:10:11,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25192 conditions, 3246 events. 1881/3246 cut-off events. For 32411/32411 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 19846 event pairs, 133 based on Foata normal form. 2/3244 useless extension candidates. Maximal degree in co-relation 25082. Up to 3116 conditions per place. [2023-11-17 12:10:11,203 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 888 selfloop transitions, 62 changer transitions 7/959 dead transitions. [2023-11-17 12:10:11,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 959 transitions, 17726 flow [2023-11-17 12:10:11,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-17 12:10:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-17 12:10:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 196 transitions. [2023-11-17 12:10:11,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38735177865612647 [2023-11-17 12:10:11,204 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 196 transitions. [2023-11-17 12:10:11,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 196 transitions. [2023-11-17 12:10:11,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:10:11,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 196 transitions. [2023-11-17 12:10:11,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 8.521739130434783) internal successors, (196), 23 states have internal predecessors, (196), 0 states have call successors, (0), 0 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 12:10:11,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 22.0) internal successors, (528), 24 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 12:10:11,206 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 22.0) internal successors, (528), 24 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 12:10:11,206 INFO L175 Difference]: Start difference. First operand has 358 places, 921 transitions, 15529 flow. Second operand 23 states and 196 transitions. [2023-11-17 12:10:11,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 959 transitions, 17726 flow [2023-11-17 12:10:11,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 959 transitions, 17291 flow, removed 173 selfloop flow, removed 17 redundant places. [2023-11-17 12:10:11,698 INFO L231 Difference]: Finished difference. Result has 367 places, 931 transitions, 15419 flow [2023-11-17 12:10:11,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=15094, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=921, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=861, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=15419, PETRI_PLACES=367, PETRI_TRANSITIONS=931} [2023-11-17 12:10:11,699 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 346 predicate places. [2023-11-17 12:10:11,699 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 931 transitions, 15419 flow [2023-11-17 12:10:11,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 26 states have internal predecessors, (174), 0 states have call successors, (0), 0 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 12:10:11,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:10:11,699 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:10:11,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-11-17 12:10:11,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-17 12:10:11,906 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:10:11,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:10:11,907 INFO L85 PathProgramCache]: Analyzing trace with hash 102159123, now seen corresponding path program 25 times [2023-11-17 12:10:11,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:10:11,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419579943] [2023-11-17 12:10:11,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:10:11,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:10:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:10:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:10:13,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:10:13,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419579943] [2023-11-17 12:10:13,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419579943] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:10:13,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071058871] [2023-11-17 12:10:13,485 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 12:10:13,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:10:13,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:10:13,486 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:10:13,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-11-17 12:10:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:10:13,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-17 12:10:13,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:10:14,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:10:14,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 120 [2023-11-17 12:10:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:10:14,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:10:15,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:10:15,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 951 treesize of output 443 [2023-11-17 12:10:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:10:23,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071058871] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:10:23,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:10:23,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 27 [2023-11-17 12:10:23,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314475080] [2023-11-17 12:10:23,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:10:23,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 12:10:23,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:10:23,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 12:10:23,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2023-11-17 12:10:23,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:10:23,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 931 transitions, 15419 flow. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 12:10:23,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:10:23,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:10:23,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:10:25,833 INFO L124 PetriNetUnfolderBase]: 1890/3269 cut-off events. [2023-11-17 12:10:25,833 INFO L125 PetriNetUnfolderBase]: For 32003/32003 co-relation queries the response was YES. [2023-11-17 12:10:25,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25185 conditions, 3269 events. 1890/3269 cut-off events. For 32003/32003 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 20045 event pairs, 133 based on Foata normal form. 2/3267 useless extension candidates. Maximal degree in co-relation 25070. Up to 3085 conditions per place. [2023-11-17 12:10:25,868 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 850 selfloop transitions, 109 changer transitions 8/969 dead transitions. [2023-11-17 12:10:25,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 969 transitions, 17651 flow [2023-11-17 12:10:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 12:10:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-17 12:10:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 220 transitions. [2023-11-17 12:10:25,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2023-11-17 12:10:25,869 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 220 transitions. [2023-11-17 12:10:25,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 220 transitions. [2023-11-17 12:10:25,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:10:25,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 220 transitions. [2023-11-17 12:10:25,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 8.8) internal successors, (220), 25 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 12:10:25,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 22.0) internal successors, (572), 26 states have internal predecessors, (572), 0 states have call successors, (0), 0 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 12:10:25,871 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 22.0) internal successors, (572), 26 states have internal predecessors, (572), 0 states have call successors, (0), 0 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 12:10:25,871 INFO L175 Difference]: Start difference. First operand has 367 places, 931 transitions, 15419 flow. Second operand 25 states and 220 transitions. [2023-11-17 12:10:25,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 969 transitions, 17651 flow [2023-11-17 12:10:26,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 969 transitions, 17487 flow, removed 30 selfloop flow, removed 17 redundant places. [2023-11-17 12:10:26,337 INFO L231 Difference]: Finished difference. Result has 379 places, 939 transitions, 15692 flow [2023-11-17 12:10:26,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=15255, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=824, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=15692, PETRI_PLACES=379, PETRI_TRANSITIONS=939} [2023-11-17 12:10:26,338 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 358 predicate places. [2023-11-17 12:10:26,339 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 939 transitions, 15692 flow [2023-11-17 12:10:26,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 12:10:26,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:10:26,339 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:10:26,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-11-17 12:10:26,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:10:26,540 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:10:26,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:10:26,540 INFO L85 PathProgramCache]: Analyzing trace with hash 205638251, now seen corresponding path program 26 times [2023-11-17 12:10:26,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:10:26,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530782532] [2023-11-17 12:10:26,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:10:26,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:10:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:10:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:10:27,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:10:27,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530782532] [2023-11-17 12:10:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530782532] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:10:27,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144264676] [2023-11-17 12:10:27,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:10:27,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:10:27,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:10:27,844 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:10:27,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-17 12:10:27,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:10:27,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:10:27,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-17 12:10:27,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:10:28,000 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 12:10:28,032 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 12:10:28,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:10:28,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:10:28,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:10:28,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 124 [2023-11-17 12:10:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:10:28,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:10:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:10:35,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144264676] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:10:35,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:10:35,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 29 [2023-11-17 12:10:35,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708049722] [2023-11-17 12:10:35,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:10:35,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-17 12:10:35,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:10:35,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-17 12:10:35,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=752, Unknown=3, NotChecked=0, Total=870 [2023-11-17 12:10:35,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:10:35,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 939 transitions, 15692 flow. Second operand has 30 states, 30 states have (on average 6.5) internal successors, (195), 30 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 12:10:35,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:10:35,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:10:35,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:10:38,939 INFO L124 PetriNetUnfolderBase]: 1942/3353 cut-off events. [2023-11-17 12:10:38,939 INFO L125 PetriNetUnfolderBase]: For 34388/34388 co-relation queries the response was YES. [2023-11-17 12:10:38,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26300 conditions, 3353 events. 1942/3353 cut-off events. For 34388/34388 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 20725 event pairs, 123 based on Foata normal form. 2/3351 useless extension candidates. Maximal degree in co-relation 26180. Up to 3064 conditions per place. [2023-11-17 12:10:38,975 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 824 selfloop transitions, 179 changer transitions 9/1014 dead transitions. [2023-11-17 12:10:38,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 1014 transitions, 18726 flow [2023-11-17 12:10:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 12:10:38,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-11-17 12:10:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 290 transitions. [2023-11-17 12:10:38,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2023-11-17 12:10:38,976 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 290 transitions. [2023-11-17 12:10:38,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 290 transitions. [2023-11-17 12:10:38,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:10:38,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 290 transitions. [2023-11-17 12:10:38,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 8.787878787878787) internal successors, (290), 33 states have internal predecessors, (290), 0 states have call successors, (0), 0 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 12:10:38,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 22.0) internal successors, (748), 34 states have internal predecessors, (748), 0 states have call successors, (0), 0 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 12:10:38,979 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 22.0) internal successors, (748), 34 states have internal predecessors, (748), 0 states have call successors, (0), 0 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 12:10:38,979 INFO L175 Difference]: Start difference. First operand has 379 places, 939 transitions, 15692 flow. Second operand 33 states and 290 transitions. [2023-11-17 12:10:38,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 1014 transitions, 18726 flow [2023-11-17 12:10:39,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 1014 transitions, 18498 flow, removed 58 selfloop flow, removed 19 redundant places. [2023-11-17 12:10:39,479 INFO L231 Difference]: Finished difference. Result has 397 places, 971 transitions, 16711 flow [2023-11-17 12:10:39,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=15464, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=775, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=16711, PETRI_PLACES=397, PETRI_TRANSITIONS=971} [2023-11-17 12:10:39,480 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 376 predicate places. [2023-11-17 12:10:39,480 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 971 transitions, 16711 flow [2023-11-17 12:10:39,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.5) internal successors, (195), 30 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 12:10:39,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:10:39,480 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:10:39,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-11-17 12:10:39,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:10:39,681 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:10:39,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:10:39,681 INFO L85 PathProgramCache]: Analyzing trace with hash 761368167, now seen corresponding path program 27 times [2023-11-17 12:10:39,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:10:39,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129303848] [2023-11-17 12:10:39,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:10:39,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:10:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:10:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:10:40,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:10:40,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129303848] [2023-11-17 12:10:40,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129303848] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:10:40,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609046898] [2023-11-17 12:10:40,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:10:40,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:10:40,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:10:40,901 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:10:40,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-11-17 12:10:41,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 12:10:41,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:10:41,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-17 12:10:41,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:10:41,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:10:41,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 124 [2023-11-17 12:10:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:10:41,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:10:42,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:10:42,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 951 treesize of output 443 [2023-11-17 12:10:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:10:50,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609046898] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:10:50,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:10:50,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 26 [2023-11-17 12:10:50,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244243084] [2023-11-17 12:10:50,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:10:50,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-17 12:10:50,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:10:50,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-17 12:10:50,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2023-11-17 12:10:50,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:10:50,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 971 transitions, 16711 flow. Second operand has 27 states, 27 states have (on average 6.703703703703703) internal successors, (181), 27 states have internal predecessors, (181), 0 states have call successors, (0), 0 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 12:10:50,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:10:50,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:10:50,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:10:52,959 INFO L124 PetriNetUnfolderBase]: 1960/3383 cut-off events. [2023-11-17 12:10:52,959 INFO L125 PetriNetUnfolderBase]: For 35376/35376 co-relation queries the response was YES. [2023-11-17 12:10:52,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26894 conditions, 3383 events. 1960/3383 cut-off events. For 35376/35376 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 20885 event pairs, 143 based on Foata normal form. 2/3381 useless extension candidates. Maximal degree in co-relation 26768. Up to 3141 conditions per place. [2023-11-17 12:10:52,996 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 876 selfloop transitions, 131 changer transitions 7/1016 dead transitions. [2023-11-17 12:10:52,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 1016 transitions, 19046 flow [2023-11-17 12:10:52,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-17 12:10:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-11-17 12:10:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 245 transitions. [2023-11-17 12:10:52,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41245791245791247 [2023-11-17 12:10:52,997 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 245 transitions. [2023-11-17 12:10:52,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 245 transitions. [2023-11-17 12:10:52,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:10:52,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 245 transitions. [2023-11-17 12:10:52,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 9.074074074074074) internal successors, (245), 27 states have internal predecessors, (245), 0 states have call successors, (0), 0 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 12:10:53,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 22.0) internal successors, (616), 28 states have internal predecessors, (616), 0 states have call successors, (0), 0 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 12:10:53,001 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 22.0) internal successors, (616), 28 states have internal predecessors, (616), 0 states have call successors, (0), 0 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 12:10:53,001 INFO L175 Difference]: Start difference. First operand has 397 places, 971 transitions, 16711 flow. Second operand 27 states and 245 transitions. [2023-11-17 12:10:53,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 1016 transitions, 19046 flow [2023-11-17 12:10:53,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 1016 transitions, 18611 flow, removed 157 selfloop flow, removed 20 redundant places. [2023-11-17 12:10:53,641 INFO L231 Difference]: Finished difference. Result has 406 places, 979 transitions, 16757 flow [2023-11-17 12:10:53,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=16276, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=971, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=842, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=16757, PETRI_PLACES=406, PETRI_TRANSITIONS=979} [2023-11-17 12:10:53,642 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 385 predicate places. [2023-11-17 12:10:53,642 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 979 transitions, 16757 flow [2023-11-17 12:10:53,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.703703703703703) internal successors, (181), 27 states have internal predecessors, (181), 0 states have call successors, (0), 0 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 12:10:53,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:10:53,642 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:10:53,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-11-17 12:10:53,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:10:53,848 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:10:53,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:10:53,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1923387311, now seen corresponding path program 28 times [2023-11-17 12:10:53,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:10:53,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039122732] [2023-11-17 12:10:53,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:10:53,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:10:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:10:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:10:55,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:10:55,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039122732] [2023-11-17 12:10:55,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039122732] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:10:55,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591646739] [2023-11-17 12:10:55,893 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:10:55,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:10:55,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:10:55,895 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:10:55,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-11-17 12:10:56,025 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:10:56,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:10:56,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-17 12:10:56,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:10:56,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:10:56,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 120 [2023-11-17 12:10:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:10:56,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:10:58,195 INFO L349 Elim1Store]: treesize reduction 25, result has 13.8 percent of original size [2023-11-17 12:10:58,196 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 822 treesize of output 406 [2023-11-17 12:10:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:10:59,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591646739] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:10:59,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:10:59,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 27 [2023-11-17 12:10:59,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392230356] [2023-11-17 12:10:59,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:10:59,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 12:10:59,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:10:59,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 12:10:59,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2023-11-17 12:10:59,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:10:59,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 979 transitions, 16757 flow. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 12:10:59,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:10:59,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:10:59,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:11:06,832 INFO L124 PetriNetUnfolderBase]: 2130/3753 cut-off events. [2023-11-17 12:11:06,832 INFO L125 PetriNetUnfolderBase]: For 40465/40465 co-relation queries the response was YES. [2023-11-17 12:11:06,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29851 conditions, 3753 events. 2130/3753 cut-off events. For 40465/40465 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 24341 event pairs, 62 based on Foata normal form. 3/3752 useless extension candidates. Maximal degree in co-relation 29721. Up to 1400 conditions per place. [2023-11-17 12:11:06,876 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 472 selfloop transitions, 667 changer transitions 13/1154 dead transitions. [2023-11-17 12:11:06,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1154 transitions, 21449 flow [2023-11-17 12:11:06,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-17 12:11:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-11-17 12:11:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 357 transitions. [2023-11-17 12:11:06,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45075757575757575 [2023-11-17 12:11:06,878 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 357 transitions. [2023-11-17 12:11:06,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 357 transitions. [2023-11-17 12:11:06,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:11:06,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 357 transitions. [2023-11-17 12:11:06,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 9.916666666666666) internal successors, (357), 36 states have internal predecessors, (357), 0 states have call successors, (0), 0 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 12:11:06,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 22.0) internal successors, (814), 37 states have internal predecessors, (814), 0 states have call successors, (0), 0 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 12:11:06,880 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 22.0) internal successors, (814), 37 states have internal predecessors, (814), 0 states have call successors, (0), 0 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 12:11:06,880 INFO L175 Difference]: Start difference. First operand has 406 places, 979 transitions, 16757 flow. Second operand 36 states and 357 transitions. [2023-11-17 12:11:06,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 1154 transitions, 21449 flow [2023-11-17 12:11:07,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 1154 transitions, 21248 flow, removed 39 selfloop flow, removed 20 redundant places. [2023-11-17 12:11:07,542 INFO L231 Difference]: Finished difference. Result has 430 places, 1074 transitions, 20424 flow [2023-11-17 12:11:07,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=16564, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=979, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=580, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=20424, PETRI_PLACES=430, PETRI_TRANSITIONS=1074} [2023-11-17 12:11:07,543 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 409 predicate places. [2023-11-17 12:11:07,543 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 1074 transitions, 20424 flow [2023-11-17 12:11:07,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 12:11:07,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:11:07,543 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:11:07,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-11-17 12:11:07,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-11-17 12:11:07,744 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:11:07,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:11:07,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1894312913, now seen corresponding path program 29 times [2023-11-17 12:11:07,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:11:07,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096818617] [2023-11-17 12:11:07,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:07,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:11:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:11:10,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:11:10,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096818617] [2023-11-17 12:11:10,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096818617] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:11:10,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166336355] [2023-11-17 12:11:10,634 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 12:11:10,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:11:10,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:11:10,636 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:11:10,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-11-17 12:11:10,771 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-17 12:11:10,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:11:10,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-17 12:11:10,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:11:10,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:11:10,785 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 10 treesize of output 8 [2023-11-17 12:11:10,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 12:11:10,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 12:11:10,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:11:10,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:11:11,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:11:11,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 162 [2023-11-17 12:11:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:11:11,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:11:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:11:18,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166336355] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:11:18,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:11:18,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 29 [2023-11-17 12:11:18,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795359524] [2023-11-17 12:11:18,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:11:18,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-17 12:11:18,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:11:18,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-17 12:11:18,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=721, Unknown=1, NotChecked=0, Total=870 [2023-11-17 12:11:18,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:11:18,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1074 transitions, 20424 flow. Second operand has 30 states, 30 states have (on average 6.566666666666666) internal successors, (197), 30 states have internal predecessors, (197), 0 states have call successors, (0), 0 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 12:11:18,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:11:18,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:11:18,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:11:29,753 INFO L124 PetriNetUnfolderBase]: 1996/3587 cut-off events. [2023-11-17 12:11:29,753 INFO L125 PetriNetUnfolderBase]: For 52399/52399 co-relation queries the response was YES. [2023-11-17 12:11:29,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30242 conditions, 3587 events. 1996/3587 cut-off events. For 52399/52399 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 23610 event pairs, 38 based on Foata normal form. 63/3646 useless extension candidates. Maximal degree in co-relation 30103. Up to 1202 conditions per place. [2023-11-17 12:11:29,800 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 482 selfloop transitions, 601 changer transitions 21/1106 dead transitions. [2023-11-17 12:11:29,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 1106 transitions, 21605 flow [2023-11-17 12:11:29,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-17 12:11:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-11-17 12:11:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 459 transitions. [2023-11-17 12:11:29,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42578849721706863 [2023-11-17 12:11:29,802 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 459 transitions. [2023-11-17 12:11:29,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 459 transitions. [2023-11-17 12:11:29,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:11:29,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 459 transitions. [2023-11-17 12:11:29,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 9.36734693877551) internal successors, (459), 49 states have internal predecessors, (459), 0 states have call successors, (0), 0 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 12:11:29,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 22.0) internal successors, (1100), 50 states have internal predecessors, (1100), 0 states have call successors, (0), 0 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 12:11:29,805 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 22.0) internal successors, (1100), 50 states have internal predecessors, (1100), 0 states have call successors, (0), 0 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 12:11:29,805 INFO L175 Difference]: Start difference. First operand has 430 places, 1074 transitions, 20424 flow. Second operand 49 states and 459 transitions. [2023-11-17 12:11:29,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 1106 transitions, 21605 flow [2023-11-17 12:11:30,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 1106 transitions, 20882 flow, removed 162 selfloop flow, removed 22 redundant places. [2023-11-17 12:11:30,617 INFO L231 Difference]: Finished difference. Result has 463 places, 1007 transitions, 19930 flow [2023-11-17 12:11:30,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=17332, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=967, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=562, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=19930, PETRI_PLACES=463, PETRI_TRANSITIONS=1007} [2023-11-17 12:11:30,618 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 442 predicate places. [2023-11-17 12:11:30,618 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 1007 transitions, 19930 flow [2023-11-17 12:11:30,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.566666666666666) internal successors, (197), 30 states have internal predecessors, (197), 0 states have call successors, (0), 0 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 12:11:30,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:11:30,618 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:11:30,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-11-17 12:11:30,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:11:30,819 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:11:30,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:11:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1544177427, now seen corresponding path program 30 times [2023-11-17 12:11:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:11:30,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932791302] [2023-11-17 12:11:30,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:11:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:11:31,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:11:31,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932791302] [2023-11-17 12:11:31,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932791302] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:11:31,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042463052] [2023-11-17 12:11:31,766 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 12:11:31,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:11:31,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:11:31,767 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:11:31,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-11-17 12:11:31,899 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-17 12:11:31,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:11:31,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-17 12:11:31,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:11:32,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:11:32,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 177 [2023-11-17 12:11:32,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:11:32,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:11:34,228 INFO L349 Elim1Store]: treesize reduction 10, result has 79.6 percent of original size [2023-11-17 12:11:34,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 944 treesize of output 464 [2023-11-17 12:11:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:11:46,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042463052] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:11:46,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:11:46,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 27 [2023-11-17 12:11:46,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040408023] [2023-11-17 12:11:46,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:11:46,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 12:11:46,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:11:46,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 12:11:46,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2023-11-17 12:11:46,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:11:46,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 1007 transitions, 19930 flow. Second operand has 28 states, 28 states have (on average 6.75) internal successors, (189), 28 states have internal predecessors, (189), 0 states have call successors, (0), 0 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 12:11:46,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:11:46,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:11:46,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:11:56,941 INFO L124 PetriNetUnfolderBase]: 2152/3921 cut-off events. [2023-11-17 12:11:56,941 INFO L125 PetriNetUnfolderBase]: For 59944/59944 co-relation queries the response was YES. [2023-11-17 12:11:56,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34166 conditions, 3921 events. 2152/3921 cut-off events. For 59944/59944 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 26609 event pairs, 14 based on Foata normal form. 3/3920 useless extension candidates. Maximal degree in co-relation 34023. Up to 1094 conditions per place. [2023-11-17 12:11:56,999 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 368 selfloop transitions, 768 changer transitions 21/1159 dead transitions. [2023-11-17 12:11:56,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 1159 transitions, 24167 flow [2023-11-17 12:11:57,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 12:11:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-11-17 12:11:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 380 transitions. [2023-11-17 12:11:57,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4428904428904429 [2023-11-17 12:11:57,001 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 380 transitions. [2023-11-17 12:11:57,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 380 transitions. [2023-11-17 12:11:57,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:11:57,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 380 transitions. [2023-11-17 12:11:57,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 9.743589743589743) internal successors, (380), 39 states have internal predecessors, (380), 0 states have call successors, (0), 0 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 12:11:57,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 22.0) internal successors, (880), 40 states have internal predecessors, (880), 0 states have call successors, (0), 0 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 12:11:57,003 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 22.0) internal successors, (880), 40 states have internal predecessors, (880), 0 states have call successors, (0), 0 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 12:11:57,003 INFO L175 Difference]: Start difference. First operand has 463 places, 1007 transitions, 19930 flow. Second operand 39 states and 380 transitions. [2023-11-17 12:11:57,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 1159 transitions, 24167 flow [2023-11-17 12:11:57,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 1159 transitions, 23460 flow, removed 145 selfloop flow, removed 29 redundant places. [2023-11-17 12:11:57,987 INFO L231 Difference]: Finished difference. Result has 475 places, 1079 transitions, 22684 flow [2023-11-17 12:11:57,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=19311, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1007, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=693, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=22684, PETRI_PLACES=475, PETRI_TRANSITIONS=1079} [2023-11-17 12:11:57,988 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 454 predicate places. [2023-11-17 12:11:57,989 INFO L495 AbstractCegarLoop]: Abstraction has has 475 places, 1079 transitions, 22684 flow [2023-11-17 12:11:57,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.75) internal successors, (189), 28 states have internal predecessors, (189), 0 states have call successors, (0), 0 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 12:11:57,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:11:57,989 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:11:57,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-11-17 12:11:58,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:11:58,189 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:11:58,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:11:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1972067423, now seen corresponding path program 31 times [2023-11-17 12:11:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:11:58,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968722056] [2023-11-17 12:11:58,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:11:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:11:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:11:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:11:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968722056] [2023-11-17 12:11:59,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968722056] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:11:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731259748] [2023-11-17 12:11:59,770 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 12:11:59,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:11:59,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:11:59,771 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:11:59,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-11-17 12:11:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:11:59,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-17 12:11:59,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:12:00,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:12:00,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 165 [2023-11-17 12:12:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:12:00,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:12:01,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:12:01,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 944 treesize of output 462 [2023-11-17 12:12:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:12:12,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731259748] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:12:12,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:12:12,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 27 [2023-11-17 12:12:12,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210466579] [2023-11-17 12:12:12,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:12:12,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 12:12:12,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:12:12,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 12:12:12,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2023-11-17 12:12:12,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:12:12,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 1079 transitions, 22684 flow. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 12:12:12,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:12:12,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:12:12,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:12:17,765 INFO L124 PetriNetUnfolderBase]: 2257/4078 cut-off events. [2023-11-17 12:12:17,766 INFO L125 PetriNetUnfolderBase]: For 70938/70938 co-relation queries the response was YES. [2023-11-17 12:12:17,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37980 conditions, 4078 events. 2257/4078 cut-off events. For 70938/70938 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 27601 event pairs, 60 based on Foata normal form. 7/4081 useless extension candidates. Maximal degree in co-relation 37834. Up to 1081 conditions per place. [2023-11-17 12:12:17,819 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 566 selfloop transitions, 646 changer transitions 17/1231 dead transitions. [2023-11-17 12:12:17,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 1231 transitions, 27486 flow [2023-11-17 12:12:17,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-17 12:12:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-11-17 12:12:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 435 transitions. [2023-11-17 12:12:17,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4206963249516441 [2023-11-17 12:12:17,821 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 435 transitions. [2023-11-17 12:12:17,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 435 transitions. [2023-11-17 12:12:17,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:12:17,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 435 transitions. [2023-11-17 12:12:17,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 9.25531914893617) internal successors, (435), 47 states have internal predecessors, (435), 0 states have call successors, (0), 0 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 12:12:17,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 22.0) internal successors, (1056), 48 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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 12:12:17,824 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 22.0) internal successors, (1056), 48 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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 12:12:17,824 INFO L175 Difference]: Start difference. First operand has 475 places, 1079 transitions, 22684 flow. Second operand 47 states and 435 transitions. [2023-11-17 12:12:17,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 1231 transitions, 27486 flow [2023-11-17 12:12:18,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 1231 transitions, 26642 flow, removed 166 selfloop flow, removed 15 redundant places. [2023-11-17 12:12:18,973 INFO L231 Difference]: Finished difference. Result has 511 places, 1142 transitions, 26044 flow [2023-11-17 12:12:18,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=21871, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1079, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=586, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=26044, PETRI_PLACES=511, PETRI_TRANSITIONS=1142} [2023-11-17 12:12:18,974 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 490 predicate places. [2023-11-17 12:12:18,974 INFO L495 AbstractCegarLoop]: Abstraction has has 511 places, 1142 transitions, 26044 flow [2023-11-17 12:12:18,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 12:12:18,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:12:18,975 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:12:18,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2023-11-17 12:12:19,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-11-17 12:12:19,183 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:12:19,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:12:19,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1138328339, now seen corresponding path program 32 times [2023-11-17 12:12:19,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:12:19,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926171992] [2023-11-17 12:12:19,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:12:19,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:12:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:12:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:12:21,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:12:21,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926171992] [2023-11-17 12:12:21,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926171992] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:12:21,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547035931] [2023-11-17 12:12:21,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:12:21,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:12:21,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:12:21,117 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:12:21,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-11-17 12:12:21,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:12:21,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:12:21,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-17 12:12:21,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:12:21,291 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 12:12:21,319 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 12:12:21,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:12:21,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:12:21,521 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 47 treesize of output 38 [2023-11-17 12:12:22,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:12:22,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 179 [2023-11-17 12:12:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:12:22,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:12:24,051 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~A~0.offset (* c_~N~0 4) (- 4))) (.cse4 (+ c_~A~0.offset (* c_~i~0 4))) (.cse5 (+ c_~A~0.offset (* c_~j~0 4))) (.cse18 (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0)) (.cse19 (< 2147483647 (+ c_~bag2~0 c_~sum2~0)))) (and (forall ((v_ArrVal_973 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_973) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse6)) (.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (< c_~cap1~0 (+ c_~bag1~0 .cse0 1)) (= (+ c_~bag1~0 c_~sum1~0 .cse0) (+ c_~bag2~0 .cse1 c_~sum2~0 .cse2)) (< 2147483647 (+ c_~bag2~0 .cse1 c_~sum2~0)) (< (+ c_~bag2~0 .cse1 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse1)) (< 2147483647 (+ c_~bag1~0 .cse0)) (< .cse2 1) (< (+ c_~bag2~0 .cse1 c_~sum2~0 2147483648) 0) (< (+ c_~bag1~0 .cse0 2147483648) 0))))) (or (< 2147483647 (+ c_~bag1~0 c_~sum1~0)) (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0) (and (forall ((v_ArrVal_973 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_973) c_~A~0.base))) (let ((.cse7 (select .cse10 .cse4)) (.cse9 (select .cse10 .cse6)) (.cse8 (select .cse10 .cse5))) (or (< (+ c_~bag1~0 .cse7) c_~cap1~0) (= (+ c_~bag1~0 c_~sum1~0 .cse7) (+ c_~bag2~0 .cse8 c_~sum2~0 .cse9)) (< 2147483647 (+ c_~bag2~0 .cse8 c_~sum2~0)) (< (+ c_~bag2~0 .cse8 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse8)) (< .cse9 1) (< (+ c_~bag2~0 .cse8 c_~sum2~0 2147483648) 0))))) (or (and (forall ((v_ArrVal_973 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_973) c_~A~0.base))) (let ((.cse11 (select .cse14 .cse4)) (.cse12 (select .cse14 .cse5)) (.cse13 (select .cse14 .cse6))) (or (< (+ c_~bag1~0 .cse11) c_~cap1~0) (= (+ c_~bag1~0 c_~sum1~0 .cse11) (+ c_~bag2~0 .cse12 c_~sum2~0 .cse13)) (< (+ .cse12 .cse13 2147483648) 0) (< 2147483647 (+ .cse12 .cse13)) (< c_~bag2~0 (+ .cse13 1)))))) (forall ((v_ArrVal_973 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_973) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse4)) (.cse16 (select .cse17 .cse5))) (or (< (+ c_~bag1~0 .cse15) c_~cap1~0) (= (+ c_~bag1~0 c_~sum1~0 .cse15) (+ c_~bag2~0 .cse16 c_~sum2~0 (select .cse17 .cse6))) (< 2147483647 (+ c_~bag2~0 .cse16 c_~sum2~0)) (< (+ c_~bag2~0 .cse16 c_~sum2~0 2147483648) 0)))))) .cse18 .cse19) (forall ((v_ArrVal_973 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_973) c_~A~0.base))) (let ((.cse20 (select .cse23 .cse4)) (.cse21 (select .cse23 .cse5)) (.cse22 (select .cse23 .cse6))) (or (< (+ c_~bag1~0 .cse20) c_~cap1~0) (= (+ c_~bag1~0 c_~sum1~0 .cse20) (+ c_~bag2~0 .cse21 c_~sum2~0 .cse22)) (< (+ c_~bag2~0 .cse21 2147483648) 0) (< (+ c_~bag2~0 .cse21 .cse22 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse21)) (< 2147483647 (+ c_~bag2~0 .cse21 .cse22)))))))) (forall ((v_ArrVal_973 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_973) c_~A~0.base))) (let ((.cse25 (select .cse27 .cse5)) (.cse26 (select .cse27 .cse6)) (.cse24 (select .cse27 .cse4))) (or (< c_~cap1~0 (+ c_~bag1~0 .cse24 1)) (= (+ c_~bag1~0 c_~sum1~0 .cse24) (+ c_~bag2~0 .cse25 c_~sum2~0 .cse26)) (< (+ c_~bag2~0 .cse25 2147483648) 0) (< (+ c_~bag2~0 .cse25 .cse26 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse25)) (< 2147483647 (+ c_~bag1~0 .cse24)) (< 2147483647 (+ c_~bag2~0 .cse25 .cse26)) (< (+ c_~bag1~0 .cse24 2147483648) 0))))) (or (and (forall ((v_ArrVal_973 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_973) c_~A~0.base))) (let ((.cse29 (select .cse31 .cse5)) (.cse30 (select .cse31 .cse6)) (.cse28 (select .cse31 .cse4))) (or (< c_~cap1~0 (+ c_~bag1~0 .cse28 1)) (= (+ c_~bag1~0 c_~sum1~0 .cse28) (+ c_~bag2~0 .cse29 c_~sum2~0 .cse30)) (< (+ .cse29 .cse30 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse28)) (< 2147483647 (+ .cse29 .cse30)) (< c_~bag2~0 (+ .cse30 1)) (< (+ c_~bag1~0 .cse28 2147483648) 0))))) (forall ((v_ArrVal_973 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_973) c_~A~0.base))) (let ((.cse33 (select .cse34 .cse5)) (.cse32 (select .cse34 .cse4))) (or (< c_~cap1~0 (+ c_~bag1~0 .cse32 1)) (= (+ c_~bag1~0 c_~sum1~0 .cse32) (+ c_~bag2~0 .cse33 c_~sum2~0 (select .cse34 .cse6))) (< 2147483647 (+ c_~bag2~0 .cse33 c_~sum2~0)) (< 2147483647 (+ c_~bag1~0 .cse32)) (< (+ c_~bag2~0 .cse33 c_~sum2~0 2147483648) 0) (< (+ c_~bag1~0 .cse32 2147483648) 0)))))) .cse18 .cse19))) is different from false [2023-11-17 12:12:28,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:12:28,581 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 438 treesize of output 203 [2023-11-17 12:12:28,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:12:28,599 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 643 treesize of output 565 [2023-11-17 12:12:28,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:12:28,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 400 treesize of output 338 [2023-11-17 12:12:28,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:12:28,656 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 198 treesize of output 171 [2023-11-17 12:12:29,267 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-17 12:12:29,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 295 treesize of output 1 [2023-11-17 12:12:29,273 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-17 12:12:29,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 355 treesize of output 1 [2023-11-17 12:12:29,278 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-17 12:12:29,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 455 treesize of output 1 [2023-11-17 12:12:29,283 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-17 12:12:29,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 320 treesize of output 1 [2023-11-17 12:12:29,289 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-17 12:12:29,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 424 treesize of output 1 [2023-11-17 12:12:29,294 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-17 12:12:29,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 226 treesize of output 1 [2023-11-17 12:12:29,302 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-17 12:12:29,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 362 treesize of output 1 [2023-11-17 12:12:29,309 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-17 12:12:29,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 295 treesize of output 1 [2023-11-17 12:12:29,315 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-17 12:12:29,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 226 treesize of output 1 [2023-11-17 12:12:29,323 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-17 12:12:29,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 430 treesize of output 1 [2023-11-17 12:12:29,331 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-17 12:12:29,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 226 treesize of output 1 [2023-11-17 12:12:29,336 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-17 12:12:29,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 191 treesize of output 1 [2023-11-17 12:12:29,342 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-17 12:12:29,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 326 treesize of output 1 [2023-11-17 12:12:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:12:29,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547035931] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:12:29,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:12:29,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-11-17 12:12:29,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887865008] [2023-11-17 12:12:29,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:12:29,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 12:12:29,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:12:29,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 12:12:29,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=890, Unknown=2, NotChecked=60, Total=1056 [2023-11-17 12:12:29,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:12:29,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 1142 transitions, 26044 flow. Second operand has 33 states, 33 states have (on average 6.515151515151516) internal successors, (215), 33 states have internal predecessors, (215), 0 states have call successors, (0), 0 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 12:12:29,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:12:29,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:12:29,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:12:33,465 INFO L124 PetriNetUnfolderBase]: 2281/4098 cut-off events. [2023-11-17 12:12:33,465 INFO L125 PetriNetUnfolderBase]: For 80622/80622 co-relation queries the response was YES. [2023-11-17 12:12:33,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40110 conditions, 4098 events. 2281/4098 cut-off events. For 80622/80622 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 27634 event pairs, 155 based on Foata normal form. 3/4097 useless extension candidates. Maximal degree in co-relation 39956. Up to 3687 conditions per place. [2023-11-17 12:12:33,521 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 1066 selfloop transitions, 97 changer transitions 41/1206 dead transitions. [2023-11-17 12:12:33,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 1206 transitions, 28859 flow [2023-11-17 12:12:33,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-17 12:12:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-17 12:12:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 226 transitions. [2023-11-17 12:12:33,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44664031620553357 [2023-11-17 12:12:33,522 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 226 transitions. [2023-11-17 12:12:33,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 226 transitions. [2023-11-17 12:12:33,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:12:33,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 226 transitions. [2023-11-17 12:12:33,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 9.826086956521738) internal successors, (226), 23 states have internal predecessors, (226), 0 states have call successors, (0), 0 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 12:12:33,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 22.0) internal successors, (528), 24 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 12:12:33,524 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 22.0) internal successors, (528), 24 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 12:12:33,524 INFO L175 Difference]: Start difference. First operand has 511 places, 1142 transitions, 26044 flow. Second operand 23 states and 226 transitions. [2023-11-17 12:12:33,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 1206 transitions, 28859 flow [2023-11-17 12:12:34,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 1206 transitions, 28183 flow, removed 274 selfloop flow, removed 30 redundant places. [2023-11-17 12:12:34,872 INFO L231 Difference]: Finished difference. Result has 508 places, 1132 transitions, 25338 flow [2023-11-17 12:12:34,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=25370, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=25338, PETRI_PLACES=508, PETRI_TRANSITIONS=1132} [2023-11-17 12:12:34,873 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 487 predicate places. [2023-11-17 12:12:34,873 INFO L495 AbstractCegarLoop]: Abstraction has has 508 places, 1132 transitions, 25338 flow [2023-11-17 12:12:34,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.515151515151516) internal successors, (215), 33 states have internal predecessors, (215), 0 states have call successors, (0), 0 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 12:12:34,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:12:34,873 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:12:34,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-11-17 12:12:35,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-11-17 12:12:35,074 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:12:35,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:12:35,074 INFO L85 PathProgramCache]: Analyzing trace with hash -6353129, now seen corresponding path program 33 times [2023-11-17 12:12:35,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:12:35,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109533102] [2023-11-17 12:12:35,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:12:35,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:12:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:12:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:12:36,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:12:36,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109533102] [2023-11-17 12:12:36,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109533102] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:12:36,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102447803] [2023-11-17 12:12:36,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:12:36,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:12:36,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:12:36,467 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:12:36,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-11-17 12:12:36,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 12:12:36,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:12:36,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-17 12:12:36,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:12:36,633 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 12:12:36,664 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 12:12:36,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:12:37,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:12:37,114 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 90 treesize of output 65 [2023-11-17 12:12:37,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:12:37,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 177 [2023-11-17 12:12:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:12:37,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:12:38,430 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~A~0.offset (* c_~N~0 4) (- 4))) (.cse3 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_1006 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1006) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse4)) (.cse0 (select .cse2 .cse3))) (or (< 2147483647 (+ .cse0 c_~bag2~0 c_~sum2~0)) (< (+ .cse0 c_~bag2~0 2147483648) 0) (= (+ .cse0 c_~bag2~0 .cse1 c_~sum2~0) c_~sum1~0) (< (+ .cse0 c_~bag2~0 c_~sum2~0 2147483648) 0) (< .cse1 1) (< 2147483647 (+ .cse0 c_~bag2~0)))))) (forall ((v_ArrVal_1006 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1006) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse4)) (.cse5 (select .cse7 .cse3))) (or (< (+ .cse5 c_~bag2~0 2147483648) 0) (= (+ .cse5 c_~bag2~0 .cse6 c_~sum2~0) c_~sum1~0) (< 2147483647 (+ .cse5 c_~bag2~0 .cse6)) (< (+ .cse5 c_~bag2~0 .cse6 2147483648) 0) (< 2147483647 (+ .cse5 c_~bag2~0)))))) (or (and (forall ((v_ArrVal_1006 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1006) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse3))) (or (< 2147483647 (+ .cse8 c_~bag2~0 c_~sum2~0)) (= (+ .cse8 c_~bag2~0 (select .cse9 .cse4) c_~sum2~0) c_~sum1~0) (< (+ .cse8 c_~bag2~0 c_~sum2~0 2147483648) 0))))) (forall ((v_ArrVal_1006 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1006) c_~A~0.base))) (let ((.cse10 (select .cse12 .cse3)) (.cse11 (select .cse12 .cse4))) (or (< 2147483647 (+ .cse10 .cse11)) (< c_~bag2~0 (+ .cse11 1)) (= (+ .cse10 c_~bag2~0 .cse11 c_~sum2~0) c_~sum1~0) (< (+ .cse10 .cse11 2147483648) 0)))))) (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 c_~sum2~0))))) is different from false [2023-11-17 12:12:38,497 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse4 (+ c_~A~0.offset (* c_~N~0 4) (- 4))) (.cse5 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_1006 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1006) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (< 2147483647 (+ .cse0 c_~bag2~0 c_~sum2~0)) (< (+ .cse0 c_~bag2~0 2147483648) 0) (< (+ .cse0 c_~bag2~0 c_~sum2~0 2147483648) 0) (< .cse1 1) (< 2147483647 (+ .cse0 c_~bag2~0)) (= (+ .cse0 c_~bag2~0 .cse1 c_~sum2~0) .cse2))))) (forall ((v_ArrVal_1006 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1006) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (< (+ .cse6 c_~bag2~0 2147483648) 0) (< 2147483647 (+ .cse6 c_~bag2~0 .cse7)) (< (+ .cse6 c_~bag2~0 .cse7 2147483648) 0) (< 2147483647 (+ .cse6 c_~bag2~0)) (= (+ .cse6 c_~bag2~0 .cse7 c_~sum2~0) .cse2))))) (or (and (forall ((v_ArrVal_1006 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1006) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse5))) (or (< 2147483647 (+ .cse9 c_~bag2~0 c_~sum2~0)) (< (+ .cse9 c_~bag2~0 c_~sum2~0 2147483648) 0) (= (+ .cse9 c_~bag2~0 (select .cse10 .cse4) c_~sum2~0) .cse2))))) (forall ((v_ArrVal_1006 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1006) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse5)) (.cse12 (select .cse13 .cse4))) (or (< 2147483647 (+ .cse11 .cse12)) (< c_~bag2~0 (+ .cse12 1)) (< (+ .cse11 .cse12 2147483648) 0) (= (+ .cse11 c_~bag2~0 .cse12 c_~sum2~0) .cse2)))))) (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 c_~sum2~0))))) is different from false [2023-11-17 12:12:45,103 INFO L349 Elim1Store]: treesize reduction 25, result has 51.0 percent of original size [2023-11-17 12:12:45,103 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 404 treesize of output 189 [2023-11-17 12:12:45,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:12:45,118 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 582 treesize of output 491 [2023-11-17 12:12:45,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:12:45,150 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 303 treesize of output 243 [2023-11-17 12:12:45,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:12:45,171 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 168 treesize of output 134 [2023-11-17 12:12:45,877 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 486 treesize of output 1 [2023-11-17 12:12:45,885 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 386 treesize of output 1 [2023-11-17 12:12:45,893 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 379 treesize of output 1 [2023-11-17 12:12:45,901 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 483 treesize of output 1 [2023-11-17 12:12:45,909 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 414 treesize of output 1 [2023-11-17 12:12:45,917 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 351 treesize of output 1 [2023-11-17 12:12:45,923 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 288 treesize of output 1 [2023-11-17 12:12:45,930 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 455 treesize of output 1 [2023-11-17 12:12:45,937 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 291 treesize of output 1 [2023-11-17 12:12:45,944 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 423 treesize of output 1 [2023-11-17 12:12:45,950 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 323 treesize of output 1 [2023-11-17 12:12:45,956 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 391 treesize of output 1 [2023-11-17 12:12:45,962 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 256 treesize of output 1 [2023-11-17 12:12:45,968 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 360 treesize of output 1 [2023-11-17 12:12:45,974 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:12:45,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 514 treesize of output 1 [2023-11-17 12:12:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-17 12:12:46,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102447803] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:12:46,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:12:46,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-11-17 12:12:46,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809985285] [2023-11-17 12:12:46,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:12:46,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 12:12:46,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:12:46,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 12:12:46,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=830, Unknown=3, NotChecked=118, Total=1056 [2023-11-17 12:12:46,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:12:46,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 1132 transitions, 25338 flow. Second operand has 33 states, 33 states have (on average 6.515151515151516) internal successors, (215), 33 states have internal predecessors, (215), 0 states have call successors, (0), 0 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 12:12:46,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:12:46,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:12:46,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:12:51,980 INFO L124 PetriNetUnfolderBase]: 2220/3988 cut-off events. [2023-11-17 12:12:51,980 INFO L125 PetriNetUnfolderBase]: For 75625/75625 co-relation queries the response was YES. [2023-11-17 12:12:52,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38706 conditions, 3988 events. 2220/3988 cut-off events. For 75625/75625 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 26645 event pairs, 171 based on Foata normal form. 1/3983 useless extension candidates. Maximal degree in co-relation 38547. Up to 3637 conditions per place. [2023-11-17 12:12:52,037 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 1047 selfloop transitions, 107 changer transitions 5/1161 dead transitions. [2023-11-17 12:12:52,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 1161 transitions, 27810 flow [2023-11-17 12:12:52,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-17 12:12:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-17 12:12:52,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 145 transitions. [2023-11-17 12:12:52,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2023-11-17 12:12:52,042 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 145 transitions. [2023-11-17 12:12:52,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 145 transitions. [2023-11-17 12:12:52,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:12:52,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 145 transitions. [2023-11-17 12:12:52,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 9.666666666666666) internal successors, (145), 15 states have internal predecessors, (145), 0 states have call successors, (0), 0 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 12:12:52,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 22.0) internal successors, (352), 16 states have internal predecessors, (352), 0 states have call successors, (0), 0 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 12:12:52,043 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 22.0) internal successors, (352), 16 states have internal predecessors, (352), 0 states have call successors, (0), 0 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 12:12:52,043 INFO L175 Difference]: Start difference. First operand has 508 places, 1132 transitions, 25338 flow. Second operand 15 states and 145 transitions. [2023-11-17 12:12:52,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 1161 transitions, 27810 flow [2023-11-17 12:12:53,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 1161 transitions, 27561 flow, removed 21 selfloop flow, removed 22 redundant places. [2023-11-17 12:12:53,270 INFO L231 Difference]: Finished difference. Result has 497 places, 1134 transitions, 25349 flow [2023-11-17 12:12:53,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=25093, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1025, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=25349, PETRI_PLACES=497, PETRI_TRANSITIONS=1134} [2023-11-17 12:12:53,272 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 476 predicate places. [2023-11-17 12:12:53,272 INFO L495 AbstractCegarLoop]: Abstraction has has 497 places, 1134 transitions, 25349 flow [2023-11-17 12:12:53,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.515151515151516) internal successors, (215), 33 states have internal predecessors, (215), 0 states have call successors, (0), 0 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 12:12:53,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:12:53,272 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:12:53,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-11-17 12:12:53,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-11-17 12:12:53,479 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:12:53,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:12:53,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1753102121, now seen corresponding path program 34 times [2023-11-17 12:12:53,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:12:53,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023016171] [2023-11-17 12:12:53,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:12:53,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:12:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:12:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:12:54,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:12:54,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023016171] [2023-11-17 12:12:54,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023016171] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:12:54,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437472507] [2023-11-17 12:12:54,585 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:12:54,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:12:54,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:12:54,586 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:12:54,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-11-17 12:12:54,721 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:12:54,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:12:54,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-17 12:12:54,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:12:54,757 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 12:12:54,791 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 12:12:54,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:12:55,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:12:55,003 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 47 treesize of output 38 [2023-11-17 12:12:55,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:12:55,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 162 [2023-11-17 12:12:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:12:55,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:13:02,617 INFO L349 Elim1Store]: treesize reduction 25, result has 51.0 percent of original size [2023-11-17 12:13:02,617 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 226 treesize of output 111 [2023-11-17 12:13:02,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:13:02,627 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 663 treesize of output 595 [2023-11-17 12:13:02,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 98 [2023-11-17 12:13:02,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:13:02,653 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 110 treesize of output 90 [2023-11-17 12:13:02,679 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:13:02,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 260 treesize of output 1 [2023-11-17 12:13:02,685 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:13:02,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 455 treesize of output 1 [2023-11-17 12:13:02,691 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:13:02,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 191 treesize of output 1 [2023-11-17 12:13:02,697 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:13:02,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 260 treesize of output 1 [2023-11-17 12:13:02,703 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:13:02,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 1 [2023-11-17 12:13:02,708 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:13:02,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 295 treesize of output 1 [2023-11-17 12:13:02,714 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:13:02,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 320 treesize of output 1 [2023-11-17 12:13:02,720 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:13:02,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 295 treesize of output 1 [2023-11-17 12:13:02,725 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:13:02,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 362 treesize of output 1 [2023-11-17 12:13:02,731 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-11-17 12:13:02,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 326 treesize of output 1 [2023-11-17 12:13:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:13:02,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437472507] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:13:02,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:13:02,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-11-17 12:13:02,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181667652] [2023-11-17 12:13:02,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:13:02,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 12:13:02,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:13:02,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 12:13:02,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=895, Unknown=1, NotChecked=0, Total=1056 [2023-11-17 12:13:02,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:13:02,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 1134 transitions, 25349 flow. Second operand has 33 states, 33 states have (on average 6.515151515151516) internal successors, (215), 33 states have internal predecessors, (215), 0 states have call successors, (0), 0 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 12:13:02,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:13:02,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:13:02,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:13:15,867 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse111 (* c_~i~0 4))) (let ((.cse9 (+ c_~A~0.offset (* c_~j~0 4))) (.cse126 (select |c_#memory_int| c_~A~0.base)) (.cse11 (+ c_~A~0.offset .cse111))) (let ((.cse56 (select .cse126 .cse11)) (.cse10 (+ c_~A~0.offset (* c_~N~0 4) (- 4))) (.cse48 (select .cse126 .cse9))) (let ((.cse44 (+ c_~bag2~0 .cse48)) (.cse49 (+ c_~bag2~0 .cse48 c_~sum2~0)) (.cse0 (+ c_~bag2~0 c_~sum2~0)) (.cse125 (select .cse126 .cse10)) (.cse4 (+ c_~bag1~0 c_~sum1~0)) (.cse113 (+ c_~bag1~0 .cse56))) (let ((.cse2 (= c_~sum1~0 c_~sum2~0)) (.cse51 (< 2147483647 .cse113)) (.cse52 (< (+ c_~bag1~0 .cse56 2147483648) 0)) (.cse25 (< 2147483647 .cse4)) (.cse26 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0)) (.cse107 (+ c_~bag1~0 c_~sum1~0 .cse56)) (.cse42 (not (= c_~N~0 (+ c_~i~0 1)))) (.cse120 (< c_~bag2~0 (+ .cse125 1))) (.cse121 (< (+ .cse48 .cse125 2147483648) 0)) (.cse122 (< 2147483647 (+ .cse48 .cse125))) (.cse12 (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0)) (.cse20 (< 2147483647 .cse0)) (.cse46 (< (+ c_~bag2~0 .cse48 2147483648) 0)) (.cse114 (< 2147483647 (+ c_~bag2~0 .cse48 .cse125))) (.cse115 (< (+ c_~bag2~0 .cse48 .cse125 2147483648) 0)) (.cse117 (< 2147483647 .cse49)) (.cse118 (< (+ c_~bag2~0 .cse48 c_~sum2~0 2147483648) 0)) (.cse119 (< .cse125 1)) (.cse47 (< 2147483647 .cse44)) (.cse123 (+ c_~bag2~0 .cse48 .cse125 c_~sum2~0)) (.cse50 (< c_~i~0 c_~N~0)) (.cse43 (not (= c_~N~0 (+ 2 c_~j~0))))) (and (or (< c_~j~0 c_~N~0) (= c_~sum1~0 .cse0)) (let ((.cse3 (<= 0 (+ c_~sum1~0 2147483648)))) (or (and (<= c_~sum2~0 2147483647) (or (let ((.cse1 (+ c_~bag1~0 2147483648))) (and (= c_~sum1~0 0) (= c_~bag1~0 .cse0) (<= c_~bag2~0 .cse1) (<= 0 .cse1) (<= c_~bag1~0 2147483647))) (and .cse2 (= c_~bag2~0 c_~bag1~0) .cse3))) (and (<= c_~bag2~0 2147483647) (<= c_~sum1~0 2147483647) (<= 0 (+ c_~bag2~0 2147483648)) (= c_~bag2~0 .cse4) .cse3 (= c_~sum2~0 0)))) (= c_~N~0 2) (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse11)) (.cse5 (select .cse8 .cse10)) (.cse6 (select .cse8 .cse9))) (or (< (+ c_~bag2~0 .cse5 2147483648 .cse6) 0) (< 2147483647 (+ c_~bag1~0 .cse7)) (< c_~cap1~0 (+ c_~bag1~0 .cse7 1)) (< 2147483647 (+ c_~bag2~0 .cse6)) (= (+ c_~bag1~0 c_~sum1~0 .cse7) (+ c_~bag2~0 c_~sum2~0 .cse5 .cse6)) (< (+ c_~bag1~0 .cse7 2147483648) 0) (< (+ c_~bag2~0 2147483648 .cse6) 0) (< 2147483647 (+ c_~bag2~0 .cse5 .cse6)))))) (or .cse12 (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse11)) (.cse14 (select .cse15 .cse9))) (or (< 2147483647 (+ c_~bag1~0 .cse13)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse14)) (< c_~cap1~0 (+ c_~bag1~0 .cse13 1)) (= (+ c_~bag1~0 c_~sum1~0 .cse13) (+ c_~bag2~0 c_~sum2~0 (select .cse15 .cse10) .cse14)) (< (+ c_~bag1~0 .cse13 2147483648) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse14) 0))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse10)) (.cse18 (select .cse19 .cse9)) (.cse16 (select .cse19 .cse11))) (or (< 2147483647 (+ c_~bag1~0 .cse16)) (< c_~cap1~0 (+ c_~bag1~0 .cse16 1)) (< 2147483647 (+ .cse17 .cse18)) (< (+ .cse17 2147483648 .cse18) 0) (< c_~bag2~0 (+ .cse17 1)) (= (+ c_~bag1~0 c_~sum1~0 .cse16) (+ c_~bag2~0 c_~sum2~0 .cse17 .cse18)) (< (+ c_~bag1~0 .cse16 2147483648) 0)))))) .cse20) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse23 (select .cse24 .cse10)) (.cse21 (select .cse24 .cse11)) (.cse22 (select .cse24 .cse9))) (or (< 2147483647 (+ c_~bag1~0 .cse21)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse22)) (< c_~cap1~0 (+ c_~bag1~0 .cse21 1)) (< .cse23 1) (< 2147483647 (+ c_~bag2~0 .cse22)) (= (+ c_~bag1~0 c_~sum1~0 .cse21) (+ c_~bag2~0 c_~sum2~0 .cse23 .cse22)) (< (+ c_~bag1~0 .cse21 2147483648) 0) (< (+ c_~bag2~0 2147483648 .cse22) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse22) 0))))) (or .cse25 .cse26 (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse28 (select .cse30 .cse11)) (.cse29 (select .cse30 .cse10)) (.cse27 (select .cse30 .cse9))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse27)) (< (+ c_~bag1~0 .cse28) c_~cap1~0) (< .cse29 1) (< 2147483647 (+ c_~bag2~0 .cse27)) (= (+ c_~bag1~0 c_~sum1~0 .cse28) (+ c_~bag2~0 c_~sum2~0 .cse29 .cse27)) (< (+ c_~bag2~0 2147483648 .cse27) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse27) 0))))) (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse33 (select .cse34 .cse11)) (.cse31 (select .cse34 .cse10)) (.cse32 (select .cse34 .cse9))) (or (< 2147483647 (+ .cse31 .cse32)) (< (+ .cse31 2147483648 .cse32) 0) (< (+ c_~bag1~0 .cse33) c_~cap1~0) (< c_~bag2~0 (+ .cse31 1)) (= (+ c_~bag1~0 c_~sum1~0 .cse33) (+ c_~bag2~0 c_~sum2~0 .cse31 .cse32)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse36 (select .cse37 .cse11)) (.cse35 (select .cse37 .cse9))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse35)) (< (+ c_~bag1~0 .cse36) c_~cap1~0) (= (+ c_~bag1~0 c_~sum1~0 .cse36) (+ c_~bag2~0 c_~sum2~0 (select .cse37 .cse10) .cse35)) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse35) 0)))))) .cse12 .cse20) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse40 (select .cse41 .cse11)) (.cse38 (select .cse41 .cse10)) (.cse39 (select .cse41 .cse9))) (or (< (+ c_~bag2~0 .cse38 2147483648 .cse39) 0) (< (+ c_~bag1~0 .cse40) c_~cap1~0) (< 2147483647 (+ c_~bag2~0 .cse39)) (= (+ c_~bag1~0 c_~sum1~0 .cse40) (+ c_~bag2~0 c_~sum2~0 .cse38 .cse39)) (< (+ c_~bag2~0 2147483648 .cse39) 0) (< 2147483647 (+ c_~bag2~0 .cse38 .cse39))))))))) .cse42 .cse43) .cse2 (or (let ((.cse45 (= .cse49 .cse4))) (and (or (< .cse44 c_~cap2~0) .cse12 .cse45 .cse20) (or .cse46 .cse47 .cse45 (< c_~cap2~0 (+ c_~bag2~0 .cse48 1))))) (not (= c_~N~0 (+ c_~j~0 1))) .cse50) (or (not (= (+ 2 c_~i~0) c_~N~0)) .cse43 (let ((.cse60 (+ c_~A~0.offset .cse111 4))) (let ((.cse54 (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse109 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse110 (select .cse109 .cse10)) (.cse108 (select .cse109 .cse9))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse108)) (= (+ (select .cse109 .cse60) c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 .cse110 .cse108)) (< .cse110 1) (< 2147483647 (+ c_~bag2~0 .cse108)) (< (+ c_~bag2~0 2147483648 .cse108) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse108) 0)))))) (.cse53 (< (+ c_~bag1~0 c_~sum1~0 .cse56 2147483648) 0)) (.cse68 (< 2147483647 .cse107))) (and (or .cse51 .cse52 (and (or .cse53 (and .cse54 (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse55 (select .cse59 .cse60)) (.cse57 (select .cse59 .cse10)) (.cse58 (select .cse59 .cse9))) (or (= (+ .cse55 c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 .cse57 .cse58)) (< .cse55 1) (< (+ c_~bag2~0 2147483648 .cse58) 0) (< 2147483647 (+ c_~bag2~0 .cse57 .cse58)))))) (or .cse12 .cse20 (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse64 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse62 (select .cse64 .cse9)) (.cse61 (select .cse64 .cse10)) (.cse63 (select .cse64 .cse60))) (or (< 2147483647 (+ .cse61 .cse62)) (< (+ .cse61 2147483648 .cse62) 0) (= (+ .cse63 c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 .cse61 .cse62)) (< c_~bag2~0 (+ .cse61 1)) (< .cse63 1))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse67 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse66 (select .cse67 .cse60)) (.cse65 (select .cse67 .cse9))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse65)) (= (+ .cse66 c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 (select .cse67 .cse10) .cse65)) (< .cse66 1) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse65) 0)))))))) .cse68) (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse72 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse69 (select .cse72 .cse60)) (.cse71 (select .cse72 .cse9)) (.cse70 (select .cse72 .cse10))) (or (< (+ .cse69 c_~bag1~0 .cse56 2147483648) 0) (< 2147483647 (+ .cse69 c_~bag1~0 .cse56)) (< 2147483647 (+ .cse70 .cse71)) (< (+ .cse70 2147483648 .cse71) 0) (= (+ .cse69 c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 .cse70 .cse71)) (< c_~bag2~0 (+ .cse70 1)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse75 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse73 (select .cse75 .cse60)) (.cse74 (select .cse75 .cse9))) (or (< (+ .cse73 c_~bag1~0 .cse56 2147483648) 0) (< 2147483647 (+ .cse73 c_~bag1~0 .cse56)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse74)) (= (+ .cse73 c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 (select .cse75 .cse10) .cse74)) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse74) 0)))))) .cse12 .cse20) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse79 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse76 (select .cse79 .cse60)) (.cse77 (select .cse79 .cse10)) (.cse78 (select .cse79 .cse9))) (or (< (+ .cse76 c_~bag1~0 .cse56 2147483648) 0) (< (+ c_~bag2~0 .cse77 2147483648 .cse78) 0) (< 2147483647 (+ .cse76 c_~bag1~0 .cse56)) (= (+ .cse76 c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 .cse77 .cse78)) (< 2147483647 (+ c_~bag2~0 .cse78)) (< (+ c_~bag2~0 2147483648 .cse78) 0) (< 2147483647 (+ c_~bag2~0 .cse77 .cse78)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse83 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse80 (select .cse83 .cse60)) (.cse82 (select .cse83 .cse10)) (.cse81 (select .cse83 .cse9))) (or (< 2147483647 (+ .cse80 c_~bag1~0 .cse56)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse81)) (= (+ .cse80 c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 .cse82 .cse81)) (< .cse82 1) (< 2147483647 (+ c_~bag2~0 .cse81)) (< (+ c_~bag2~0 2147483648 .cse81) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse81) 0))))))) (or .cse25 .cse26 (and (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse86 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse85 (select .cse86 .cse9)) (.cse84 (select .cse86 .cse60))) (or (< c_~bag1~0 (+ .cse84 1)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse85)) (< (+ .cse84 .cse56 2147483648) 0) (= (+ .cse84 c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 (select .cse86 .cse10) .cse85)) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse85) 0) (< 2147483647 (+ .cse84 .cse56)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse90 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse89 (select .cse90 .cse9)) (.cse88 (select .cse90 .cse10)) (.cse87 (select .cse90 .cse60))) (or (< c_~bag1~0 (+ .cse87 1)) (< (+ .cse87 .cse56 2147483648) 0) (< 2147483647 (+ .cse88 .cse89)) (< (+ .cse88 2147483648 .cse89) 0) (= (+ .cse87 c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 .cse88 .cse89)) (< c_~bag2~0 (+ .cse88 1)) (< 2147483647 (+ .cse87 .cse56))))))) .cse12 .cse20) (or (and .cse54 (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse93 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse92 (select .cse93 .cse9)) (.cse91 (select .cse93 .cse10))) (or (< 2147483647 (+ .cse91 .cse92)) (< (+ .cse91 2147483648 .cse92) 0) (= (+ (select .cse93 .cse60) c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 .cse91 .cse92)) (< c_~bag2~0 (+ .cse91 1)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse95 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse94 (select .cse95 .cse9))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse94)) (= (+ (select .cse95 .cse60) c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 (select .cse95 .cse10) .cse94)) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse94) 0)))))) .cse12 .cse20) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse98 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse96 (select .cse98 .cse10)) (.cse97 (select .cse98 .cse9))) (or (< (+ c_~bag2~0 .cse96 2147483648 .cse97) 0) (= (+ (select .cse98 .cse60) c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 .cse96 .cse97)) (< 2147483647 (+ c_~bag2~0 .cse97)) (< (+ c_~bag2~0 2147483648 .cse97) 0) (< 2147483647 (+ c_~bag2~0 .cse96 .cse97))))))) .cse53 .cse68) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse102 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse99 (select .cse102 .cse60)) (.cse100 (select .cse102 .cse10)) (.cse101 (select .cse102 .cse9))) (or (< c_~bag1~0 (+ .cse99 1)) (< (+ c_~bag2~0 .cse100 2147483648 .cse101) 0) (< (+ .cse99 .cse56 2147483648) 0) (= (+ .cse99 c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 .cse100 .cse101)) (< 2147483647 (+ c_~bag2~0 .cse101)) (< (+ c_~bag2~0 2147483648 .cse101) 0) (< 2147483647 (+ .cse99 .cse56)) (< 2147483647 (+ c_~bag2~0 .cse100 .cse101)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse106 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse105 (select .cse106 .cse10)) (.cse104 (select .cse106 .cse9)) (.cse103 (select .cse106 .cse60))) (or (< c_~bag1~0 (+ .cse103 1)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse104)) (< (+ .cse103 .cse56 2147483648) 0) (= (+ .cse103 c_~bag1~0 c_~sum1~0 .cse56) (+ c_~bag2~0 c_~sum2~0 .cse105 .cse104)) (< .cse105 1) (< 2147483647 (+ c_~bag2~0 .cse104)) (< (+ c_~bag2~0 2147483648 .cse104) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse104) 0) (< 2147483647 (+ .cse103 .cse56)))))))))))) (<= c_~j~0 2) (<= c_~i~0 2) (or (let ((.cse112 (let ((.cse116 (= .cse107 .cse123))) (and (or .cse46 .cse47 (and (or .cse114 .cse115 .cse116) (or .cse117 .cse116 .cse118 .cse119))) (or .cse12 (and (or .cse117 .cse116 .cse118) (or .cse120 .cse121 .cse122 .cse116)) .cse20))))) (and (or (< c_~cap1~0 (+ c_~bag1~0 .cse56 1)) .cse112 .cse51 .cse52) (or .cse112 (< .cse113 c_~cap1~0) .cse25 .cse26))) .cse42 .cse43) (or (let ((.cse124 (= .cse123 .cse4))) (and (or (and (or .cse120 .cse121 .cse122 .cse124) (or .cse117 .cse124 .cse118)) .cse12 .cse20) (or .cse46 (and (or .cse114 .cse124 .cse115) (or .cse117 .cse124 .cse118 .cse119)) .cse47))) .cse50 .cse43))))))) is different from false [2023-11-17 12:13:18,346 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse99 (* c_~i~0 4))) (let ((.cse107 (select |c_#memory_int| c_~A~0.base)) (.cse6 (+ c_~A~0.offset .cse99))) (let ((.cse44 (select .cse107 .cse6))) (let ((.cse101 (+ c_~bag1~0 .cse44))) (let ((.cse39 (< 2147483647 .cse101)) (.cse40 (< (+ c_~bag1~0 .cse44 2147483648) 0)) (.cse20 (< 2147483647 (+ c_~bag1~0 c_~sum1~0))) (.cse21 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0)) (.cse7 (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0)) (.cse15 (< 2147483647 (+ c_~bag2~0 c_~sum2~0))) (.cse95 (+ c_~bag1~0 c_~sum1~0 .cse44)) (.cse4 (+ c_~A~0.offset (* c_~j~0 4))) (.cse5 (+ c_~A~0.offset (* c_~N~0 4) (- 4))) (.cse37 (not (= c_~N~0 (+ c_~i~0 1)))) (.cse38 (not (= c_~N~0 (+ 2 c_~j~0))))) (and (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse6)) (.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (< (+ c_~bag2~0 .cse0 2147483648 .cse1) 0) (< 2147483647 (+ c_~bag1~0 .cse2)) (< c_~cap1~0 (+ c_~bag1~0 .cse2 1)) (< 2147483647 (+ c_~bag2~0 .cse1)) (= (+ c_~bag1~0 c_~sum1~0 .cse2) (+ c_~bag2~0 c_~sum2~0 .cse0 .cse1)) (< (+ c_~bag1~0 .cse2 2147483648) 0) (< (+ c_~bag2~0 2147483648 .cse1) 0) (< 2147483647 (+ c_~bag2~0 .cse0 .cse1)))))) (or .cse7 (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse6)) (.cse9 (select .cse10 .cse4))) (or (< 2147483647 (+ c_~bag1~0 .cse8)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse9)) (< c_~cap1~0 (+ c_~bag1~0 .cse8 1)) (= (+ c_~bag1~0 c_~sum1~0 .cse8) (+ c_~bag2~0 c_~sum2~0 (select .cse10 .cse5) .cse9)) (< (+ c_~bag1~0 .cse8 2147483648) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse9) 0))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse5)) (.cse13 (select .cse14 .cse4)) (.cse11 (select .cse14 .cse6))) (or (< 2147483647 (+ c_~bag1~0 .cse11)) (< c_~cap1~0 (+ c_~bag1~0 .cse11 1)) (< 2147483647 (+ .cse12 .cse13)) (< (+ .cse12 2147483648 .cse13) 0) (< c_~bag2~0 (+ .cse12 1)) (= (+ c_~bag1~0 c_~sum1~0 .cse11) (+ c_~bag2~0 c_~sum2~0 .cse12 .cse13)) (< (+ c_~bag1~0 .cse11 2147483648) 0)))))) .cse15) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse5)) (.cse16 (select .cse19 .cse6)) (.cse17 (select .cse19 .cse4))) (or (< 2147483647 (+ c_~bag1~0 .cse16)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse17)) (< c_~cap1~0 (+ c_~bag1~0 .cse16 1)) (< .cse18 1) (< 2147483647 (+ c_~bag2~0 .cse17)) (= (+ c_~bag1~0 c_~sum1~0 .cse16) (+ c_~bag2~0 c_~sum2~0 .cse18 .cse17)) (< (+ c_~bag1~0 .cse16 2147483648) 0) (< (+ c_~bag2~0 2147483648 .cse17) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse17) 0))))) (or .cse20 .cse21 (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse23 (select .cse25 .cse6)) (.cse24 (select .cse25 .cse5)) (.cse22 (select .cse25 .cse4))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse22)) (< (+ c_~bag1~0 .cse23) c_~cap1~0) (< .cse24 1) (< 2147483647 (+ c_~bag2~0 .cse22)) (= (+ c_~bag1~0 c_~sum1~0 .cse23) (+ c_~bag2~0 c_~sum2~0 .cse24 .cse22)) (< (+ c_~bag2~0 2147483648 .cse22) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse22) 0))))) (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse28 (select .cse29 .cse6)) (.cse26 (select .cse29 .cse5)) (.cse27 (select .cse29 .cse4))) (or (< 2147483647 (+ .cse26 .cse27)) (< (+ .cse26 2147483648 .cse27) 0) (< (+ c_~bag1~0 .cse28) c_~cap1~0) (< c_~bag2~0 (+ .cse26 1)) (= (+ c_~bag1~0 c_~sum1~0 .cse28) (+ c_~bag2~0 c_~sum2~0 .cse26 .cse27)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse31 (select .cse32 .cse6)) (.cse30 (select .cse32 .cse4))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse30)) (< (+ c_~bag1~0 .cse31) c_~cap1~0) (= (+ c_~bag1~0 c_~sum1~0 .cse31) (+ c_~bag2~0 c_~sum2~0 (select .cse32 .cse5) .cse30)) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse30) 0)))))) .cse7 .cse15) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse35 (select .cse36 .cse6)) (.cse33 (select .cse36 .cse5)) (.cse34 (select .cse36 .cse4))) (or (< (+ c_~bag2~0 .cse33 2147483648 .cse34) 0) (< (+ c_~bag1~0 .cse35) c_~cap1~0) (< 2147483647 (+ c_~bag2~0 .cse34)) (= (+ c_~bag1~0 c_~sum1~0 .cse35) (+ c_~bag2~0 c_~sum2~0 .cse33 .cse34)) (< (+ c_~bag2~0 2147483648 .cse34) 0) (< 2147483647 (+ c_~bag2~0 .cse33 .cse34))))))))) .cse37 .cse38) (or (not (= (+ 2 c_~i~0) c_~N~0)) .cse38 (let ((.cse48 (+ c_~A~0.offset .cse99 4))) (let ((.cse42 (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse97 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse98 (select .cse97 .cse5)) (.cse96 (select .cse97 .cse4))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse96)) (= (+ (select .cse97 .cse48) c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse98 .cse96)) (< .cse98 1) (< 2147483647 (+ c_~bag2~0 .cse96)) (< (+ c_~bag2~0 2147483648 .cse96) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse96) 0)))))) (.cse41 (< (+ c_~bag1~0 c_~sum1~0 .cse44 2147483648) 0)) (.cse56 (< 2147483647 .cse95))) (and (or .cse39 .cse40 (and (or .cse41 (and .cse42 (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse43 (select .cse47 .cse48)) (.cse45 (select .cse47 .cse5)) (.cse46 (select .cse47 .cse4))) (or (= (+ .cse43 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse45 .cse46)) (< .cse43 1) (< (+ c_~bag2~0 2147483648 .cse46) 0) (< 2147483647 (+ c_~bag2~0 .cse45 .cse46)))))) (or .cse7 .cse15 (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse50 (select .cse52 .cse4)) (.cse49 (select .cse52 .cse5)) (.cse51 (select .cse52 .cse48))) (or (< 2147483647 (+ .cse49 .cse50)) (< (+ .cse49 2147483648 .cse50) 0) (= (+ .cse51 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse49 .cse50)) (< c_~bag2~0 (+ .cse49 1)) (< .cse51 1))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse54 (select .cse55 .cse48)) (.cse53 (select .cse55 .cse4))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse53)) (= (+ .cse54 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 (select .cse55 .cse5) .cse53)) (< .cse54 1) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse53) 0)))))))) .cse56) (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse60 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse57 (select .cse60 .cse48)) (.cse59 (select .cse60 .cse4)) (.cse58 (select .cse60 .cse5))) (or (< (+ .cse57 c_~bag1~0 .cse44 2147483648) 0) (< 2147483647 (+ .cse57 c_~bag1~0 .cse44)) (< 2147483647 (+ .cse58 .cse59)) (< (+ .cse58 2147483648 .cse59) 0) (= (+ .cse57 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse58 .cse59)) (< c_~bag2~0 (+ .cse58 1)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse63 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse61 (select .cse63 .cse48)) (.cse62 (select .cse63 .cse4))) (or (< (+ .cse61 c_~bag1~0 .cse44 2147483648) 0) (< 2147483647 (+ .cse61 c_~bag1~0 .cse44)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse62)) (= (+ .cse61 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 (select .cse63 .cse5) .cse62)) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse62) 0)))))) .cse7 .cse15) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse67 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse64 (select .cse67 .cse48)) (.cse65 (select .cse67 .cse5)) (.cse66 (select .cse67 .cse4))) (or (< (+ .cse64 c_~bag1~0 .cse44 2147483648) 0) (< (+ c_~bag2~0 .cse65 2147483648 .cse66) 0) (< 2147483647 (+ .cse64 c_~bag1~0 .cse44)) (= (+ .cse64 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse65 .cse66)) (< 2147483647 (+ c_~bag2~0 .cse66)) (< (+ c_~bag2~0 2147483648 .cse66) 0) (< 2147483647 (+ c_~bag2~0 .cse65 .cse66)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse71 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse68 (select .cse71 .cse48)) (.cse70 (select .cse71 .cse5)) (.cse69 (select .cse71 .cse4))) (or (< 2147483647 (+ .cse68 c_~bag1~0 .cse44)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse69)) (= (+ .cse68 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse70 .cse69)) (< .cse70 1) (< 2147483647 (+ c_~bag2~0 .cse69)) (< (+ c_~bag2~0 2147483648 .cse69) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse69) 0))))))) (or .cse20 .cse21 (and (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse74 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse73 (select .cse74 .cse4)) (.cse72 (select .cse74 .cse48))) (or (< c_~bag1~0 (+ .cse72 1)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse73)) (< (+ .cse72 .cse44 2147483648) 0) (= (+ .cse72 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 (select .cse74 .cse5) .cse73)) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse73) 0) (< 2147483647 (+ .cse72 .cse44)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse78 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse77 (select .cse78 .cse4)) (.cse76 (select .cse78 .cse5)) (.cse75 (select .cse78 .cse48))) (or (< c_~bag1~0 (+ .cse75 1)) (< (+ .cse75 .cse44 2147483648) 0) (< 2147483647 (+ .cse76 .cse77)) (< (+ .cse76 2147483648 .cse77) 0) (= (+ .cse75 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse76 .cse77)) (< c_~bag2~0 (+ .cse76 1)) (< 2147483647 (+ .cse75 .cse44))))))) .cse7 .cse15) (or (and .cse42 (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse81 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse80 (select .cse81 .cse4)) (.cse79 (select .cse81 .cse5))) (or (< 2147483647 (+ .cse79 .cse80)) (< (+ .cse79 2147483648 .cse80) 0) (= (+ (select .cse81 .cse48) c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse79 .cse80)) (< c_~bag2~0 (+ .cse79 1)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse83 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse82 (select .cse83 .cse4))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse82)) (= (+ (select .cse83 .cse48) c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 (select .cse83 .cse5) .cse82)) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse82) 0)))))) .cse7 .cse15) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse86 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse84 (select .cse86 .cse5)) (.cse85 (select .cse86 .cse4))) (or (< (+ c_~bag2~0 .cse84 2147483648 .cse85) 0) (= (+ (select .cse86 .cse48) c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse84 .cse85)) (< 2147483647 (+ c_~bag2~0 .cse85)) (< (+ c_~bag2~0 2147483648 .cse85) 0) (< 2147483647 (+ c_~bag2~0 .cse84 .cse85))))))) .cse41 .cse56) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse90 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse87 (select .cse90 .cse48)) (.cse88 (select .cse90 .cse5)) (.cse89 (select .cse90 .cse4))) (or (< c_~bag1~0 (+ .cse87 1)) (< (+ c_~bag2~0 .cse88 2147483648 .cse89) 0) (< (+ .cse87 .cse44 2147483648) 0) (= (+ .cse87 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse88 .cse89)) (< 2147483647 (+ c_~bag2~0 .cse89)) (< (+ c_~bag2~0 2147483648 .cse89) 0) (< 2147483647 (+ .cse87 .cse44)) (< 2147483647 (+ c_~bag2~0 .cse88 .cse89)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse94 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse93 (select .cse94 .cse5)) (.cse92 (select .cse94 .cse4)) (.cse91 (select .cse94 .cse48))) (or (< c_~bag1~0 (+ .cse91 1)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse92)) (< (+ .cse91 .cse44 2147483648) 0) (= (+ .cse91 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse93 .cse92)) (< .cse93 1) (< 2147483647 (+ c_~bag2~0 .cse92)) (< (+ c_~bag2~0 2147483648 .cse92) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse92) 0) (< 2147483647 (+ .cse91 .cse44)))))))))))) (or (let ((.cse100 (let ((.cse103 (select .cse107 .cse5)) (.cse102 (select .cse107 .cse4))) (let ((.cse105 (< 2147483647 (+ c_~bag2~0 .cse102 c_~sum2~0))) (.cse106 (< (+ c_~bag2~0 .cse102 c_~sum2~0 2147483648) 0)) (.cse104 (= .cse95 (+ c_~bag2~0 .cse102 .cse103 c_~sum2~0)))) (and (or (< (+ c_~bag2~0 .cse102 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse102)) (and (or (< 2147483647 (+ c_~bag2~0 .cse102 .cse103)) (< (+ c_~bag2~0 .cse102 .cse103 2147483648) 0) .cse104) (or .cse105 .cse104 .cse106 (< .cse103 1)))) (or .cse7 (and (or .cse105 .cse104 .cse106) (or (< c_~bag2~0 (+ .cse103 1)) (< (+ .cse102 .cse103 2147483648) 0) (< 2147483647 (+ .cse102 .cse103)) .cse104)) .cse15)))))) (and (or (< c_~cap1~0 (+ c_~bag1~0 .cse44 1)) .cse100 .cse39 .cse40) (or .cse100 (< .cse101 c_~cap1~0) .cse20 .cse21))) .cse37 .cse38))))))) is different from false [2023-11-17 12:13:33,276 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse99 (* c_~i~0 4))) (let ((.cse107 (select |c_#memory_int| c_~A~0.base)) (.cse6 (+ c_~A~0.offset .cse99))) (let ((.cse44 (select .cse107 .cse6))) (let ((.cse108 (+ c_~bag2~0 c_~sum2~0)) (.cse101 (+ c_~bag1~0 .cse44))) (let ((.cse39 (< 2147483647 .cse101)) (.cse40 (< (+ c_~bag1~0 .cse44 2147483648) 0)) (.cse20 (< 2147483647 (+ c_~bag1~0 c_~sum1~0))) (.cse21 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0)) (.cse7 (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0)) (.cse15 (< 2147483647 .cse108)) (.cse95 (+ c_~bag1~0 c_~sum1~0 .cse44)) (.cse4 (+ c_~A~0.offset (* c_~j~0 4))) (.cse5 (+ c_~A~0.offset (* c_~N~0 4) (- 4))) (.cse37 (not (= c_~N~0 (+ c_~i~0 1)))) (.cse38 (not (= c_~N~0 (+ 2 c_~j~0))))) (and (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse6)) (.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (< (+ c_~bag2~0 .cse0 2147483648 .cse1) 0) (< 2147483647 (+ c_~bag1~0 .cse2)) (< c_~cap1~0 (+ c_~bag1~0 .cse2 1)) (< 2147483647 (+ c_~bag2~0 .cse1)) (= (+ c_~bag1~0 c_~sum1~0 .cse2) (+ c_~bag2~0 c_~sum2~0 .cse0 .cse1)) (< (+ c_~bag1~0 .cse2 2147483648) 0) (< (+ c_~bag2~0 2147483648 .cse1) 0) (< 2147483647 (+ c_~bag2~0 .cse0 .cse1)))))) (or .cse7 (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse6)) (.cse9 (select .cse10 .cse4))) (or (< 2147483647 (+ c_~bag1~0 .cse8)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse9)) (< c_~cap1~0 (+ c_~bag1~0 .cse8 1)) (= (+ c_~bag1~0 c_~sum1~0 .cse8) (+ c_~bag2~0 c_~sum2~0 (select .cse10 .cse5) .cse9)) (< (+ c_~bag1~0 .cse8 2147483648) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse9) 0))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse5)) (.cse13 (select .cse14 .cse4)) (.cse11 (select .cse14 .cse6))) (or (< 2147483647 (+ c_~bag1~0 .cse11)) (< c_~cap1~0 (+ c_~bag1~0 .cse11 1)) (< 2147483647 (+ .cse12 .cse13)) (< (+ .cse12 2147483648 .cse13) 0) (< c_~bag2~0 (+ .cse12 1)) (= (+ c_~bag1~0 c_~sum1~0 .cse11) (+ c_~bag2~0 c_~sum2~0 .cse12 .cse13)) (< (+ c_~bag1~0 .cse11 2147483648) 0)))))) .cse15) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse5)) (.cse16 (select .cse19 .cse6)) (.cse17 (select .cse19 .cse4))) (or (< 2147483647 (+ c_~bag1~0 .cse16)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse17)) (< c_~cap1~0 (+ c_~bag1~0 .cse16 1)) (< .cse18 1) (< 2147483647 (+ c_~bag2~0 .cse17)) (= (+ c_~bag1~0 c_~sum1~0 .cse16) (+ c_~bag2~0 c_~sum2~0 .cse18 .cse17)) (< (+ c_~bag1~0 .cse16 2147483648) 0) (< (+ c_~bag2~0 2147483648 .cse17) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse17) 0))))) (or .cse20 .cse21 (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse23 (select .cse25 .cse6)) (.cse24 (select .cse25 .cse5)) (.cse22 (select .cse25 .cse4))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse22)) (< (+ c_~bag1~0 .cse23) c_~cap1~0) (< .cse24 1) (< 2147483647 (+ c_~bag2~0 .cse22)) (= (+ c_~bag1~0 c_~sum1~0 .cse23) (+ c_~bag2~0 c_~sum2~0 .cse24 .cse22)) (< (+ c_~bag2~0 2147483648 .cse22) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse22) 0))))) (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse28 (select .cse29 .cse6)) (.cse26 (select .cse29 .cse5)) (.cse27 (select .cse29 .cse4))) (or (< 2147483647 (+ .cse26 .cse27)) (< (+ .cse26 2147483648 .cse27) 0) (< (+ c_~bag1~0 .cse28) c_~cap1~0) (< c_~bag2~0 (+ .cse26 1)) (= (+ c_~bag1~0 c_~sum1~0 .cse28) (+ c_~bag2~0 c_~sum2~0 .cse26 .cse27)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse31 (select .cse32 .cse6)) (.cse30 (select .cse32 .cse4))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse30)) (< (+ c_~bag1~0 .cse31) c_~cap1~0) (= (+ c_~bag1~0 c_~sum1~0 .cse31) (+ c_~bag2~0 c_~sum2~0 (select .cse32 .cse5) .cse30)) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse30) 0)))))) .cse7 .cse15) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse35 (select .cse36 .cse6)) (.cse33 (select .cse36 .cse5)) (.cse34 (select .cse36 .cse4))) (or (< (+ c_~bag2~0 .cse33 2147483648 .cse34) 0) (< (+ c_~bag1~0 .cse35) c_~cap1~0) (< 2147483647 (+ c_~bag2~0 .cse34)) (= (+ c_~bag1~0 c_~sum1~0 .cse35) (+ c_~bag2~0 c_~sum2~0 .cse33 .cse34)) (< (+ c_~bag2~0 2147483648 .cse34) 0) (< 2147483647 (+ c_~bag2~0 .cse33 .cse34))))))))) .cse37 .cse38) (or (not (= (+ 2 c_~i~0) c_~N~0)) .cse38 (let ((.cse48 (+ c_~A~0.offset .cse99 4))) (let ((.cse42 (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse97 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse98 (select .cse97 .cse5)) (.cse96 (select .cse97 .cse4))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse96)) (= (+ (select .cse97 .cse48) c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse98 .cse96)) (< .cse98 1) (< 2147483647 (+ c_~bag2~0 .cse96)) (< (+ c_~bag2~0 2147483648 .cse96) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse96) 0)))))) (.cse41 (< (+ c_~bag1~0 c_~sum1~0 .cse44 2147483648) 0)) (.cse56 (< 2147483647 .cse95))) (and (or .cse39 .cse40 (and (or .cse41 (and .cse42 (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse43 (select .cse47 .cse48)) (.cse45 (select .cse47 .cse5)) (.cse46 (select .cse47 .cse4))) (or (= (+ .cse43 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse45 .cse46)) (< .cse43 1) (< (+ c_~bag2~0 2147483648 .cse46) 0) (< 2147483647 (+ c_~bag2~0 .cse45 .cse46)))))) (or .cse7 .cse15 (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse50 (select .cse52 .cse4)) (.cse49 (select .cse52 .cse5)) (.cse51 (select .cse52 .cse48))) (or (< 2147483647 (+ .cse49 .cse50)) (< (+ .cse49 2147483648 .cse50) 0) (= (+ .cse51 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse49 .cse50)) (< c_~bag2~0 (+ .cse49 1)) (< .cse51 1))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse54 (select .cse55 .cse48)) (.cse53 (select .cse55 .cse4))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse53)) (= (+ .cse54 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 (select .cse55 .cse5) .cse53)) (< .cse54 1) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse53) 0)))))))) .cse56) (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse60 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse57 (select .cse60 .cse48)) (.cse59 (select .cse60 .cse4)) (.cse58 (select .cse60 .cse5))) (or (< (+ .cse57 c_~bag1~0 .cse44 2147483648) 0) (< 2147483647 (+ .cse57 c_~bag1~0 .cse44)) (< 2147483647 (+ .cse58 .cse59)) (< (+ .cse58 2147483648 .cse59) 0) (= (+ .cse57 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse58 .cse59)) (< c_~bag2~0 (+ .cse58 1)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse63 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse61 (select .cse63 .cse48)) (.cse62 (select .cse63 .cse4))) (or (< (+ .cse61 c_~bag1~0 .cse44 2147483648) 0) (< 2147483647 (+ .cse61 c_~bag1~0 .cse44)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse62)) (= (+ .cse61 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 (select .cse63 .cse5) .cse62)) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse62) 0)))))) .cse7 .cse15) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse67 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse64 (select .cse67 .cse48)) (.cse65 (select .cse67 .cse5)) (.cse66 (select .cse67 .cse4))) (or (< (+ .cse64 c_~bag1~0 .cse44 2147483648) 0) (< (+ c_~bag2~0 .cse65 2147483648 .cse66) 0) (< 2147483647 (+ .cse64 c_~bag1~0 .cse44)) (= (+ .cse64 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse65 .cse66)) (< 2147483647 (+ c_~bag2~0 .cse66)) (< (+ c_~bag2~0 2147483648 .cse66) 0) (< 2147483647 (+ c_~bag2~0 .cse65 .cse66)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse71 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse68 (select .cse71 .cse48)) (.cse70 (select .cse71 .cse5)) (.cse69 (select .cse71 .cse4))) (or (< 2147483647 (+ .cse68 c_~bag1~0 .cse44)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse69)) (= (+ .cse68 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse70 .cse69)) (< .cse70 1) (< 2147483647 (+ c_~bag2~0 .cse69)) (< (+ c_~bag2~0 2147483648 .cse69) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse69) 0))))))) (or .cse20 .cse21 (and (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse74 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse73 (select .cse74 .cse4)) (.cse72 (select .cse74 .cse48))) (or (< c_~bag1~0 (+ .cse72 1)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse73)) (< (+ .cse72 .cse44 2147483648) 0) (= (+ .cse72 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 (select .cse74 .cse5) .cse73)) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse73) 0) (< 2147483647 (+ .cse72 .cse44)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse78 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse77 (select .cse78 .cse4)) (.cse76 (select .cse78 .cse5)) (.cse75 (select .cse78 .cse48))) (or (< c_~bag1~0 (+ .cse75 1)) (< (+ .cse75 .cse44 2147483648) 0) (< 2147483647 (+ .cse76 .cse77)) (< (+ .cse76 2147483648 .cse77) 0) (= (+ .cse75 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse76 .cse77)) (< c_~bag2~0 (+ .cse76 1)) (< 2147483647 (+ .cse75 .cse44))))))) .cse7 .cse15) (or (and .cse42 (or (and (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse81 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse80 (select .cse81 .cse4)) (.cse79 (select .cse81 .cse5))) (or (< 2147483647 (+ .cse79 .cse80)) (< (+ .cse79 2147483648 .cse80) 0) (= (+ (select .cse81 .cse48) c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse79 .cse80)) (< c_~bag2~0 (+ .cse79 1)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse83 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse82 (select .cse83 .cse4))) (or (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse82)) (= (+ (select .cse83 .cse48) c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 (select .cse83 .cse5) .cse82)) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse82) 0)))))) .cse7 .cse15) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse86 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse84 (select .cse86 .cse5)) (.cse85 (select .cse86 .cse4))) (or (< (+ c_~bag2~0 .cse84 2147483648 .cse85) 0) (= (+ (select .cse86 .cse48) c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse84 .cse85)) (< 2147483647 (+ c_~bag2~0 .cse85)) (< (+ c_~bag2~0 2147483648 .cse85) 0) (< 2147483647 (+ c_~bag2~0 .cse84 .cse85))))))) .cse41 .cse56) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse90 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse87 (select .cse90 .cse48)) (.cse88 (select .cse90 .cse5)) (.cse89 (select .cse90 .cse4))) (or (< c_~bag1~0 (+ .cse87 1)) (< (+ c_~bag2~0 .cse88 2147483648 .cse89) 0) (< (+ .cse87 .cse44 2147483648) 0) (= (+ .cse87 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse88 .cse89)) (< 2147483647 (+ c_~bag2~0 .cse89)) (< (+ c_~bag2~0 2147483648 .cse89) 0) (< 2147483647 (+ .cse87 .cse44)) (< 2147483647 (+ c_~bag2~0 .cse88 .cse89)))))) (forall ((v_ArrVal_1038 (Array Int Int))) (let ((.cse94 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1038) c_~A~0.base))) (let ((.cse93 (select .cse94 .cse5)) (.cse92 (select .cse94 .cse4)) (.cse91 (select .cse94 .cse48))) (or (< c_~bag1~0 (+ .cse91 1)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse92)) (< (+ .cse91 .cse44 2147483648) 0) (= (+ .cse91 c_~bag1~0 c_~sum1~0 .cse44) (+ c_~bag2~0 c_~sum2~0 .cse93 .cse92)) (< .cse93 1) (< 2147483647 (+ c_~bag2~0 .cse92)) (< (+ c_~bag2~0 2147483648 .cse92) 0) (< (+ c_~bag2~0 c_~sum2~0 2147483648 .cse92) 0) (< 2147483647 (+ .cse91 .cse44)))))))))))) (or (let ((.cse100 (let ((.cse103 (select .cse107 .cse5)) (.cse102 (select .cse107 .cse4))) (let ((.cse105 (< 2147483647 (+ c_~bag2~0 .cse102 c_~sum2~0))) (.cse106 (< (+ c_~bag2~0 .cse102 c_~sum2~0 2147483648) 0)) (.cse104 (= .cse95 (+ c_~bag2~0 .cse102 .cse103 c_~sum2~0)))) (and (or (< (+ c_~bag2~0 .cse102 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse102)) (and (or (< 2147483647 (+ c_~bag2~0 .cse102 .cse103)) (< (+ c_~bag2~0 .cse102 .cse103 2147483648) 0) .cse104) (or .cse105 .cse104 .cse106 (< .cse103 1)))) (or .cse7 (and (or .cse105 .cse104 .cse106) (or (< c_~bag2~0 (+ .cse103 1)) (< (+ .cse102 .cse103 2147483648) 0) (< 2147483647 (+ .cse102 .cse103)) .cse104)) .cse15)))))) (and (or (< c_~cap1~0 (+ c_~bag1~0 .cse44 1)) .cse100 .cse39 .cse40) (or .cse100 (< .cse101 c_~cap1~0) .cse20 .cse21))) .cse37 .cse38) (= c_~sum1~0 .cse108))))))) is different from false [2023-11-17 12:13:40,130 INFO L124 PetriNetUnfolderBase]: 2690/5020 cut-off events. [2023-11-17 12:13:40,130 INFO L125 PetriNetUnfolderBase]: For 104604/104604 co-relation queries the response was YES. [2023-11-17 12:13:40,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48008 conditions, 5020 events. 2690/5020 cut-off events. For 104604/104604 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 36737 event pairs, 42 based on Foata normal form. 2/5016 useless extension candidates. Maximal degree in co-relation 47854. Up to 2656 conditions per place. [2023-11-17 12:13:40,199 INFO L140 encePairwiseOnDemand]: 10/22 looper letters, 588 selfloop transitions, 944 changer transitions 13/1547 dead transitions. [2023-11-17 12:13:40,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 1547 transitions, 36436 flow [2023-11-17 12:13:40,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-17 12:13:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-11-17 12:13:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 449 transitions. [2023-11-17 12:13:40,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43423597678916825 [2023-11-17 12:13:40,203 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 449 transitions. [2023-11-17 12:13:40,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 449 transitions. [2023-11-17 12:13:40,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:13:40,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 449 transitions. [2023-11-17 12:13:40,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 9.553191489361701) internal successors, (449), 47 states have internal predecessors, (449), 0 states have call successors, (0), 0 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 12:13:40,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 22.0) internal successors, (1056), 48 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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 12:13:40,205 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 22.0) internal successors, (1056), 48 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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 12:13:40,205 INFO L175 Difference]: Start difference. First operand has 497 places, 1134 transitions, 25349 flow. Second operand 47 states and 449 transitions. [2023-11-17 12:13:40,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 1547 transitions, 36436 flow [2023-11-17 12:13:41,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 1547 transitions, 36237 flow, removed 16 selfloop flow, removed 12 redundant places. [2023-11-17 12:13:41,698 INFO L231 Difference]: Finished difference. Result has 543 places, 1466 transitions, 35678 flow [2023-11-17 12:13:41,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=25183, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=694, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=35678, PETRI_PLACES=543, PETRI_TRANSITIONS=1466} [2023-11-17 12:13:41,700 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 522 predicate places. [2023-11-17 12:13:41,700 INFO L495 AbstractCegarLoop]: Abstraction has has 543 places, 1466 transitions, 35678 flow [2023-11-17 12:13:41,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.515151515151516) internal successors, (215), 33 states have internal predecessors, (215), 0 states have call successors, (0), 0 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 12:13:41,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:13:41,701 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:13:41,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2023-11-17 12:13:41,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-11-17 12:13:41,901 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:13:41,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:13:41,902 INFO L85 PathProgramCache]: Analyzing trace with hash -354960369, now seen corresponding path program 35 times [2023-11-17 12:13:41,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:13:41,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270349898] [2023-11-17 12:13:41,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:13:41,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:13:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:13:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:13:44,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:13:44,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270349898] [2023-11-17 12:13:44,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270349898] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:13:44,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917872683] [2023-11-17 12:13:44,289 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 12:13:44,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:13:44,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:13:44,290 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:13:44,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-11-17 12:13:44,422 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:13:44,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:13:44,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-17 12:13:44,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:13:44,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:13:44,430 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 10 treesize of output 8 [2023-11-17 12:13:44,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 12:13:44,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:13:44,671 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 47 treesize of output 38 [2023-11-17 12:13:45,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:13:45,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 160 [2023-11-17 12:13:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:13:45,464 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:13:50,668 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1070 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1070))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ .cse0 2147483648) 0) (forall ((v_ArrVal_1071 (Array Int Int))) (let ((.cse3 (select (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1071) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (select .cse3 .cse4))) (or (< 2147483647 (+ .cse1 .cse2)) (< 2147483647 .cse2) (< (+ .cse2 2147483648) 0) (< (+ .cse1 .cse2 2147483648) 0) (< 2147483647 (+ .cse0 .cse1)) (= .cse0 .cse2) (< (+ .cse0 .cse1 2147483648) 0))))))))) (forall ((v_ArrVal_1070 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1070))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse6) (< (+ .cse6 2147483648) 0) (forall ((v_ArrVal_1071 (Array Int Int))) (let ((.cse9 (select (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1071) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (select .cse9 .cse4))) (or (< 2147483647 .cse7) (< (+ .cse7 2147483648) 0) (< 2147483647 (+ .cse6 .cse8)) (= .cse6 .cse7) (< (+ .cse6 .cse8 2147483648) 0))))))))) (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1070))) (let ((.cse14 (select (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1071) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse13 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (select .cse14 .cse4))) (or (< 2147483647 (+ .cse11 .cse12)) (< (+ .cse11 .cse12 2147483648) 0) (< 2147483647 (+ .cse13 .cse11)) (< 0 (+ .cse11 1)) (= .cse13 .cse12) (< (+ .cse13 .cse11 2147483648) 0)))))) (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1070))) (let ((.cse19 (select (store .cse20 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1071) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse18 (select .cse19 .cse4))) (or (< 2147483647 .cse16) (< (+ .cse16 2147483648) 0) (< 2147483647 (+ .cse17 .cse18)) (< 0 (+ .cse18 1)) (= .cse17 .cse16) (< (+ .cse17 .cse18 2147483648) 0)))))) (forall ((v_ArrVal_1070 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1070))) (let ((.cse21 (select (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse21) (< (+ .cse21 2147483648) 0) (forall ((v_ArrVal_1071 (Array Int Int))) (let ((.cse24 (select (store .cse25 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1071) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse22 (select .cse24 .cse4)) (.cse23 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse22 .cse23)) (< 2147483647 .cse23) (< (+ .cse23 2147483648) 0) (< (+ .cse22 .cse23 2147483648) 0) (= .cse21 .cse23))))))))) (forall ((v_ArrVal_1070 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1070))) (let ((.cse26 (select (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse26) (< (+ .cse26 2147483648) 0) (forall ((v_ArrVal_1071 (Array Int Int))) (let ((.cse29 (select (store .cse30 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1071) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse27 (select .cse29 .cse4)) (.cse28 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse27 .cse28)) (< (+ .cse28 2147483648) 0) (< .cse27 1) (= .cse26 .cse28))))))))) (forall ((v_ArrVal_1070 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1070))) (let ((.cse31 (select (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse31) (< (+ .cse31 2147483648) 0) (forall ((v_ArrVal_1071 (Array Int Int))) (let ((.cse34 (select (store .cse35 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1071) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse33 (select .cse34 .cse4)) (.cse32 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse32) (< (+ .cse32 2147483648) 0) (< .cse33 1) (< 2147483647 (+ .cse31 .cse33)) (= .cse31 .cse32))))))))) (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1070))) (let ((.cse39 (select (store .cse40 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1071) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse36 (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse38 (select (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse37 (select .cse39 .cse4))) (or (< 2147483647 .cse36) (< (+ .cse37 .cse36 2147483648) 0) (< 2147483647 (+ .cse38 .cse37)) (< 0 (+ .cse37 1)) (= .cse38 .cse36) (< (+ .cse38 .cse37 2147483648) 0)))))) (forall ((v_ArrVal_1070 (Array Int Int))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1070))) (let ((.cse41 (select (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse41) (< (+ .cse41 2147483648) 0) (forall ((v_ArrVal_1071 (Array Int Int))) (let ((.cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1071) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse42) (< (+ .cse42 2147483648) 0) (= .cse41 .cse42)))))))) (forall ((v_ArrVal_1070 (Array Int Int))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1070))) (let ((.cse44 (select (select .cse47 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse44) (< (+ .cse44 2147483648) 0) (forall ((v_ArrVal_1071 (Array Int Int))) (let ((.cse46 (select (store .cse47 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1071) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse45) (< (+ .cse45 2147483648) 0) (< (select .cse46 .cse4) 1) (= .cse44 .cse45))))))))) (forall ((v_ArrVal_1070 (Array Int Int))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1070))) (let ((.cse48 (select (select .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse48) (< (+ .cse48 2147483648) 0) (forall ((v_ArrVal_1071 (Array Int Int))) (let ((.cse51 (select (store .cse52 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1071) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse49 (select .cse51 .cse4)) (.cse50 (select .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse49 .cse50)) (< (+ .cse49 .cse50 2147483648) 0) (< 0 (+ .cse49 1)) (= .cse48 .cse50))))))))))) is different from false [2023-11-17 12:13:50,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:13:50,802 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 218 treesize of output 122 [2023-11-17 12:13:50,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:13:50,811 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 502 treesize of output 436 [2023-11-17 12:13:50,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 224 [2023-11-17 12:13:50,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:13:50,832 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 139 treesize of output 117 [2023-11-17 12:13:50,916 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:13:50,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 1 [2023-11-17 12:13:50,921 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:13:50,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 1 [2023-11-17 12:13:50,925 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:13:50,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 1 [2023-11-17 12:13:50,930 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:13:50,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 1 [2023-11-17 12:13:50,934 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:13:50,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 1 [2023-11-17 12:13:50,939 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:13:50,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 343 treesize of output 1 [2023-11-17 12:13:50,943 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:13:50,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 1 [2023-11-17 12:13:50,949 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:13:50,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 1 [2023-11-17 12:13:50,954 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:13:50,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2023-11-17 12:13:50,958 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:13:50,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 1 [2023-11-17 12:13:50,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-17 12:13:50,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917872683] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:13:50,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:13:50,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 30 [2023-11-17 12:13:50,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412625901] [2023-11-17 12:13:50,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:13:50,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-17 12:13:50,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:13:50,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-17 12:13:50,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=825, Unknown=3, NotChecked=58, Total=992 [2023-11-17 12:13:50,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2023-11-17 12:13:50,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 1466 transitions, 35678 flow. Second operand has 32 states, 32 states have (on average 6.5625) internal successors, (210), 32 states have internal predecessors, (210), 0 states have call successors, (0), 0 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 12:13:50,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:13:50,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2023-11-17 12:13:50,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:14:10,200 INFO L124 PetriNetUnfolderBase]: 3119/5826 cut-off events. [2023-11-17 12:14:10,200 INFO L125 PetriNetUnfolderBase]: For 149840/149840 co-relation queries the response was YES. [2023-11-17 12:14:10,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62007 conditions, 5826 events. 3119/5826 cut-off events. For 149840/149840 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 44055 event pairs, 21 based on Foata normal form. 8/5828 useless extension candidates. Maximal degree in co-relation 61842. Up to 1443 conditions per place. [2023-11-17 12:14:10,287 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 676 selfloop transitions, 962 changer transitions 176/1816 dead transitions. [2023-11-17 12:14:10,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 1816 transitions, 45510 flow [2023-11-17 12:14:10,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-11-17 12:14:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2023-11-17 12:14:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 557 transitions. [2023-11-17 12:14:10,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45211038961038963 [2023-11-17 12:14:10,289 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 557 transitions. [2023-11-17 12:14:10,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 557 transitions. [2023-11-17 12:14:10,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:14:10,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 557 transitions. [2023-11-17 12:14:10,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 9.946428571428571) internal successors, (557), 56 states have internal predecessors, (557), 0 states have call successors, (0), 0 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 12:14:10,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 22.0) internal successors, (1254), 57 states have internal predecessors, (1254), 0 states have call successors, (0), 0 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 12:14:10,292 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 22.0) internal successors, (1254), 57 states have internal predecessors, (1254), 0 states have call successors, (0), 0 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 12:14:10,292 INFO L175 Difference]: Start difference. First operand has 543 places, 1466 transitions, 35678 flow. Second operand 56 states and 557 transitions. [2023-11-17 12:14:10,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 1816 transitions, 45510 flow [2023-11-17 12:14:12,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 1816 transitions, 44917 flow, removed 263 selfloop flow, removed 17 redundant places. [2023-11-17 12:14:12,555 INFO L231 Difference]: Finished difference. Result has 595 places, 1510 transitions, 39139 flow [2023-11-17 12:14:12,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=35131, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=829, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=39139, PETRI_PLACES=595, PETRI_TRANSITIONS=1510} [2023-11-17 12:14:12,556 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 574 predicate places. [2023-11-17 12:14:12,556 INFO L495 AbstractCegarLoop]: Abstraction has has 595 places, 1510 transitions, 39139 flow [2023-11-17 12:14:12,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.5625) internal successors, (210), 32 states have internal predecessors, (210), 0 states have call successors, (0), 0 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 12:14:12,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:14:12,556 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:14:12,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2023-11-17 12:14:12,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-11-17 12:14:12,762 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:14:12,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:14:12,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1260471055, now seen corresponding path program 36 times [2023-11-17 12:14:12,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:14:12,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783849159] [2023-11-17 12:14:12,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:14:12,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:14:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:14:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:14:14,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:14:14,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783849159] [2023-11-17 12:14:14,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783849159] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:14:14,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566208765] [2023-11-17 12:14:14,446 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 12:14:14,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:14:14,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:14:14,599 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:14:14,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-11-17 12:14:14,801 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-17 12:14:14,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:14:14,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-17 12:14:14,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:14:14,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:14:14,982 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 47 treesize of output 38 [2023-11-17 12:14:15,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:14:15,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 162 [2023-11-17 12:14:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:14:15,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:14:18,003 INFO L349 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-11-17 12:14:18,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2431 treesize of output 1773 [2023-11-17 12:14:18,089 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2023-11-17 12:14:18,090 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 1664 treesize of output 1634 [2023-11-17 12:14:18,160 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2023-11-17 12:14:18,161 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 1625 treesize of output 1574 [2023-11-17 12:14:18,232 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2023-11-17 12:14:18,233 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 1565 treesize of output 1516 [2023-11-17 12:14:18,302 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2023-11-17 12:14:18,303 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 1507 treesize of output 1451 [2023-11-17 12:14:18,372 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2023-11-17 12:14:18,373 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 1442 treesize of output 1379 [2023-11-17 12:14:18,444 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2023-11-17 12:14:18,445 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 1370 treesize of output 1300 [2023-11-17 12:14:18,518 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2023-11-17 12:14:18,519 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 1291 treesize of output 1226 [2023-11-17 12:14:18,591 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2023-11-17 12:14:18,592 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 1217 treesize of output 1173 [2023-11-17 12:14:18,617 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. Received shutdown request... [2023-11-17 12:14:21,654 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 12:14:21,657 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-17 12:14:21,660 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 12:14:21,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-11-17 12:14:21,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2023-11-17 12:14:21,865 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-21-8-5-4-1 context. [2023-11-17 12:14:21,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-17 12:14:21,867 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-17 12:14:21,867 INFO L445 BasicCegarLoop]: Path program histogram: [36, 1, 1, 1, 1, 1] [2023-11-17 12:14:21,870 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 12:14:21,870 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 12:14:21,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:14:21 BasicIcfg [2023-11-17 12:14:21,872 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 12:14:21,872 INFO L158 Benchmark]: Toolchain (without parser) took 482529.07ms. Allocated memory was 176.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 131.6MB in the beginning and 864.3MB in the end (delta: -732.8MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-11-17 12:14:21,872 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 12:14:21,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.07ms. Allocated memory is still 176.2MB. Free memory was 131.2MB in the beginning and 119.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-11-17 12:14:21,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.22ms. Allocated memory is still 176.2MB. Free memory was 119.1MB in the beginning and 116.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 12:14:21,873 INFO L158 Benchmark]: Boogie Preprocessor took 38.97ms. Allocated memory is still 176.2MB. Free memory was 116.3MB in the beginning and 114.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 12:14:21,873 INFO L158 Benchmark]: RCFGBuilder took 1353.81ms. Allocated memory is still 176.2MB. Free memory was 114.2MB in the beginning and 65.8MB in the end (delta: 48.4MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. [2023-11-17 12:14:21,873 INFO L158 Benchmark]: TraceAbstraction took 480832.61ms. Allocated memory was 176.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 65.3MB in the beginning and 864.3MB in the end (delta: -799.0MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-11-17 12:14:21,874 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.18ms. Allocated memory is still 176.2MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.07ms. Allocated memory is still 176.2MB. Free memory was 131.2MB in the beginning and 119.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.22ms. Allocated memory is still 176.2MB. Free memory was 119.1MB in the beginning and 116.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.97ms. Allocated memory is still 176.2MB. Free memory was 116.3MB in the beginning and 114.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1353.81ms. Allocated memory is still 176.2MB. Free memory was 114.2MB in the beginning and 65.8MB in the end (delta: 48.4MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. * TraceAbstraction took 480832.61ms. Allocated memory was 176.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 65.3MB in the beginning and 864.3MB in the end (delta: -799.0MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 22 PlacesBefore, 21 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 54 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 25, Positive conditional cache size: 0, Positive unconditional cache size: 25, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-21-8-5-4-1 context. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-21-8-5-4-1 context. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-21-8-5-4-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 27 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 480.7s, OverallIterations: 41, TraceHistogramMax: 2, PathProgramHistogramMax: 36, EmptinessCheckTime: 0.0s, AutomataDifference: 172.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 62 mSolverCounterUnknown, 3464 SdHoareTripleChecker+Valid, 34.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3464 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 31.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1010 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1501 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24430 IncrementalHoareTripleChecker+Invalid, 27003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1501 mSolverCounterUnsat, 0 mSDtfsCounter, 24430 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2251 GetRequests, 846 SyntacticMatches, 17 SemanticMatches, 1388 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 15179 ImplicationChecksByTransitivity, 132.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39139occurred in iteration=40, InterpolantAutomatonStates: 1001, 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.7s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 283.8s InterpolantComputationTime, 1442 NumberOfCodeBlocks, 1442 NumberOfCodeBlocksAsserted, 114 NumberOfCheckSat, 2027 ConstructedInterpolants, 52 QuantifiedInterpolants, 213201 SizeOfPredicates, 1214 NumberOfNonLiveVariables, 7873 ConjunctsInSsa, 1157 ConjunctsInUnsatCore, 114 InterpolantComputations, 5 PerfectInterpolantSequences, 120/761 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