/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 16:21:14,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:21:14,244 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 16:21:14,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:21:14,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:21:14,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:21:14,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:21:14,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:21:14,283 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:21:14,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:21:14,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:21:14,287 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:21:14,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:21:14,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:21:14,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:21:14,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:21:14,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:21:14,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:21:14,290 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:21:14,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:21:14,290 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:21:14,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:21:14,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:21:14,292 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:21:14,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:21:14,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:21:14,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:21:14,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:21:14,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:21:14,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:21:14,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:21:14,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 16:21:14,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 16:21:14,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:21:14,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:21:14,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:21:14,558 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:21:14,558 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:21:14,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-11-17 16:21:15,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:21:15,874 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:21:15,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-11-17 16:21:15,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52810e57f/82b68063ba96429d816d0c2092046158/FLAG45827817d [2023-11-17 16:21:15,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52810e57f/82b68063ba96429d816d0c2092046158 [2023-11-17 16:21:15,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:21:15,903 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:21:15,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:21:15,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:21:15,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:21:15,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:21:15" (1/1) ... [2023-11-17 16:21:15,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b367763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:21:15, skipping insertion in model container [2023-11-17 16:21:15,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:21:15" (1/1) ... [2023-11-17 16:21:15,940 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:21:16,115 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2625,2638] [2023-11-17 16:21:16,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:21:16,132 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:21:16,160 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2625,2638] [2023-11-17 16:21:16,165 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:21:16,172 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:21:16,172 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:21:16,177 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:21:16,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:21:16 WrapperNode [2023-11-17 16:21:16,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:21:16,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:21:16,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:21:16,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:21:16,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:21:16" (1/1) ... [2023-11-17 16:21:16,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:21:16" (1/1) ... [2023-11-17 16:21:16,210 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-11-17 16:21:16,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:21:16,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:21:16,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:21:16,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:21:16,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:21:16" (1/1) ... [2023-11-17 16:21:16,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:21:16" (1/1) ... [2023-11-17 16:21:16,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:21:16" (1/1) ... [2023-11-17 16:21:16,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:21:16" (1/1) ... [2023-11-17 16:21:16,229 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:21:16" (1/1) ... [2023-11-17 16:21:16,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:21:16" (1/1) ... [2023-11-17 16:21:16,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:21:16" (1/1) ... [2023-11-17 16:21:16,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:21:16" (1/1) ... [2023-11-17 16:21:16,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:21:16,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:21:16,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:21:16,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:21:16,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:21:16" (1/1) ... [2023-11-17 16:21:16,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:21:16,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:16,269 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 16:21:16,271 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 16:21:16,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:21:16,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 16:21:16,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 16:21:16,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 16:21:16,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 16:21:16,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 16:21:16,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 16:21:16,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:21:16,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:21:16,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:21:16,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 16:21:16,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 16:21:16,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 16:21:16,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:21:16,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:21:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:21:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:21:16,293 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 16:21:16,377 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:21:16,379 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:21:16,681 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:21:16,746 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:21:16,746 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 16:21:16,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:21:16 BoogieIcfgContainer [2023-11-17 16:21:16,748 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:21:16,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:21:16,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:21:16,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:21:16,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:21:15" (1/3) ... [2023-11-17 16:21:16,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647d285f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:21:16, skipping insertion in model container [2023-11-17 16:21:16,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:21:16" (2/3) ... [2023-11-17 16:21:16,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647d285f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:21:16, skipping insertion in model container [2023-11-17 16:21:16,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:21:16" (3/3) ... [2023-11-17 16:21:16,755 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2023-11-17 16:21:16,781 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:21:16,782 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 16:21:16,782 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:21:16,856 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 16:21:16,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 160 transitions, 341 flow [2023-11-17 16:21:16,967 INFO L124 PetriNetUnfolderBase]: 12/157 cut-off events. [2023-11-17 16:21:16,968 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:21:16,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 157 events. 12/157 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2023-11-17 16:21:16,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 160 transitions, 341 flow [2023-11-17 16:21:16,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 146 transitions, 310 flow [2023-11-17 16:21:16,980 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 16:21:16,996 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 146 transitions, 310 flow [2023-11-17 16:21:16,998 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 146 transitions, 310 flow [2023-11-17 16:21:16,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 146 transitions, 310 flow [2023-11-17 16:21:17,036 INFO L124 PetriNetUnfolderBase]: 12/146 cut-off events. [2023-11-17 16:21:17,036 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:21:17,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 12/146 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2023-11-17 16:21:17,042 INFO L119 LiptonReduction]: Number of co-enabled transitions 1728 [2023-11-17 16:21:21,579 INFO L134 LiptonReduction]: Checked pairs total: 1838 [2023-11-17 16:21:21,579 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-11-17 16:21:21,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 16:21:21,615 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;@25633e62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:21:21,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 16:21:21,625 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 16:21:21,625 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2023-11-17 16:21:21,625 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:21:21,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:21,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:21,626 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:21,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:21,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1050706724, now seen corresponding path program 1 times [2023-11-17 16:21:21,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:21,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198127235] [2023-11-17 16:21:21,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:21,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:22,121 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 16:21:22,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:22,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198127235] [2023-11-17 16:21:22,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198127235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:21:22,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:21:22,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 16:21:22,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578160274] [2023-11-17 16:21:22,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:21:22,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:21:22,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:22,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:21:22,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:21:22,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 306 [2023-11-17 16:21:22,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:22,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 306 [2023-11-17 16:21:22,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:22,315 INFO L124 PetriNetUnfolderBase]: 429/632 cut-off events. [2023-11-17 16:21:22,315 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-11-17 16:21:22,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 632 events. 429/632 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1988 event pairs, 138 based on Foata normal form. 1/468 useless extension candidates. Maximal degree in co-relation 1030. Up to 389 conditions per place. [2023-11-17 16:21:22,324 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 38 selfloop transitions, 4 changer transitions 1/43 dead transitions. [2023-11-17 16:21:22,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 43 transitions, 205 flow [2023-11-17 16:21:22,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:21:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:21:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-11-17 16:21:22,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4989106753812636 [2023-11-17 16:21:22,345 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-11-17 16:21:22,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-11-17 16:21:22,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:22,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-11-17 16:21:22,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,361 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,363 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 458 transitions. [2023-11-17 16:21:22,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 43 transitions, 205 flow [2023-11-17 16:21:22,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 43 transitions, 183 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-17 16:21:22,368 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2023-11-17 16:21:22,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-11-17 16:21:22,374 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2023-11-17 16:21:22,374 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2023-11-17 16:21:22,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:22,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:22,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:21:22,376 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:22,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:22,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1544751533, now seen corresponding path program 1 times [2023-11-17 16:21:22,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:22,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126659803] [2023-11-17 16:21:22,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:22,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:22,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:21:22,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:22,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126659803] [2023-11-17 16:21:22,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126659803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:21:22,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:21:22,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:21:22,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161973075] [2023-11-17 16:21:22,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:21:22,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:21:22,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:22,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:21:22,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:21:22,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 306 [2023-11-17 16:21:22,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:22,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 306 [2023-11-17 16:21:22,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:22,690 INFO L124 PetriNetUnfolderBase]: 429/633 cut-off events. [2023-11-17 16:21:22,691 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-11-17 16:21:22,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 633 events. 429/633 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1876 event pairs, 276 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 544. Up to 633 conditions per place. [2023-11-17 16:21:22,695 INFO L140 encePairwiseOnDemand]: 303/306 looper letters, 26 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-11-17 16:21:22,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 138 flow [2023-11-17 16:21:22,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:21:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:21:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-11-17 16:21:22,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42374727668845313 [2023-11-17 16:21:22,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-11-17 16:21:22,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-11-17 16:21:22,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:22,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-11-17 16:21:22,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,702 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 3 states and 389 transitions. [2023-11-17 16:21:22,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 138 flow [2023-11-17 16:21:22,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:21:22,704 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 88 flow [2023-11-17 16:21:22,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2023-11-17 16:21:22,706 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-11-17 16:21:22,706 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 88 flow [2023-11-17 16:21:22,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:22,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:22,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:21:22,710 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:22,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1840561195, now seen corresponding path program 1 times [2023-11-17 16:21:22,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:22,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916024791] [2023-11-17 16:21:22,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:22,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:21:22,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:22,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916024791] [2023-11-17 16:21:22,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916024791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:21:22,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:21:22,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:21:22,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789796869] [2023-11-17 16:21:22,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:21:22,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:21:22,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:22,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:21:22,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:21:22,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 306 [2023-11-17 16:21:22,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:22,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 306 [2023-11-17 16:21:22,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:22,913 INFO L124 PetriNetUnfolderBase]: 424/625 cut-off events. [2023-11-17 16:21:22,914 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2023-11-17 16:21:22,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 625 events. 424/625 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1869 event pairs, 186 based on Foata normal form. 50/674 useless extension candidates. Maximal degree in co-relation 1460. Up to 459 conditions per place. [2023-11-17 16:21:22,917 INFO L140 encePairwiseOnDemand]: 302/306 looper letters, 38 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-11-17 16:21:22,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 42 transitions, 212 flow [2023-11-17 16:21:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:21:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:21:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-11-17 16:21:22,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44199346405228757 [2023-11-17 16:21:22,919 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-11-17 16:21:22,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-11-17 16:21:22,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:22,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-11-17 16:21:22,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,924 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,924 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 88 flow. Second operand 4 states and 541 transitions. [2023-11-17 16:21:22,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 42 transitions, 212 flow [2023-11-17 16:21:22,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 206 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 16:21:22,927 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 101 flow [2023-11-17 16:21:22,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2023-11-17 16:21:22,928 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-11-17 16:21:22,928 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 101 flow [2023-11-17 16:21:22,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:22,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:22,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:22,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 16:21:22,930 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:22,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:22,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1129902591, now seen corresponding path program 1 times [2023-11-17 16:21:22,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:22,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925272986] [2023-11-17 16:21:22,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:22,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:23,044 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 16:21:23,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:23,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925272986] [2023-11-17 16:21:23,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925272986] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:23,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654896712] [2023-11-17 16:21:23,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:23,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:23,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:23,053 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 16:21:23,067 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 16:21:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:23,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 16:21:23,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:23,216 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 16:21:23,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:23,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 16:21:23,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654896712] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:23,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 16:21:23,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-11-17 16:21:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92427946] [2023-11-17 16:21:23,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:21:23,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 16:21:23,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 16:21:23,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-17 16:21:23,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 306 [2023-11-17 16:21:23,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:23,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:23,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 306 [2023-11-17 16:21:23,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:23,375 INFO L124 PetriNetUnfolderBase]: 410/599 cut-off events. [2023-11-17 16:21:23,375 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2023-11-17 16:21:23,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 599 events. 410/599 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1806 event pairs, 183 based on Foata normal form. 44/643 useless extension candidates. Maximal degree in co-relation 1603. Up to 452 conditions per place. [2023-11-17 16:21:23,379 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 39 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2023-11-17 16:21:23,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 246 flow [2023-11-17 16:21:23,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:21:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 16:21:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2023-11-17 16:21:23,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4071895424836601 [2023-11-17 16:21:23,381 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2023-11-17 16:21:23,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2023-11-17 16:21:23,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:23,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2023-11-17 16:21:23,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:23,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:23,386 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:23,387 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 101 flow. Second operand 5 states and 623 transitions. [2023-11-17 16:21:23,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 246 flow [2023-11-17 16:21:23,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 230 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 16:21:23,389 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 113 flow [2023-11-17 16:21:23,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=92, 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=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2023-11-17 16:21:23,390 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-11-17 16:21:23,390 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 113 flow [2023-11-17 16:21:23,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:23,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:23,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:23,398 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 16:21:23,596 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 16:21:23,597 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:23,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1940075138, now seen corresponding path program 1 times [2023-11-17 16:21:23,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:23,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657690760] [2023-11-17 16:21:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:23,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:24,527 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 16:21:24,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:24,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657690760] [2023-11-17 16:21:24,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657690760] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:24,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073651679] [2023-11-17 16:21:24,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:24,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:24,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:24,533 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 16:21:24,556 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 16:21:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:24,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-17 16:21:24,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:24,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:21:24,705 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 26 treesize of output 24 [2023-11-17 16:21:25,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:21:25,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-11-17 16:21:25,127 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 37 treesize of output 28 [2023-11-17 16:21:25,306 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 58 treesize of output 34 [2023-11-17 16:21:25,398 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 16:21:25,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:25,825 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2))) (or (< c_~min3~0 (+ .cse1 1)) (= c_~min1~0 .cse1))))) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2))) (let ((.cse3 (+ .cse4 1))) (or (< c_~min3~0 .cse3) (= c_~min1~0 .cse4) (< c_~min2~0 .cse3))))) (or (and .cse0 (<= c_~min2~0 c_~min3~0)) (forall ((v_ArrVal_113 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2) c_~min3~0)) (and (= c_~min1~0 c_~min3~0) (<= (+ c_~min3~0 1) c_~min2~0))) (or .cse0 (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2))) (or (< c_~min3~0 (+ .cse5 1)) (< .cse5 c_~min2~0))))))) is different from false [2023-11-17 16:21:26,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:26,116 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 1135 treesize of output 1007 [2023-11-17 16:21:26,149 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 515 treesize of output 503 [2023-11-17 16:21:26,166 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 503 treesize of output 491 [2023-11-17 16:21:26,184 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 491 treesize of output 467 [2023-11-17 16:21:26,209 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 467 treesize of output 443 [2023-11-17 16:21:26,224 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 443 treesize of output 425 [2023-11-17 16:21:26,239 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 425 treesize of output 389 [2023-11-17 16:21:26,254 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 389 treesize of output 383 [2023-11-17 16:21:26,269 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 383 treesize of output 371 [2023-11-17 16:21:26,278 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-17 16:21:26,936 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 16:21:26,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073651679] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:26,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:26,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2023-11-17 16:21:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182280922] [2023-11-17 16:21:26,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:26,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-17 16:21:26,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:26,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-17 16:21:26,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=496, Unknown=3, NotChecked=46, Total=650 [2023-11-17 16:21:26,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 306 [2023-11-17 16:21:26,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 113 flow. Second operand has 26 states, 26 states have (on average 87.38461538461539) internal successors, (2272), 26 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:26,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:26,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 306 [2023-11-17 16:21:26,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:27,805 INFO L124 PetriNetUnfolderBase]: 747/1095 cut-off events. [2023-11-17 16:21:27,805 INFO L125 PetriNetUnfolderBase]: For 563/563 co-relation queries the response was YES. [2023-11-17 16:21:27,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3135 conditions, 1095 events. 747/1095 cut-off events. For 563/563 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3997 event pairs, 58 based on Foata normal form. 1/1094 useless extension candidates. Maximal degree in co-relation 2725. Up to 647 conditions per place. [2023-11-17 16:21:27,813 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 80 selfloop transitions, 23 changer transitions 1/104 dead transitions. [2023-11-17 16:21:27,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 104 transitions, 550 flow [2023-11-17 16:21:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:21:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:21:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 953 transitions. [2023-11-17 16:21:27,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31143790849673203 [2023-11-17 16:21:27,816 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 953 transitions. [2023-11-17 16:21:27,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 953 transitions. [2023-11-17 16:21:27,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:27,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 953 transitions. [2023-11-17 16:21:27,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.3) internal successors, (953), 10 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:27,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 306.0) internal successors, (3366), 11 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:27,823 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 306.0) internal successors, (3366), 11 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:27,823 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 113 flow. Second operand 10 states and 953 transitions. [2023-11-17 16:21:27,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 104 transitions, 550 flow [2023-11-17 16:21:27,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 104 transitions, 534 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-17 16:21:27,829 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 262 flow [2023-11-17 16:21:27,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=262, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2023-11-17 16:21:27,831 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2023-11-17 16:21:27,832 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 262 flow [2023-11-17 16:21:27,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 87.38461538461539) internal successors, (2272), 26 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:27,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:27,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:27,841 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 16:21:28,041 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 16:21:28,042 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:28,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:28,042 INFO L85 PathProgramCache]: Analyzing trace with hash -793137588, now seen corresponding path program 2 times [2023-11-17 16:21:28,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:28,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898938760] [2023-11-17 16:21:28,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:28,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:28,621 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 16:21:28,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:28,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898938760] [2023-11-17 16:21:28,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898938760] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:28,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558620620] [2023-11-17 16:21:28,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:21:28,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:28,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:28,629 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 16:21:28,633 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 16:21:28,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:21:28,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:28,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 16:21:28,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:29,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2023-11-17 16:21:29,143 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 16:21:29,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:29,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:29,423 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 131 treesize of output 75 [2023-11-17 16:21:29,803 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 16:21:29,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558620620] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:29,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:29,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 22 [2023-11-17 16:21:29,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791563657] [2023-11-17 16:21:29,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:29,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-17 16:21:29,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:29,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-17 16:21:29,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2023-11-17 16:21:29,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 306 [2023-11-17 16:21:29,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 262 flow. Second operand has 24 states, 24 states have (on average 91.875) internal successors, (2205), 24 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:29,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:29,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 306 [2023-11-17 16:21:29,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:30,472 INFO L124 PetriNetUnfolderBase]: 913/1342 cut-off events. [2023-11-17 16:21:30,472 INFO L125 PetriNetUnfolderBase]: For 1531/1531 co-relation queries the response was YES. [2023-11-17 16:21:30,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4496 conditions, 1342 events. 913/1342 cut-off events. For 1531/1531 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4955 event pairs, 144 based on Foata normal form. 1/1342 useless extension candidates. Maximal degree in co-relation 3926. Up to 994 conditions per place. [2023-11-17 16:21:30,481 INFO L140 encePairwiseOnDemand]: 295/306 looper letters, 84 selfloop transitions, 55 changer transitions 1/140 dead transitions. [2023-11-17 16:21:30,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 140 transitions, 926 flow [2023-11-17 16:21:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:21:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-17 16:21:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1725 transitions. [2023-11-17 16:21:30,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31318082788671026 [2023-11-17 16:21:30,487 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1725 transitions. [2023-11-17 16:21:30,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1725 transitions. [2023-11-17 16:21:30,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:30,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1725 transitions. [2023-11-17 16:21:30,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 95.83333333333333) internal successors, (1725), 18 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:30,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 306.0) internal successors, (5814), 19 states have internal predecessors, (5814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:30,502 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 306.0) internal successors, (5814), 19 states have internal predecessors, (5814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:30,502 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 262 flow. Second operand 18 states and 1725 transitions. [2023-11-17 16:21:30,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 140 transitions, 926 flow [2023-11-17 16:21:30,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 140 transitions, 865 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-11-17 16:21:30,509 INFO L231 Difference]: Finished difference. Result has 68 places, 94 transitions, 647 flow [2023-11-17 16:21:30,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=647, PETRI_PLACES=68, PETRI_TRANSITIONS=94} [2023-11-17 16:21:30,512 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2023-11-17 16:21:30,512 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 94 transitions, 647 flow [2023-11-17 16:21:30,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 91.875) internal successors, (2205), 24 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:30,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:30,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:30,522 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 16:21:30,719 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 16:21:30,720 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:30,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 847238290, now seen corresponding path program 3 times [2023-11-17 16:21:30,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:30,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085770932] [2023-11-17 16:21:30,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:30,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:31,224 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 16:21:31,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:31,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085770932] [2023-11-17 16:21:31,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085770932] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:31,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076121428] [2023-11-17 16:21:31,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:21:31,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:31,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:31,226 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 16:21:31,244 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 16:21:31,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 16:21:31,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:31,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-17 16:21:31,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:31,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2023-11-17 16:21:31,682 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 16:21:31,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:31,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:31,846 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 123 treesize of output 75 [2023-11-17 16:21:32,263 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 16:21:32,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076121428] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:32,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:32,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-11-17 16:21:32,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457424423] [2023-11-17 16:21:32,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:32,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 16:21:32,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:32,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 16:21:32,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-11-17 16:21:32,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 306 [2023-11-17 16:21:32,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 94 transitions, 647 flow. Second operand has 22 states, 22 states have (on average 96.0909090909091) internal successors, (2114), 22 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:32,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:32,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 306 [2023-11-17 16:21:32,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:33,013 INFO L124 PetriNetUnfolderBase]: 1061/1555 cut-off events. [2023-11-17 16:21:33,014 INFO L125 PetriNetUnfolderBase]: For 3317/3317 co-relation queries the response was YES. [2023-11-17 16:21:33,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6144 conditions, 1555 events. 1061/1555 cut-off events. For 3317/3317 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5828 event pairs, 219 based on Foata normal form. 1/1556 useless extension candidates. Maximal degree in co-relation 5070. Up to 1207 conditions per place. [2023-11-17 16:21:33,026 INFO L140 encePairwiseOnDemand]: 296/306 looper letters, 100 selfloop transitions, 49 changer transitions 1/150 dead transitions. [2023-11-17 16:21:33,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 150 transitions, 1203 flow [2023-11-17 16:21:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 16:21:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 16:21:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1118 transitions. [2023-11-17 16:21:33,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33214497920380276 [2023-11-17 16:21:33,032 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1118 transitions. [2023-11-17 16:21:33,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1118 transitions. [2023-11-17 16:21:33,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:33,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1118 transitions. [2023-11-17 16:21:33,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 101.63636363636364) internal successors, (1118), 11 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:33,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 306.0) internal successors, (3672), 12 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:33,040 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 306.0) internal successors, (3672), 12 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:33,040 INFO L175 Difference]: Start difference. First operand has 68 places, 94 transitions, 647 flow. Second operand 11 states and 1118 transitions. [2023-11-17 16:21:33,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 150 transitions, 1203 flow [2023-11-17 16:21:33,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 150 transitions, 1146 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-11-17 16:21:33,056 INFO L231 Difference]: Finished difference. Result has 78 places, 108 transitions, 849 flow [2023-11-17 16:21:33,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=849, PETRI_PLACES=78, PETRI_TRANSITIONS=108} [2023-11-17 16:21:33,057 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2023-11-17 16:21:33,057 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 108 transitions, 849 flow [2023-11-17 16:21:33,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 96.0909090909091) internal successors, (2114), 22 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:33,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:33,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:33,066 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 16:21:33,263 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 16:21:33,264 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:33,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:33,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1741824228, now seen corresponding path program 4 times [2023-11-17 16:21:33,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:33,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647912764] [2023-11-17 16:21:33,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:33,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:33,845 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 16:21:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:33,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647912764] [2023-11-17 16:21:33,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647912764] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:33,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470202168] [2023-11-17 16:21:33,845 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:21:33,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:33,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:33,849 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 16:21:33,875 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 16:21:33,952 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:21:33,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:33,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 16:21:33,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:34,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2023-11-17 16:21:34,296 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 16:21:34,297 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:34,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:34,474 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 131 treesize of output 75 [2023-11-17 16:21:34,816 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 16:21:34,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470202168] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:34,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:34,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 22 [2023-11-17 16:21:34,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448873892] [2023-11-17 16:21:34,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:34,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-17 16:21:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:34,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-17 16:21:34,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2023-11-17 16:21:34,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 306 [2023-11-17 16:21:34,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 108 transitions, 849 flow. Second operand has 24 states, 24 states have (on average 91.875) internal successors, (2205), 24 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:34,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:34,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 306 [2023-11-17 16:21:34,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:35,742 INFO L124 PetriNetUnfolderBase]: 1234/1805 cut-off events. [2023-11-17 16:21:35,743 INFO L125 PetriNetUnfolderBase]: For 4865/4865 co-relation queries the response was YES. [2023-11-17 16:21:35,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7779 conditions, 1805 events. 1234/1805 cut-off events. For 4865/4865 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7073 event pairs, 158 based on Foata normal form. 1/1794 useless extension candidates. Maximal degree in co-relation 6440. Up to 1353 conditions per place. [2023-11-17 16:21:35,756 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 119 selfloop transitions, 77 changer transitions 1/197 dead transitions. [2023-11-17 16:21:35,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 197 transitions, 1661 flow [2023-11-17 16:21:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 16:21:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 16:21:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1930 transitions. [2023-11-17 16:21:35,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.315359477124183 [2023-11-17 16:21:35,762 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1930 transitions. [2023-11-17 16:21:35,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1930 transitions. [2023-11-17 16:21:35,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:35,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1930 transitions. [2023-11-17 16:21:35,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 96.5) internal successors, (1930), 20 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:35,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:35,775 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:35,775 INFO L175 Difference]: Start difference. First operand has 78 places, 108 transitions, 849 flow. Second operand 20 states and 1930 transitions. [2023-11-17 16:21:35,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 197 transitions, 1661 flow [2023-11-17 16:21:35,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 197 transitions, 1576 flow, removed 27 selfloop flow, removed 4 redundant places. [2023-11-17 16:21:35,803 INFO L231 Difference]: Finished difference. Result has 98 places, 130 transitions, 1188 flow [2023-11-17 16:21:35,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1188, PETRI_PLACES=98, PETRI_TRANSITIONS=130} [2023-11-17 16:21:35,804 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 68 predicate places. [2023-11-17 16:21:35,804 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 130 transitions, 1188 flow [2023-11-17 16:21:35,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 91.875) internal successors, (2205), 24 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:35,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:35,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:35,812 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 16:21:36,010 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 16:21:36,010 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:36,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash 954444684, now seen corresponding path program 5 times [2023-11-17 16:21:36,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:36,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650577028] [2023-11-17 16:21:36,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:36,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:36,462 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 16:21:36,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:36,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650577028] [2023-11-17 16:21:36,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650577028] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:36,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043570387] [2023-11-17 16:21:36,462 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:21:36,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:36,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:36,465 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 16:21:36,485 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 16:21:36,563 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-17 16:21:36,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:36,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 16:21:36,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:36,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:36,884 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 81 treesize of output 75 [2023-11-17 16:21:37,127 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 16:21:37,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:37,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:37,383 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 107 treesize of output 75 [2023-11-17 16:21:37,739 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 16:21:37,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043570387] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:37,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:37,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 20 [2023-11-17 16:21:37,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834974250] [2023-11-17 16:21:37,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:37,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 16:21:37,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:37,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 16:21:37,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2023-11-17 16:21:37,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 306 [2023-11-17 16:21:37,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 130 transitions, 1188 flow. Second operand has 22 states, 22 states have (on average 96.13636363636364) internal successors, (2115), 22 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:37,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:37,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 306 [2023-11-17 16:21:37,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:40,562 INFO L124 PetriNetUnfolderBase]: 2161/3133 cut-off events. [2023-11-17 16:21:40,563 INFO L125 PetriNetUnfolderBase]: For 11658/11658 co-relation queries the response was YES. [2023-11-17 16:21:40,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14778 conditions, 3133 events. 2161/3133 cut-off events. For 11658/11658 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13565 event pairs, 176 based on Foata normal form. 3/3124 useless extension candidates. Maximal degree in co-relation 13705. Up to 1755 conditions per place. [2023-11-17 16:21:40,590 INFO L140 encePairwiseOnDemand]: 295/306 looper letters, 245 selfloop transitions, 191 changer transitions 8/444 dead transitions. [2023-11-17 16:21:40,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 444 transitions, 4018 flow [2023-11-17 16:21:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-17 16:21:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-11-17 16:21:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 4634 transitions. [2023-11-17 16:21:40,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3292128445581131 [2023-11-17 16:21:40,605 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 4634 transitions. [2023-11-17 16:21:40,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 4634 transitions. [2023-11-17 16:21:40,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:40,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 4634 transitions. [2023-11-17 16:21:40,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 100.73913043478261) internal successors, (4634), 46 states have internal predecessors, (4634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:40,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 306.0) internal successors, (14382), 47 states have internal predecessors, (14382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:40,651 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 306.0) internal successors, (14382), 47 states have internal predecessors, (14382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:40,652 INFO L175 Difference]: Start difference. First operand has 98 places, 130 transitions, 1188 flow. Second operand 46 states and 4634 transitions. [2023-11-17 16:21:40,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 444 transitions, 4018 flow [2023-11-17 16:21:40,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 444 transitions, 3892 flow, removed 29 selfloop flow, removed 9 redundant places. [2023-11-17 16:21:40,701 INFO L231 Difference]: Finished difference. Result has 137 places, 267 transitions, 2875 flow [2023-11-17 16:21:40,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=2875, PETRI_PLACES=137, PETRI_TRANSITIONS=267} [2023-11-17 16:21:40,702 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places. [2023-11-17 16:21:40,703 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 267 transitions, 2875 flow [2023-11-17 16:21:40,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 96.13636363636364) internal successors, (2115), 22 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:40,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:40,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:40,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-17 16:21:40,908 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 16:21:40,909 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:40,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash -786143028, now seen corresponding path program 6 times [2023-11-17 16:21:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:40,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342439424] [2023-11-17 16:21:40,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:40,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:41,348 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 16:21:41,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:41,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342439424] [2023-11-17 16:21:41,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342439424] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:41,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183515920] [2023-11-17 16:21:41,349 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:21:41,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:41,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:41,350 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 16:21:41,351 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 16:21:41,439 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 16:21:41,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:41,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-17 16:21:41,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:41,662 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 55 treesize of output 35 [2023-11-17 16:21:41,717 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 16:21:41,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:41,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:41,851 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 123 treesize of output 75 [2023-11-17 16:21:42,201 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 16:21:42,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183515920] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:42,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:42,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2023-11-17 16:21:42,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217316235] [2023-11-17 16:21:42,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:42,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 16:21:42,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:42,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 16:21:42,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2023-11-17 16:21:42,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 306 [2023-11-17 16:21:42,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 267 transitions, 2875 flow. Second operand has 20 states, 20 states have (on average 95.95) internal successors, (1919), 20 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:42,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:42,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 306 [2023-11-17 16:21:42,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:43,121 INFO L124 PetriNetUnfolderBase]: 2455/3562 cut-off events. [2023-11-17 16:21:43,122 INFO L125 PetriNetUnfolderBase]: For 16037/16037 co-relation queries the response was YES. [2023-11-17 16:21:43,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18247 conditions, 3562 events. 2455/3562 cut-off events. For 16037/16037 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 15809 event pairs, 356 based on Foata normal form. 2/3552 useless extension candidates. Maximal degree in co-relation 17970. Up to 2960 conditions per place. [2023-11-17 16:21:43,151 INFO L140 encePairwiseOnDemand]: 296/306 looper letters, 254 selfloop transitions, 98 changer transitions 4/356 dead transitions. [2023-11-17 16:21:43,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 356 transitions, 4227 flow [2023-11-17 16:21:43,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-17 16:21:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-17 16:21:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1527 transitions. [2023-11-17 16:21:43,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3326797385620915 [2023-11-17 16:21:43,156 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1527 transitions. [2023-11-17 16:21:43,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1527 transitions. [2023-11-17 16:21:43,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:43,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1527 transitions. [2023-11-17 16:21:43,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 101.8) internal successors, (1527), 15 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:43,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 306.0) internal successors, (4896), 16 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:43,165 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 306.0) internal successors, (4896), 16 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:43,165 INFO L175 Difference]: Start difference. First operand has 137 places, 267 transitions, 2875 flow. Second operand 15 states and 1527 transitions. [2023-11-17 16:21:43,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 356 transitions, 4227 flow [2023-11-17 16:21:43,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 356 transitions, 2976 flow, removed 584 selfloop flow, removed 10 redundant places. [2023-11-17 16:21:43,307 INFO L231 Difference]: Finished difference. Result has 146 places, 296 transitions, 2372 flow [2023-11-17 16:21:43,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=1840, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2372, PETRI_PLACES=146, PETRI_TRANSITIONS=296} [2023-11-17 16:21:43,308 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 116 predicate places. [2023-11-17 16:21:43,308 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 296 transitions, 2372 flow [2023-11-17 16:21:43,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 95.95) internal successors, (1919), 20 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:43,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:43,309 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:43,321 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 16:21:43,517 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 16:21:43,517 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:43,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash 237552161, now seen corresponding path program 7 times [2023-11-17 16:21:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:43,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589140631] [2023-11-17 16:21:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:43,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:43,610 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 16:21:43,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589140631] [2023-11-17 16:21:43,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589140631] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626501627] [2023-11-17 16:21:43,610 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:21:43,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:43,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:43,611 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 16:21:43,631 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 16:21:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:43,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:21:43,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:43,755 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 16:21:43,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:43,804 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 16:21:43,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626501627] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:43,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:43,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 16:21:43,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541333805] [2023-11-17 16:21:43,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:43,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 16:21:43,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:43,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 16:21:43,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-17 16:21:43,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 306 [2023-11-17 16:21:43,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 296 transitions, 2372 flow. Second operand has 14 states, 14 states have (on average 119.64285714285714) internal successors, (1675), 14 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:43,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:43,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 306 [2023-11-17 16:21:43,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:44,429 INFO L124 PetriNetUnfolderBase]: 3031/4506 cut-off events. [2023-11-17 16:21:44,430 INFO L125 PetriNetUnfolderBase]: For 13579/13579 co-relation queries the response was YES. [2023-11-17 16:21:44,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17944 conditions, 4506 events. 3031/4506 cut-off events. For 13579/13579 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 22181 event pairs, 572 based on Foata normal form. 206/4652 useless extension candidates. Maximal degree in co-relation 17577. Up to 1722 conditions per place. [2023-11-17 16:21:44,459 INFO L140 encePairwiseOnDemand]: 300/306 looper letters, 362 selfloop transitions, 63 changer transitions 0/425 dead transitions. [2023-11-17 16:21:44,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 425 transitions, 3925 flow [2023-11-17 16:21:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 16:21:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 16:21:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 890 transitions. [2023-11-17 16:21:44,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415499533146592 [2023-11-17 16:21:44,462 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 890 transitions. [2023-11-17 16:21:44,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 890 transitions. [2023-11-17 16:21:44,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:44,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 890 transitions. [2023-11-17 16:21:44,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.14285714285714) internal successors, (890), 7 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:44,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 306.0) internal successors, (2448), 8 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:44,466 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 306.0) internal successors, (2448), 8 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:44,466 INFO L175 Difference]: Start difference. First operand has 146 places, 296 transitions, 2372 flow. Second operand 7 states and 890 transitions. [2023-11-17 16:21:44,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 425 transitions, 3925 flow [2023-11-17 16:21:44,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 425 transitions, 3741 flow, removed 63 selfloop flow, removed 7 redundant places. [2023-11-17 16:21:44,521 INFO L231 Difference]: Finished difference. Result has 148 places, 301 transitions, 2485 flow [2023-11-17 16:21:44,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=2066, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2485, PETRI_PLACES=148, PETRI_TRANSITIONS=301} [2023-11-17 16:21:44,521 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2023-11-17 16:21:44,522 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 301 transitions, 2485 flow [2023-11-17 16:21:44,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 119.64285714285714) internal successors, (1675), 14 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:44,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:44,522 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:44,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-17 16:21:44,723 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 16:21:44,723 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:44,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:44,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1566038165, now seen corresponding path program 8 times [2023-11-17 16:21:44,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:44,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827927864] [2023-11-17 16:21:44,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:44,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:21:44,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:44,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827927864] [2023-11-17 16:21:44,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827927864] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:44,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769191447] [2023-11-17 16:21:44,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:21:44,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:44,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:44,820 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 16:21:44,824 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 16:21:44,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:21:44,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:44,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 16:21:44,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:21:45,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:21:45,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769191447] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:45,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:45,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 16:21:45,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651330365] [2023-11-17 16:21:45,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:45,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 16:21:45,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:45,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 16:21:45,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-17 16:21:45,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 306 [2023-11-17 16:21:45,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 301 transitions, 2485 flow. Second operand has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:45,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:45,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 306 [2023-11-17 16:21:45,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:45,492 INFO L124 PetriNetUnfolderBase]: 1884/2918 cut-off events. [2023-11-17 16:21:45,492 INFO L125 PetriNetUnfolderBase]: For 10368/10368 co-relation queries the response was YES. [2023-11-17 16:21:45,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12711 conditions, 2918 events. 1884/2918 cut-off events. For 10368/10368 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14062 event pairs, 524 based on Foata normal form. 166/3048 useless extension candidates. Maximal degree in co-relation 12673. Up to 1413 conditions per place. [2023-11-17 16:21:45,511 INFO L140 encePairwiseOnDemand]: 300/306 looper letters, 232 selfloop transitions, 30 changer transitions 8/270 dead transitions. [2023-11-17 16:21:45,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 270 transitions, 2694 flow [2023-11-17 16:21:45,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 16:21:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 16:21:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 862 transitions. [2023-11-17 16:21:45,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024276377217554 [2023-11-17 16:21:45,513 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 862 transitions. [2023-11-17 16:21:45,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 862 transitions. [2023-11-17 16:21:45,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:45,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 862 transitions. [2023-11-17 16:21:45,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:45,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 306.0) internal successors, (2448), 8 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:45,517 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 306.0) internal successors, (2448), 8 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:45,517 INFO L175 Difference]: Start difference. First operand has 148 places, 301 transitions, 2485 flow. Second operand 7 states and 862 transitions. [2023-11-17 16:21:45,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 270 transitions, 2694 flow [2023-11-17 16:21:45,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 270 transitions, 2623 flow, removed 32 selfloop flow, removed 4 redundant places. [2023-11-17 16:21:45,559 INFO L231 Difference]: Finished difference. Result has 140 places, 216 transitions, 1928 flow [2023-11-17 16:21:45,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=1796, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1928, PETRI_PLACES=140, PETRI_TRANSITIONS=216} [2023-11-17 16:21:45,560 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 110 predicate places. [2023-11-17 16:21:45,560 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 216 transitions, 1928 flow [2023-11-17 16:21:45,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:45,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:45,561 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:45,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-17 16:21:45,766 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 16:21:45,766 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:45,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:45,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1462102788, now seen corresponding path program 9 times [2023-11-17 16:21:45,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:45,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060841567] [2023-11-17 16:21:45,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:45,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:45,855 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 16:21:45,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:45,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060841567] [2023-11-17 16:21:45,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060841567] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:45,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360927266] [2023-11-17 16:21:45,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:21:45,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:45,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:45,857 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 16:21:45,869 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 16:21:45,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:21:45,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:45,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:21:45,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:46,054 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 16:21:46,054 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:46,145 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 16:21:46,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360927266] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:46,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:46,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2023-11-17 16:21:46,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985685942] [2023-11-17 16:21:46,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:46,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:21:46,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:46,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:21:46,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:21:46,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 306 [2023-11-17 16:21:46,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 216 transitions, 1928 flow. Second operand has 19 states, 19 states have (on average 107.6842105263158) internal successors, (2046), 19 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:46,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:46,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 306 [2023-11-17 16:21:46,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:46,973 INFO L124 PetriNetUnfolderBase]: 1903/2914 cut-off events. [2023-11-17 16:21:46,973 INFO L125 PetriNetUnfolderBase]: For 17508/17508 co-relation queries the response was YES. [2023-11-17 16:21:46,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14367 conditions, 2914 events. 1903/2914 cut-off events. For 17508/17508 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 13993 event pairs, 606 based on Foata normal form. 112/3016 useless extension candidates. Maximal degree in co-relation 14327. Up to 1399 conditions per place. [2023-11-17 16:21:46,991 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 281 selfloop transitions, 152 changer transitions 0/433 dead transitions. [2023-11-17 16:21:46,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 433 transitions, 4096 flow [2023-11-17 16:21:46,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 16:21:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 16:21:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2270 transitions. [2023-11-17 16:21:46,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709150326797386 [2023-11-17 16:21:46,996 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2270 transitions. [2023-11-17 16:21:46,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2270 transitions. [2023-11-17 16:21:46,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:46,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2270 transitions. [2023-11-17 16:21:47,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 113.5) internal successors, (2270), 20 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:47,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:47,006 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:47,006 INFO L175 Difference]: Start difference. First operand has 140 places, 216 transitions, 1928 flow. Second operand 20 states and 2270 transitions. [2023-11-17 16:21:47,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 433 transitions, 4096 flow [2023-11-17 16:21:47,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 433 transitions, 4045 flow, removed 22 selfloop flow, removed 4 redundant places. [2023-11-17 16:21:47,063 INFO L231 Difference]: Finished difference. Result has 165 places, 284 transitions, 2929 flow [2023-11-17 16:21:47,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=1856, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2929, PETRI_PLACES=165, PETRI_TRANSITIONS=284} [2023-11-17 16:21:47,064 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2023-11-17 16:21:47,064 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 284 transitions, 2929 flow [2023-11-17 16:21:47,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 107.6842105263158) internal successors, (2046), 19 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:47,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:47,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:47,073 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 16:21:47,270 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 16:21:47,270 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:47,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:47,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1248911665, now seen corresponding path program 1 times [2023-11-17 16:21:47,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:47,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433667971] [2023-11-17 16:21:47,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:47,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:21:47,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:47,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433667971] [2023-11-17 16:21:47,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433667971] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:47,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066758496] [2023-11-17 16:21:47,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:47,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:47,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:47,359 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 16:21:47,382 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 16:21:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:47,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:21:47,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:21:47,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:21:47,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066758496] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:47,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:47,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-11-17 16:21:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840340275] [2023-11-17 16:21:47,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:47,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 16:21:47,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:47,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 16:21:47,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-17 16:21:47,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 306 [2023-11-17 16:21:47,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 284 transitions, 2929 flow. Second operand has 13 states, 13 states have (on average 115.38461538461539) internal successors, (1500), 13 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:47,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:47,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 306 [2023-11-17 16:21:47,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:47,977 INFO L124 PetriNetUnfolderBase]: 1561/2458 cut-off events. [2023-11-17 16:21:47,978 INFO L125 PetriNetUnfolderBase]: For 24285/24285 co-relation queries the response was YES. [2023-11-17 16:21:47,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14641 conditions, 2458 events. 1561/2458 cut-off events. For 24285/24285 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11875 event pairs, 649 based on Foata normal form. 136/2584 useless extension candidates. Maximal degree in co-relation 14591. Up to 1515 conditions per place. [2023-11-17 16:21:47,993 INFO L140 encePairwiseOnDemand]: 300/306 looper letters, 193 selfloop transitions, 3 changer transitions 94/290 dead transitions. [2023-11-17 16:21:47,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 290 transitions, 3538 flow [2023-11-17 16:21:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 16:21:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 16:21:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 730 transitions. [2023-11-17 16:21:47,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39760348583877997 [2023-11-17 16:21:47,995 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 730 transitions. [2023-11-17 16:21:47,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 730 transitions. [2023-11-17 16:21:47,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:47,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 730 transitions. [2023-11-17 16:21:47,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:47,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:47,999 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:47,999 INFO L175 Difference]: Start difference. First operand has 165 places, 284 transitions, 2929 flow. Second operand 6 states and 730 transitions. [2023-11-17 16:21:47,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 290 transitions, 3538 flow [2023-11-17 16:21:48,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 290 transitions, 3015 flow, removed 124 selfloop flow, removed 13 redundant places. [2023-11-17 16:21:48,101 INFO L231 Difference]: Finished difference. Result has 158 places, 196 transitions, 1672 flow [2023-11-17 16:21:48,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1672, PETRI_PLACES=158, PETRI_TRANSITIONS=196} [2023-11-17 16:21:48,103 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 128 predicate places. [2023-11-17 16:21:48,103 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 196 transitions, 1672 flow [2023-11-17 16:21:48,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 115.38461538461539) internal successors, (1500), 13 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:48,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:48,103 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:48,111 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 16:21:48,308 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 16:21:48,309 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:48,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:48,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1612772589, now seen corresponding path program 10 times [2023-11-17 16:21:48,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:48,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525600262] [2023-11-17 16:21:48,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:48,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:48,451 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 16:21:48,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:48,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525600262] [2023-11-17 16:21:48,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525600262] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:48,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099759212] [2023-11-17 16:21:48,451 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:21:48,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:48,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:48,453 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 16:21:48,475 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 16:21:48,540 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:21:48,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:48,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:21:48,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:48,628 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 16:21:48,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:48,703 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 16:21:48,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099759212] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:48,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:48,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2023-11-17 16:21:48,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225427518] [2023-11-17 16:21:48,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:48,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-17 16:21:48,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:48,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-17 16:21:48,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-11-17 16:21:48,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 306 [2023-11-17 16:21:48,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 196 transitions, 1672 flow. Second operand has 17 states, 17 states have (on average 107.41176470588235) internal successors, (1826), 17 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:48,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:48,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 306 [2023-11-17 16:21:48,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:49,532 INFO L124 PetriNetUnfolderBase]: 1126/1650 cut-off events. [2023-11-17 16:21:49,532 INFO L125 PetriNetUnfolderBase]: For 18098/18098 co-relation queries the response was YES. [2023-11-17 16:21:49,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10367 conditions, 1650 events. 1126/1650 cut-off events. For 18098/18098 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6541 event pairs, 123 based on Foata normal form. 18/1658 useless extension candidates. Maximal degree in co-relation 10321. Up to 685 conditions per place. [2023-11-17 16:21:49,544 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 181 selfloop transitions, 156 changer transitions 0/337 dead transitions. [2023-11-17 16:21:49,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 337 transitions, 3607 flow [2023-11-17 16:21:49,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 16:21:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 16:21:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2228 transitions. [2023-11-17 16:21:49,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36405228758169933 [2023-11-17 16:21:49,549 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2228 transitions. [2023-11-17 16:21:49,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2228 transitions. [2023-11-17 16:21:49,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:49,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2228 transitions. [2023-11-17 16:21:49,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 111.4) internal successors, (2228), 20 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:49,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:49,560 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:49,560 INFO L175 Difference]: Start difference. First operand has 158 places, 196 transitions, 1672 flow. Second operand 20 states and 2228 transitions. [2023-11-17 16:21:49,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 337 transitions, 3607 flow [2023-11-17 16:21:49,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 337 transitions, 3162 flow, removed 145 selfloop flow, removed 16 redundant places. [2023-11-17 16:21:49,614 INFO L231 Difference]: Finished difference. Result has 133 places, 240 transitions, 2422 flow [2023-11-17 16:21:49,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2422, PETRI_PLACES=133, PETRI_TRANSITIONS=240} [2023-11-17 16:21:49,615 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places. [2023-11-17 16:21:49,615 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 240 transitions, 2422 flow [2023-11-17 16:21:49,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 107.41176470588235) internal successors, (1826), 17 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:49,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:49,615 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:49,623 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 16:21:49,820 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 16:21:49,821 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:49,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash 467371565, now seen corresponding path program 11 times [2023-11-17 16:21:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:49,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866814592] [2023-11-17 16:21:49,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:49,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:21:49,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:49,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866814592] [2023-11-17 16:21:49,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866814592] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:49,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229231302] [2023-11-17 16:21:49,950 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:21:49,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:49,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:49,951 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 16:21:49,976 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 16:21:50,058 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-17 16:21:50,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:50,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:21:50,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:50,134 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 16:21:50,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:50,211 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 16:21:50,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229231302] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:50,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:50,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2023-11-17 16:21:50,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908087126] [2023-11-17 16:21:50,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:50,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-17 16:21:50,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:50,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-17 16:21:50,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-11-17 16:21:50,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 306 [2023-11-17 16:21:50,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 240 transitions, 2422 flow. Second operand has 17 states, 17 states have (on average 107.52941176470588) internal successors, (1828), 17 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:50,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:50,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 306 [2023-11-17 16:21:50,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:50,888 INFO L124 PetriNetUnfolderBase]: 1151/1693 cut-off events. [2023-11-17 16:21:50,889 INFO L125 PetriNetUnfolderBase]: For 15540/15540 co-relation queries the response was YES. [2023-11-17 16:21:50,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10461 conditions, 1693 events. 1151/1693 cut-off events. For 15540/15540 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6783 event pairs, 121 based on Foata normal form. 18/1701 useless extension candidates. Maximal degree in co-relation 10416. Up to 705 conditions per place. [2023-11-17 16:21:50,899 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 182 selfloop transitions, 166 changer transitions 0/348 dead transitions. [2023-11-17 16:21:50,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 348 transitions, 4081 flow [2023-11-17 16:21:50,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 16:21:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 16:21:50,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2221 transitions. [2023-11-17 16:21:50,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36290849673202613 [2023-11-17 16:21:50,902 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2221 transitions. [2023-11-17 16:21:50,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2221 transitions. [2023-11-17 16:21:50,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:50,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2221 transitions. [2023-11-17 16:21:50,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 111.05) internal successors, (2221), 20 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:50,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:50,911 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:50,911 INFO L175 Difference]: Start difference. First operand has 133 places, 240 transitions, 2422 flow. Second operand 20 states and 2221 transitions. [2023-11-17 16:21:50,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 348 transitions, 4081 flow [2023-11-17 16:21:50,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 348 transitions, 3915 flow, removed 39 selfloop flow, removed 6 redundant places. [2023-11-17 16:21:50,987 INFO L231 Difference]: Finished difference. Result has 155 places, 278 transitions, 3253 flow [2023-11-17 16:21:50,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=2266, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3253, PETRI_PLACES=155, PETRI_TRANSITIONS=278} [2023-11-17 16:21:50,988 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places. [2023-11-17 16:21:50,988 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 278 transitions, 3253 flow [2023-11-17 16:21:50,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 107.52941176470588) internal successors, (1828), 17 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:50,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:50,989 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:50,998 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 16:21:51,193 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 16:21:51,194 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:51,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1549398305, now seen corresponding path program 12 times [2023-11-17 16:21:51,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:51,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671959173] [2023-11-17 16:21:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:51,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:21:51,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:51,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671959173] [2023-11-17 16:21:51,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671959173] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:51,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080787302] [2023-11-17 16:21:51,299 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:21:51,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:51,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:51,301 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 16:21:51,308 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 16:21:51,405 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-17 16:21:51,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:51,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:21:51,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:21:51,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:21:51,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080787302] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:51,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:51,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-11-17 16:21:51,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014651538] [2023-11-17 16:21:51,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:51,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 16:21:51,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:51,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 16:21:51,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-11-17 16:21:51,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 306 [2023-11-17 16:21:51,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 278 transitions, 3253 flow. Second operand has 20 states, 20 states have (on average 110.95) internal successors, (2219), 20 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:51,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:51,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 306 [2023-11-17 16:21:51,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:52,276 INFO L124 PetriNetUnfolderBase]: 1807/2621 cut-off events. [2023-11-17 16:21:52,276 INFO L125 PetriNetUnfolderBase]: For 32253/32253 co-relation queries the response was YES. [2023-11-17 16:21:52,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18410 conditions, 2621 events. 1807/2621 cut-off events. For 32253/32253 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11049 event pairs, 251 based on Foata normal form. 18/2625 useless extension candidates. Maximal degree in co-relation 18357. Up to 1245 conditions per place. [2023-11-17 16:21:52,303 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 357 selfloop transitions, 152 changer transitions 0/509 dead transitions. [2023-11-17 16:21:52,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 509 transitions, 6626 flow [2023-11-17 16:21:52,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-17 16:21:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-17 16:21:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2233 transitions. [2023-11-17 16:21:52,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38407292741658067 [2023-11-17 16:21:52,307 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2233 transitions. [2023-11-17 16:21:52,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2233 transitions. [2023-11-17 16:21:52,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:52,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2233 transitions. [2023-11-17 16:21:52,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 117.52631578947368) internal successors, (2233), 19 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:52,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 306.0) internal successors, (6120), 20 states have internal predecessors, (6120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:52,316 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 306.0) internal successors, (6120), 20 states have internal predecessors, (6120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:52,316 INFO L175 Difference]: Start difference. First operand has 155 places, 278 transitions, 3253 flow. Second operand 19 states and 2233 transitions. [2023-11-17 16:21:52,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 509 transitions, 6626 flow [2023-11-17 16:21:52,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 509 transitions, 6354 flow, removed 100 selfloop flow, removed 7 redundant places. [2023-11-17 16:21:52,461 INFO L231 Difference]: Finished difference. Result has 169 places, 340 transitions, 4213 flow [2023-11-17 16:21:52,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=3031, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4213, PETRI_PLACES=169, PETRI_TRANSITIONS=340} [2023-11-17 16:21:52,461 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 139 predicate places. [2023-11-17 16:21:52,461 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 340 transitions, 4213 flow [2023-11-17 16:21:52,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 110.95) internal successors, (2219), 20 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:52,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:52,462 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:52,467 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 16:21:52,667 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 16:21:52,667 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:52,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:52,668 INFO L85 PathProgramCache]: Analyzing trace with hash -882861631, now seen corresponding path program 13 times [2023-11-17 16:21:52,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:52,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942604381] [2023-11-17 16:21:52,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:52,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:52,794 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 16:21:52,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:52,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942604381] [2023-11-17 16:21:52,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942604381] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:52,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947884818] [2023-11-17 16:21:52,794 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:21:52,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:52,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:52,795 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 16:21:52,802 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 16:21:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:52,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:21:52,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:53,005 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 16:21:53,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:53,101 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 16:21:53,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947884818] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:53,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:53,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-11-17 16:21:53,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416777166] [2023-11-17 16:21:53,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:53,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 16:21:53,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:53,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 16:21:53,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-11-17 16:21:53,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 306 [2023-11-17 16:21:53,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 340 transitions, 4213 flow. Second operand has 20 states, 20 states have (on average 111.25) internal successors, (2225), 20 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:53,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:53,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 306 [2023-11-17 16:21:53,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:53,717 INFO L124 PetriNetUnfolderBase]: 1849/2689 cut-off events. [2023-11-17 16:21:53,717 INFO L125 PetriNetUnfolderBase]: For 36122/36122 co-relation queries the response was YES. [2023-11-17 16:21:53,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19892 conditions, 2689 events. 1849/2689 cut-off events. For 36122/36122 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11446 event pairs, 470 based on Foata normal form. 18/2693 useless extension candidates. Maximal degree in co-relation 19838. Up to 1985 conditions per place. [2023-11-17 16:21:53,737 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 324 selfloop transitions, 150 changer transitions 0/474 dead transitions. [2023-11-17 16:21:53,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 474 transitions, 6539 flow [2023-11-17 16:21:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-17 16:21:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-17 16:21:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1750 transitions. [2023-11-17 16:21:53,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812636165577342 [2023-11-17 16:21:53,740 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1750 transitions. [2023-11-17 16:21:53,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1750 transitions. [2023-11-17 16:21:53,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:53,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1750 transitions. [2023-11-17 16:21:53,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 116.66666666666667) internal successors, (1750), 15 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:53,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 306.0) internal successors, (4896), 16 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:53,746 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 306.0) internal successors, (4896), 16 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:53,746 INFO L175 Difference]: Start difference. First operand has 169 places, 340 transitions, 4213 flow. Second operand 15 states and 1750 transitions. [2023-11-17 16:21:53,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 474 transitions, 6539 flow [2023-11-17 16:21:53,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 474 transitions, 6060 flow, removed 175 selfloop flow, removed 8 redundant places. [2023-11-17 16:21:53,879 INFO L231 Difference]: Finished difference. Result has 178 places, 376 transitions, 4714 flow [2023-11-17 16:21:53,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=3788, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4714, PETRI_PLACES=178, PETRI_TRANSITIONS=376} [2023-11-17 16:21:53,880 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 148 predicate places. [2023-11-17 16:21:53,880 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 376 transitions, 4714 flow [2023-11-17 16:21:53,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 111.25) internal successors, (2225), 20 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:53,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:53,881 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:53,889 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 16:21:54,086 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 16:21:54,086 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:54,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1457612465, now seen corresponding path program 14 times [2023-11-17 16:21:54,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:54,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357742264] [2023-11-17 16:21:54,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:54,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:54,214 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 16:21:54,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:54,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357742264] [2023-11-17 16:21:54,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357742264] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:54,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178258478] [2023-11-17 16:21:54,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:21:54,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:54,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:54,217 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 16:21:54,245 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 16:21:54,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:21:54,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:54,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:21:54,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:54,416 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 16:21:54,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:54,508 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 16:21:54,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178258478] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:54,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:54,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-11-17 16:21:54,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613713771] [2023-11-17 16:21:54,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:54,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 16:21:54,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:54,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 16:21:54,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-11-17 16:21:54,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 306 [2023-11-17 16:21:54,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 376 transitions, 4714 flow. Second operand has 21 states, 21 states have (on average 110.9047619047619) internal successors, (2329), 21 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:54,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:54,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 306 [2023-11-17 16:21:54,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:55,083 INFO L124 PetriNetUnfolderBase]: 1826/2646 cut-off events. [2023-11-17 16:21:55,084 INFO L125 PetriNetUnfolderBase]: For 29522/29522 co-relation queries the response was YES. [2023-11-17 16:21:55,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18356 conditions, 2646 events. 1826/2646 cut-off events. For 29522/29522 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 11158 event pairs, 472 based on Foata normal form. 16/2656 useless extension candidates. Maximal degree in co-relation 18301. Up to 1985 conditions per place. [2023-11-17 16:21:55,101 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 293 selfloop transitions, 145 changer transitions 0/438 dead transitions. [2023-11-17 16:21:55,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 438 transitions, 6061 flow [2023-11-17 16:21:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 16:21:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-17 16:21:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1394 transitions. [2023-11-17 16:21:55,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37962962962962965 [2023-11-17 16:21:55,103 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1394 transitions. [2023-11-17 16:21:55,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1394 transitions. [2023-11-17 16:21:55,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:55,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1394 transitions. [2023-11-17 16:21:55,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.16666666666667) internal successors, (1394), 12 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:55,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:55,108 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:55,108 INFO L175 Difference]: Start difference. First operand has 178 places, 376 transitions, 4714 flow. Second operand 12 states and 1394 transitions. [2023-11-17 16:21:55,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 438 transitions, 6061 flow [2023-11-17 16:21:55,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 438 transitions, 5748 flow, removed 124 selfloop flow, removed 10 redundant places. [2023-11-17 16:21:55,235 INFO L231 Difference]: Finished difference. Result has 178 places, 372 transitions, 4621 flow [2023-11-17 16:21:55,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=4331, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4621, PETRI_PLACES=178, PETRI_TRANSITIONS=372} [2023-11-17 16:21:55,235 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 148 predicate places. [2023-11-17 16:21:55,235 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 372 transitions, 4621 flow [2023-11-17 16:21:55,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 110.9047619047619) internal successors, (2329), 21 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:55,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:55,236 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:55,240 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 16:21:55,436 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 16:21:55,437 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:55,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:55,437 INFO L85 PathProgramCache]: Analyzing trace with hash -304298177, now seen corresponding path program 15 times [2023-11-17 16:21:55,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:55,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903912878] [2023-11-17 16:21:55,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:55,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:21:55,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:55,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903912878] [2023-11-17 16:21:55,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903912878] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:55,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317973927] [2023-11-17 16:21:55,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:21:55,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:55,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:55,541 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 16:21:55,566 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 16:21:55,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:21:55,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:55,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:21:55,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:21:55,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:21:55,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317973927] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:55,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:55,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-11-17 16:21:55,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013157301] [2023-11-17 16:21:55,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:55,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 16:21:55,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:55,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 16:21:55,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-11-17 16:21:55,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 306 [2023-11-17 16:21:55,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 372 transitions, 4621 flow. Second operand has 21 states, 21 states have (on average 111.0) internal successors, (2331), 21 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:55,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:55,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 306 [2023-11-17 16:21:55,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:56,482 INFO L124 PetriNetUnfolderBase]: 1849/2685 cut-off events. [2023-11-17 16:21:56,483 INFO L125 PetriNetUnfolderBase]: For 28191/28191 co-relation queries the response was YES. [2023-11-17 16:21:56,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18507 conditions, 2685 events. 1849/2685 cut-off events. For 28191/28191 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11463 event pairs, 251 based on Foata normal form. 16/2695 useless extension candidates. Maximal degree in co-relation 18456. Up to 1281 conditions per place. [2023-11-17 16:21:56,500 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 347 selfloop transitions, 172 changer transitions 0/519 dead transitions. [2023-11-17 16:21:56,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 519 transitions, 7058 flow [2023-11-17 16:21:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 16:21:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-17 16:21:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2000 transitions. [2023-11-17 16:21:56,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3844675124951942 [2023-11-17 16:21:56,503 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2000 transitions. [2023-11-17 16:21:56,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2000 transitions. [2023-11-17 16:21:56,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:56,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2000 transitions. [2023-11-17 16:21:56,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 117.6470588235294) internal successors, (2000), 17 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:56,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 306.0) internal successors, (5508), 18 states have internal predecessors, (5508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:56,514 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 306.0) internal successors, (5508), 18 states have internal predecessors, (5508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:56,515 INFO L175 Difference]: Start difference. First operand has 178 places, 372 transitions, 4621 flow. Second operand 17 states and 2000 transitions. [2023-11-17 16:21:56,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 519 transitions, 7058 flow [2023-11-17 16:21:56,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 519 transitions, 6754 flow, removed 0 selfloop flow, removed 11 redundant places. [2023-11-17 16:21:56,627 INFO L231 Difference]: Finished difference. Result has 184 places, 379 transitions, 4791 flow [2023-11-17 16:21:56,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=4331, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4791, PETRI_PLACES=184, PETRI_TRANSITIONS=379} [2023-11-17 16:21:56,628 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 154 predicate places. [2023-11-17 16:21:56,628 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 379 transitions, 4791 flow [2023-11-17 16:21:56,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 111.0) internal successors, (2331), 21 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:56,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:56,629 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:56,634 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 16:21:56,834 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 16:21:56,834 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:56,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:56,834 INFO L85 PathProgramCache]: Analyzing trace with hash 319829373, now seen corresponding path program 16 times [2023-11-17 16:21:56,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:56,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886577484] [2023-11-17 16:21:56,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:56,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:56,931 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 16:21:56,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886577484] [2023-11-17 16:21:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886577484] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007100195] [2023-11-17 16:21:56,932 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:21:56,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:56,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:56,937 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 16:21:56,963 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 16:21:57,039 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:21:57,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:57,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:21:57,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:57,098 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 16:21:57,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:57,163 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 16:21:57,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007100195] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:57,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:57,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2023-11-17 16:21:57,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973750553] [2023-11-17 16:21:57,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:57,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-17 16:21:57,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:57,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-17 16:21:57,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-11-17 16:21:57,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 306 [2023-11-17 16:21:57,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 379 transitions, 4791 flow. Second operand has 17 states, 17 states have (on average 107.52941176470588) internal successors, (1828), 17 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:57,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:57,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 306 [2023-11-17 16:21:57,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:57,928 INFO L124 PetriNetUnfolderBase]: 1860/2704 cut-off events. [2023-11-17 16:21:57,928 INFO L125 PetriNetUnfolderBase]: For 28370/28370 co-relation queries the response was YES. [2023-11-17 16:21:57,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18836 conditions, 2704 events. 1860/2704 cut-off events. For 28370/28370 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11563 event pairs, 139 based on Foata normal form. 16/2714 useless extension candidates. Maximal degree in co-relation 18784. Up to 1303 conditions per place. [2023-11-17 16:21:57,945 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 249 selfloop transitions, 259 changer transitions 0/508 dead transitions. [2023-11-17 16:21:57,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 508 transitions, 7076 flow [2023-11-17 16:21:57,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 16:21:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 16:21:57,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2235 transitions. [2023-11-17 16:21:57,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36519607843137253 [2023-11-17 16:21:57,947 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2235 transitions. [2023-11-17 16:21:57,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2235 transitions. [2023-11-17 16:21:57,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:57,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2235 transitions. [2023-11-17 16:21:57,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 111.75) internal successors, (2235), 20 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:57,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:57,955 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:57,955 INFO L175 Difference]: Start difference. First operand has 184 places, 379 transitions, 4791 flow. Second operand 20 states and 2235 transitions. [2023-11-17 16:21:57,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 508 transitions, 7076 flow [2023-11-17 16:21:58,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 508 transitions, 6760 flow, removed 0 selfloop flow, removed 15 redundant places. [2023-11-17 16:21:58,088 INFO L231 Difference]: Finished difference. Result has 187 places, 408 transitions, 5435 flow [2023-11-17 16:21:58,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=4422, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=5435, PETRI_PLACES=187, PETRI_TRANSITIONS=408} [2023-11-17 16:21:58,088 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2023-11-17 16:21:58,088 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 408 transitions, 5435 flow [2023-11-17 16:21:58,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 107.52941176470588) internal successors, (1828), 17 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:58,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:58,089 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:58,093 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 16:21:58,289 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 16:21:58,289 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:21:58,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash -921002320, now seen corresponding path program 2 times [2023-11-17 16:21:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:58,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555444195] [2023-11-17 16:21:58,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:58,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:21:59,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:59,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555444195] [2023-11-17 16:21:59,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555444195] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:59,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032846516] [2023-11-17 16:21:59,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:21:59,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:59,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:59,506 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 16:21:59,511 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 16:21:59,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:21:59,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:59,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-17 16:21:59,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:59,708 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 16:21:59,771 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 16:21:59,823 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 16:22:00,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:22:00,333 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 127 treesize of output 96 [2023-11-17 16:22:00,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:00,903 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 157 treesize of output 99 [2023-11-17 16:22:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:22:01,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:08,834 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse26 (+ c_~min3~0 1))) (let ((.cse21 (= c_~min2~0 c_~min1~0)) (.cse25 (= c_~min1~0 c_~min3~0)) (.cse6 (< c_~min3~0 c_~min2~0)) (.cse86 (< c_~min2~0 .cse26)) (.cse2 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse1 (select .cse5 c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (let ((.cse3 (+ .cse0 1))) (or (< .cse0 (+ (select .cse1 .cse2) 1)) (< c_~min2~0 .cse3) (< c_~min1~0 .cse3) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< .cse4 .cse0) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 (+ .cse4 1))))))))))) (or .cse6 (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse10 (select .cse9 c_~A~0.base))) (let ((.cse8 (select .cse10 .cse2)) (.cse7 (select .cse10 c_~A~0.offset))) (or (< .cse7 c_~min2~0) (< c_~min1~0 (+ .cse8 1)) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (= c_~min2~0 .cse8) (< (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< .cse7 c_~min1~0))))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse16 (select .cse15 c_~A~0.base))) (let ((.cse11 (select .cse16 c_~A~0.offset))) (let ((.cse12 (select .cse16 .cse2)) (.cse13 (+ .cse11 1))) (or (< .cse11 (+ .cse12 1)) (< c_~min2~0 .cse13) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 (+ .cse14 1)) (= .cse12 .cse14)))) (< c_~min1~0 .cse13))))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse18 (select .cse20 c_~A~0.base))) (let ((.cse17 (select .cse18 c_~A~0.offset))) (or (< .cse17 c_~min2~0) (< (select .cse18 .cse2) .cse17) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse19 (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) 1))) (or (< c_~min2~0 .cse19) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 .cse19)))) (< c_~min1~0 (+ .cse17 1))))))) (or (and .cse21 (<= c_~min2~0 c_~min3~0)) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse24 (select .cse23 c_~A~0.base))) (let ((.cse22 (select .cse24 c_~A~0.offset))) (or (< .cse22 c_~min2~0) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (select (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< (select .cse24 .cse2) c_~min1~0) (< .cse22 c_~min1~0)))))) (and .cse25 (<= .cse26 c_~min2~0))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse32 (select .cse31 c_~A~0.base))) (let ((.cse28 (select .cse32 .cse2)) (.cse27 (select .cse32 c_~A~0.offset))) (or (< .cse27 c_~min2~0) (< c_~min1~0 (+ .cse28 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (let ((.cse29 (+ .cse30 1))) (or (< c_~min2~0 .cse29) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 .cse29) (= .cse28 .cse30))))) (< .cse27 c_~min1~0)))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse37 (select .cse35 c_~A~0.base))) (let ((.cse36 (select .cse37 .cse2)) (.cse33 (select .cse37 c_~A~0.offset))) (or (< .cse33 c_~min2~0) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse34 (select (select (store .cse35 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (or (< .cse34 c_~min2~0) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 (+ .cse34 1))))) (< .cse33 (+ .cse36 1)) (= c_~min2~0 .cse36) (< c_~min1~0 (+ .cse33 1))))))) (or .cse21 (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse40 (select .cse41 c_~A~0.base))) (let ((.cse39 (select (select (store .cse41 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4)))) (.cse38 (select .cse40 c_~A~0.offset))) (or (< .cse38 c_~min2~0) (< .cse39 c_~min2~0) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< (select .cse40 .cse2) c_~min1~0) (< c_~min3~0 (+ .cse39 1)) (< .cse38 c_~min1~0))))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse47 (select .cse46 c_~A~0.base))) (let ((.cse43 (select .cse47 .cse2)) (.cse42 (select .cse47 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse42 1)) (< c_~min1~0 (+ .cse43 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse45 (select (select (store .cse46 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (let ((.cse44 (+ .cse45 1))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 .cse44) (= .cse43 .cse45) (< .cse42 .cse44))))) (< .cse42 c_~min1~0)))))) (or .cse21 (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse50 (select .cse51 c_~A~0.base))) (let ((.cse49 (select (select (store .cse51 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4)))) (.cse48 (select .cse50 c_~A~0.offset))) (or (< .cse48 c_~min2~0) (= c_~min1~0 .cse49) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< (select .cse50 .cse2) c_~min1~0) (< c_~min3~0 (+ .cse49 1)) (< .cse48 c_~min1~0))))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse58 (select .cse57 c_~A~0.base))) (let ((.cse52 (select .cse58 c_~A~0.offset))) (let ((.cse53 (select .cse58 .cse2)) (.cse54 (+ .cse52 1))) (or (< .cse52 (+ .cse53 1)) (< c_~min2~0 .cse54) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse56 (select (select (store .cse57 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (let ((.cse55 (+ .cse56 1))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 .cse55) (= .cse53 .cse56) (< .cse52 .cse55))))) (< c_~min1~0 .cse54))))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse63 (select .cse62 c_~A~0.base))) (let ((.cse60 (select .cse63 .cse2)) (.cse59 (select .cse63 c_~A~0.offset))) (or (< .cse59 c_~min2~0) (< c_~min1~0 (+ .cse60 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse61 (select (select (store .cse62 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 (+ .cse61 1)) (= .cse60 .cse61)))) (= c_~min2~0 .cse60) (< .cse59 c_~min1~0)))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse67 (select .cse66 c_~A~0.base))) (let ((.cse65 (select .cse67 c_~A~0.offset))) (let ((.cse64 (+ .cse65 1))) (or (< c_~min2~0 .cse64) (< .cse65 .cse26) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (select (select (store .cse66 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0))) (< (select .cse67 .cse2) .cse65) (< c_~min1~0 .cse64))))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int)) (or (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse70 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse71 (select .cse70 c_~A~0.base))) (let ((.cse69 (select .cse71 .cse2)) (.cse68 (select .cse71 c_~A~0.offset))) (or (< .cse68 c_~min2~0) (= .cse69 c_~min3~0) (< .cse68 (+ .cse69 1)) (= c_~min2~0 .cse69) (< (select (select (store .cse70 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) c_~min3~0) (< c_~min1~0 (+ .cse68 1))))))) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0))) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse75 (select .cse74 c_~A~0.base))) (let ((.cse73 (select .cse75 .cse2)) (.cse72 (select .cse75 c_~A~0.offset))) (or (< .cse72 c_~min2~0) (= .cse73 c_~min3~0) (< c_~min1~0 (+ .cse73 1)) (= c_~min2~0 .cse73) (< (select (select (store .cse74 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) c_~min3~0) (< .cse72 c_~min1~0)))))))) (or .cse25 (and (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int)) (or (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse77 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse78 (select .cse77 c_~A~0.base))) (let ((.cse76 (select .cse78 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse76 1)) (= c_~min1~0 .cse76) (< (select (select (store .cse77 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) c_~min3~0) (< (select .cse78 .cse2) c_~min1~0) (< .cse76 c_~min1~0)))))) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0))) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int)) (or (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse80 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse81 (select .cse80 c_~A~0.base))) (let ((.cse79 (select .cse81 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse79 1)) (< .cse79 .cse26) (< (select (select (store .cse80 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) c_~min3~0) (< (select .cse81 .cse2) c_~min1~0) (< .cse79 c_~min1~0)))))) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0))))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse85 (select .cse84 c_~A~0.base))) (let ((.cse83 (select .cse85 .cse2)) (.cse82 (select .cse85 c_~A~0.offset))) (or (< .cse82 c_~min2~0) (= .cse83 c_~min3~0) (< c_~min1~0 (+ .cse83 1)) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (select (select (store .cse84 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< .cse82 c_~min1~0)))))) .cse86) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse90 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse88 (select .cse90 c_~A~0.base))) (let ((.cse87 (select .cse88 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse87 1)) (< c_~min1~0 (+ (select .cse88 .cse2) 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse89 (select (select (store .cse90 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< .cse89 .cse87) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 (+ .cse89 1))))) (< .cse87 c_~min1~0)))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse94 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse95 (select .cse94 c_~A~0.base))) (let ((.cse91 (select .cse95 c_~A~0.offset))) (or (< .cse91 c_~min2~0) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse93 (select (select (store .cse94 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (let ((.cse92 (+ .cse93 1))) (or (< c_~min2~0 .cse92) (= c_~min1~0 .cse93) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 .cse92))))) (< (select .cse95 .cse2) c_~min1~0) (< .cse91 c_~min1~0)))))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse98 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse99 (select .cse98 c_~A~0.base))) (let ((.cse97 (select .cse99 .cse2)) (.cse96 (select .cse99 c_~A~0.offset))) (or (< .cse96 c_~min2~0) (= .cse97 c_~min3~0) (< .cse96 (+ .cse97 1)) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (select (select (store .cse98 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min1~0 (+ .cse96 1))))))) .cse86) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse103 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse104 (select .cse103 c_~A~0.base))) (let ((.cse100 (select .cse104 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse100 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse101 (select (select (store .cse103 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (let ((.cse102 (+ .cse101 1))) (or (= c_~min1~0 .cse101) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 .cse102) (< .cse100 .cse102))))) (< (select .cse104 .cse2) c_~min1~0) (< .cse100 c_~min1~0)))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int)) (or (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse106 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse107 (select .cse106 c_~A~0.base))) (let ((.cse105 (select .cse107 c_~A~0.offset))) (or (< .cse105 c_~min2~0) (< (select (select (store .cse106 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) c_~min3~0) (< (select .cse107 .cse2) .cse105) (= c_~min2~0 .cse105) (< c_~min1~0 (+ .cse105 1))))))) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse111 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse109 (select .cse111 c_~A~0.base))) (let ((.cse108 (select .cse109 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse108 1)) (= c_~min1~0 .cse108) (< (select .cse109 .cse2) c_~min1~0) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse110 (select (select (store .cse111 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< .cse110 .cse108) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 (+ .cse110 1))))) (< .cse108 c_~min1~0)))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse115 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse116 (select .cse115 c_~A~0.base))) (let ((.cse113 (select .cse116 .cse2)) (.cse112 (select .cse116 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse112 1)) (< c_~min1~0 (+ .cse113 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse114 (select (select (store .cse115 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 (+ .cse114 1)) (= .cse113 .cse114)))) (< .cse112 c_~min1~0)))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse121 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse122 (select .cse121 c_~A~0.base))) (let ((.cse118 (select .cse122 .cse2)) (.cse117 (select .cse122 c_~A~0.offset))) (or (< .cse117 c_~min2~0) (< .cse117 (+ .cse118 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse120 (select (select (store .cse121 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (let ((.cse119 (+ .cse120 1))) (or (< c_~min2~0 .cse119) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 .cse119) (= .cse118 .cse120))))) (< c_~min1~0 (+ .cse117 1))))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse125 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse126 (select .cse125 c_~A~0.base))) (let ((.cse123 (select .cse126 c_~A~0.offset))) (or (< .cse123 c_~min2~0) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse124 (select (select (store .cse125 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (or (< .cse124 c_~min2~0) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 (+ .cse124 1))))) (< (select .cse126 .cse2) .cse123) (= c_~min2~0 .cse123) (< c_~min1~0 (+ .cse123 1))))))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse129 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse130 (select .cse129 c_~A~0.base))) (let ((.cse128 (select .cse130 .cse2)) (.cse127 (select .cse130 c_~A~0.offset))) (or (< .cse127 c_~min2~0) (< .cse127 (+ .cse128 1)) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (= c_~min2~0 .cse128) (< (select (select (store .cse129 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min1~0 (+ .cse127 1))))))) .cse6) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse134 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse135 (select .cse134 c_~A~0.base))) (let ((.cse132 (select .cse135 .cse2)) (.cse131 (select .cse135 c_~A~0.offset))) (or (< .cse131 c_~min2~0) (< .cse131 (+ .cse132 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse133 (select (select (store .cse134 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 (+ .cse133 1)) (= .cse132 .cse133)))) (= c_~min2~0 .cse132) (< c_~min1~0 (+ .cse131 1))))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse139 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse137 (select .cse139 c_~A~0.base))) (let ((.cse136 (select .cse137 c_~A~0.offset))) (or (< .cse136 c_~min2~0) (< (select .cse137 .cse2) .cse136) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse138 (select (select (store .cse139 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 (+ .cse138 1)) (= .cse136 .cse138)))) (= c_~min2~0 .cse136) (< c_~min1~0 (+ .cse136 1))))))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse141 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse142 (select .cse141 c_~A~0.base))) (let ((.cse140 (select .cse142 c_~A~0.offset))) (or (< .cse140 c_~min2~0) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (select (select (store .cse141 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) c_~min3~0) (< (select .cse142 .cse2) .cse140) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min1~0 (+ .cse140 1))))))) .cse86) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse145 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse147 (select .cse145 c_~A~0.base))) (let ((.cse146 (select .cse147 .cse2)) (.cse143 (select .cse147 c_~A~0.offset))) (or (< .cse143 c_~min2~0) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse144 (select (select (store .cse145 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (or (< .cse144 c_~min2~0) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 (+ .cse144 1))))) (< c_~min1~0 (+ .cse146 1)) (= c_~min2~0 .cse146) (< .cse143 c_~min1~0)))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse150 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse151 (select .cse150 c_~A~0.base))) (let ((.cse148 (select .cse151 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse148 1)) (= c_~min1~0 .cse148) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse149 (select (select (store .cse150 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))))) (or (= c_~min1~0 .cse149) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 (+ .cse149 1))))) (< (select .cse151 .cse2) c_~min1~0) (< .cse148 c_~min1~0)))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse154 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse155 (select .cse154 c_~A~0.base))) (let ((.cse152 (select .cse155 .cse2)) (.cse153 (select .cse155 c_~A~0.offset))) (or (= .cse152 c_~min3~0) (< c_~min2~0 (+ .cse153 1)) (< c_~min1~0 (+ .cse152 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (select (select (store .cse154 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0))) (< .cse153 c_~min1~0)))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse159 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse160 (select .cse159 c_~A~0.base))) (let ((.cse157 (select .cse160 c_~A~0.offset))) (let ((.cse156 (select .cse160 .cse2)) (.cse158 (+ .cse157 1))) (or (= .cse156 c_~min3~0) (< .cse157 (+ .cse156 1)) (< c_~min2~0 .cse158) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (select (select (store .cse159 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0))) (< c_~min1~0 .cse158))))))) (forall ((v_ArrVal_696 (Array Int Int))) (let ((.cse164 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_696))) (let ((.cse165 (select .cse164 c_~A~0.base))) (let ((.cse163 (select .cse165 c_~A~0.offset))) (let ((.cse161 (+ .cse163 1))) (or (< c_~min2~0 .cse161) (forall ((v_thread3Thread1of1ForFork1_~i~2_113 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse162 (+ (select (select (store .cse164 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_697) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_113 4))) 1))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_113) (< (+ v_thread3Thread1of1ForFork1_~i~2_113 1) c_~N~0) (< c_~min3~0 .cse162) (< .cse163 .cse162)))) (< (select .cse165 .cse2) .cse163) (< c_~min1~0 .cse161)))))))))) is different from false [2023-11-17 16:22:13,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:13,237 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 140 treesize of output 92 [2023-11-17 16:22:13,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:13,261 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 1138 treesize of output 1078 [2023-11-17 16:22:13,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:13,291 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 181 treesize of output 178 [2023-11-17 16:22:13,304 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 152 treesize of output 124 [2023-11-17 16:22:13,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:13,325 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 181 treesize of output 159 [2023-11-17 16:22:14,294 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:14,295 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 164 treesize of output 1 [2023-11-17 16:22:14,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:14,310 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 111 treesize of output 75 [2023-11-17 16:22:14,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:14,339 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 669 treesize of output 639 [2023-11-17 16:22:14,356 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 159 treesize of output 131 [2023-11-17 16:22:14,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:14,376 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 146 treesize of output 147 [2023-11-17 16:22:14,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:14,397 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 157 treesize of output 143 [2023-11-17 16:22:14,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:14,775 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 198 treesize of output 126 [2023-11-17 16:22:14,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:14,795 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 7450 treesize of output 6722 [2023-11-17 16:22:14,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:14,836 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 218 treesize of output 202 [2023-11-17 16:22:14,851 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 287 treesize of output 231 [2023-11-17 16:22:14,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:14,874 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 217 treesize of output 169 [2023-11-17 16:22:15,480 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,481 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 217 treesize of output 1 [2023-11-17 16:22:15,487 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,488 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 231 treesize of output 1 [2023-11-17 16:22:15,495 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,496 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 181 treesize of output 1 [2023-11-17 16:22:15,512 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,513 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 223 treesize of output 1 [2023-11-17 16:22:15,525 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 1 [2023-11-17 16:22:15,536 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,536 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 140 treesize of output 1 [2023-11-17 16:22:15,544 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,545 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 138 treesize of output 1 [2023-11-17 16:22:15,556 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,556 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 172 treesize of output 1 [2023-11-17 16:22:15,567 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,567 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 199 treesize of output 1 [2023-11-17 16:22:15,577 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,578 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 135 treesize of output 1 [2023-11-17 16:22:15,589 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,589 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 167 treesize of output 1 [2023-11-17 16:22:15,602 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,602 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 146 treesize of output 1 [2023-11-17 16:22:15,610 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,611 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 160 treesize of output 1 [2023-11-17 16:22:15,619 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,620 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 146 treesize of output 1 [2023-11-17 16:22:15,630 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,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 164 treesize of output 1 [2023-11-17 16:22:15,641 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,642 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 191 treesize of output 1 [2023-11-17 16:22:15,650 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,650 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 195 treesize of output 1 [2023-11-17 16:22:15,661 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,662 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 196 treesize of output 1 [2023-11-17 16:22:15,671 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,671 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 175 treesize of output 1 [2023-11-17 16:22:15,684 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,685 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 140 treesize of output 1 [2023-11-17 16:22:15,695 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,696 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 164 treesize of output 1 [2023-11-17 16:22:15,707 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,707 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 166 treesize of output 1 [2023-11-17 16:22:15,719 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,719 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 205 treesize of output 1 [2023-11-17 16:22:15,731 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,731 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 199 treesize of output 1 [2023-11-17 16:22:15,742 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,743 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 196 treesize of output 1 [2023-11-17 16:22:15,751 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,752 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 207 treesize of output 1 [2023-11-17 16:22:15,761 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 1 [2023-11-17 16:22:15,773 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 1 [2023-11-17 16:22:15,782 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,782 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 172 treesize of output 1 [2023-11-17 16:22:15,792 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,792 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 195 treesize of output 1 [2023-11-17 16:22:15,801 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,801 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 174 treesize of output 1 [2023-11-17 16:22:15,810 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:22:15,810 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 255 treesize of output 1 [2023-11-17 16:22:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:22:15,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032846516] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:15,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:15,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 40 [2023-11-17 16:22:15,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725759992] [2023-11-17 16:22:15,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:15,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-17 16:22:15,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:15,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-17 16:22:15,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1467, Unknown=16, NotChecked=78, Total=1722 [2023-11-17 16:22:15,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 306 [2023-11-17 16:22:15,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 408 transitions, 5435 flow. Second operand has 42 states, 42 states have (on average 79.80952380952381) internal successors, (3352), 42 states have internal predecessors, (3352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:15,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:15,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 306 [2023-11-17 16:22:15,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:19,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:36,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:41,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:44,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:46,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:52,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:57,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:59,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:01,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:04,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:06,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:09,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:13,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:15,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:18,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:20,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:22,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:27,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:29,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:31,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:36,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:39,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:40,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:48,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:50,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:53,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:55,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:57,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:02,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:05,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:12,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:15,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:17,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:19,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:22,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:24,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:26,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:30,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:33,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:35,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:37,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:39,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:42,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:44,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:50,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:52,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:00,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:03,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:05,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:07,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:10,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:12,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:14,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:16,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:19,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:27,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:29,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:36,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:38,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:40,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:43,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:45,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:47,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:50,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:52,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:54,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:00,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:02,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:05,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:11,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:13,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:16,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:21,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:23,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:25,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:28,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:33,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:36,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:38,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:41,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:43,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:45,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:48,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:50,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:56,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:58,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:01,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:03,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:06,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:08,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:10,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:13,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:15,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:18,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:20,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:22,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:25,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:27,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:29,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:32,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:35,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:37,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:40,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:42,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:45,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:47,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:49,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:52,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:54,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:57,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:00,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:02,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:05,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:07,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:10,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:12,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:15,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:15,362 INFO L124 PetriNetUnfolderBase]: 3705/5447 cut-off events. [2023-11-17 16:28:15,362 INFO L125 PetriNetUnfolderBase]: For 66339/66339 co-relation queries the response was YES. [2023-11-17 16:28:15,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39989 conditions, 5447 events. 3705/5447 cut-off events. For 66339/66339 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 26972 event pairs, 234 based on Foata normal form. 3/5444 useless extension candidates. Maximal degree in co-relation 39938. Up to 3498 conditions per place. [2023-11-17 16:28:15,397 INFO L140 encePairwiseOnDemand]: 291/306 looper letters, 655 selfloop transitions, 425 changer transitions 7/1087 dead transitions. [2023-11-17 16:28:15,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 1087 transitions, 15500 flow [2023-11-17 16:28:15,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-17 16:28:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2023-11-17 16:28:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 4971 transitions. [2023-11-17 16:28:15,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28008789722785665 [2023-11-17 16:28:15,401 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 4971 transitions. [2023-11-17 16:28:15,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 4971 transitions. [2023-11-17 16:28:15,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:28:15,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 4971 transitions. [2023-11-17 16:28:15,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 85.70689655172414) internal successors, (4971), 58 states have internal predecessors, (4971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:28:15,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 306.0) internal successors, (18054), 59 states have internal predecessors, (18054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:28:15,421 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 306.0) internal successors, (18054), 59 states have internal predecessors, (18054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:28:15,421 INFO L175 Difference]: Start difference. First operand has 187 places, 408 transitions, 5435 flow. Second operand 58 states and 4971 transitions. [2023-11-17 16:28:15,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 1087 transitions, 15500 flow [2023-11-17 16:28:15,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 1087 transitions, 14942 flow, removed 81 selfloop flow, removed 8 redundant places. [2023-11-17 16:28:15,706 INFO L231 Difference]: Finished difference. Result has 269 places, 797 transitions, 12280 flow [2023-11-17 16:28:15,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=5222, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=12280, PETRI_PLACES=269, PETRI_TRANSITIONS=797} [2023-11-17 16:28:15,707 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 239 predicate places. [2023-11-17 16:28:15,707 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 797 transitions, 12280 flow [2023-11-17 16:28:15,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 79.80952380952381) internal successors, (3352), 42 states have internal predecessors, (3352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:28:15,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:28:15,707 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:28:15,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-11-17 16:28:15,908 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 16:28:15,908 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:28:15,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:28:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash 283755392, now seen corresponding path program 3 times [2023-11-17 16:28:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:28:15,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387268882] [2023-11-17 16:28:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:28:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:28:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:28:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:28:17,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:28:17,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387268882] [2023-11-17 16:28:17,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387268882] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:28:17,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021379022] [2023-11-17 16:28:17,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:28:17,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:28:17,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:28:17,235 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 16:28:17,237 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 16:28:17,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:28:17,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:28:17,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-17 16:28:17,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:28:17,486 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 16:28:17,541 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 16:28:17,607 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 16:28:17,671 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 16:28:18,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:18,464 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 146 treesize of output 82 [2023-11-17 16:28:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:28:18,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:28:27,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:27,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 94 [2023-11-17 16:28:27,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:27,086 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 2109 treesize of output 2021 [2023-11-17 16:28:27,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:27,107 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 249 treesize of output 201 [2023-11-17 16:28:27,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:27,229 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 241 treesize of output 229 [2023-11-17 16:28:27,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:27,237 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 229 treesize of output 205 [2023-11-17 16:28:27,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:27,315 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 150 treesize of output 102 [2023-11-17 16:28:27,336 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-17 16:28:27,337 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 1161 treesize of output 1113 [2023-11-17 16:28:27,371 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-17 16:28:27,371 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 515 treesize of output 487 [2023-11-17 16:28:27,388 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:28:27,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:27,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 237 [2023-11-17 16:28:27,422 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-17 16:28:27,422 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 461 treesize of output 397 [2023-11-17 16:28:28,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:28,906 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 145 treesize of output 97 [2023-11-17 16:28:28,922 INFO L349 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2023-11-17 16:28:28,923 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 450 treesize of output 427 [2023-11-17 16:28:28,947 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-17 16:28:28,947 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 408 treesize of output 344 [2023-11-17 16:28:28,967 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-17 16:28:28,967 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 344 treesize of output 312 [2023-11-17 16:28:28,988 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-17 16:28:28,989 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 163 treesize of output 147 [2023-11-17 16:28:29,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:29,210 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 153 treesize of output 105 [2023-11-17 16:28:29,230 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:28:29,230 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 1358 treesize of output 1302 [2023-11-17 16:28:29,298 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:28:29,298 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 654 treesize of output 578 [2023-11-17 16:28:29,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:28:29,324 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 260 [2023-11-17 16:28:29,351 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:28:29,351 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 295 treesize of output 259 [2023-11-17 16:28:29,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:29,628 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 153 treesize of output 105 [2023-11-17 16:28:29,647 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:28:29,648 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 1358 treesize of output 1302 [2023-11-17 16:28:29,697 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:28:29,698 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 670 treesize of output 594 [2023-11-17 16:28:29,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:28:29,735 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:28:29,736 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 268 [2023-11-17 16:28:29,768 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:28:29,768 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 303 treesize of output 267 [2023-11-17 16:28:30,091 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:30,091 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 150 treesize of output 1 [2023-11-17 16:28:30,100 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:30,100 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 157 treesize of output 1 [2023-11-17 16:28:30,108 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:30,108 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 211 treesize of output 1 [2023-11-17 16:28:30,117 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:30,117 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 183 treesize of output 1 [2023-11-17 16:28:30,125 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:30,125 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 180 treesize of output 1 [2023-11-17 16:28:30,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:30,133 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 153 treesize of output 105 [2023-11-17 16:28:30,155 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:28:30,156 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 2770 treesize of output 2654 [2023-11-17 16:28:30,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:28:30,201 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 292 [2023-11-17 16:28:30,225 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:28:30,225 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 618 treesize of output 542 [2023-11-17 16:28:30,266 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:28:30,267 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 287 treesize of output 251 [2023-11-17 16:28:30,543 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:30,543 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 214 treesize of output 1 [2023-11-17 16:28:30,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:30,553 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 119 treesize of output 83 [2023-11-17 16:28:30,572 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:28:30,572 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 493 treesize of output 475 [2023-11-17 16:28:30,612 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:28:30,612 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 535 treesize of output 511 [2023-11-17 16:28:30,642 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:28:30,642 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 507 treesize of output 455 [2023-11-17 16:28:30,675 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:28:30,675 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 231 treesize of output 221 [2023-11-17 16:28:30,682 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-17 16:28:31,081 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:31,081 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 215 treesize of output 1 [2023-11-17 16:28:31,091 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:31,091 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 123 treesize of output 1 [2023-11-17 16:28:31,108 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:31,108 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 123 treesize of output 1 [2023-11-17 16:28:31,121 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:31,122 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 188 treesize of output 1 [2023-11-17 16:28:31,133 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:31,133 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 116 treesize of output 1 [2023-11-17 16:28:31,144 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:31,145 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 184 treesize of output 1 [2023-11-17 16:28:31,155 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:31,155 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 187 treesize of output 1 [2023-11-17 16:28:31,165 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:31,165 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 151 treesize of output 1 [2023-11-17 16:28:31,175 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:31,175 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 149 treesize of output 1 [2023-11-17 16:28:31,187 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:28:31,188 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 184 treesize of output 1 [2023-11-17 16:28:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:28:31,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021379022] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:28:31,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:28:31,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 37 [2023-11-17 16:28:31,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180222061] [2023-11-17 16:28:31,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:28:31,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-17 16:28:31,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:28:31,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-17 16:28:31,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1314, Unknown=8, NotChecked=0, Total=1482 [2023-11-17 16:28:31,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 306 [2023-11-17 16:28:31,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 797 transitions, 12280 flow. Second operand has 39 states, 39 states have (on average 79.87179487179488) internal successors, (3115), 39 states have internal predecessors, (3115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:28:31,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:28:31,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 306 [2023-11-17 16:28:31,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:28:42,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:14,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:16,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:20,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:23,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:26,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:31,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:35,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:37,154 INFO L124 PetriNetUnfolderBase]: 5020/7463 cut-off events. [2023-11-17 16:29:37,154 INFO L125 PetriNetUnfolderBase]: For 117674/117674 co-relation queries the response was YES. [2023-11-17 16:29:37,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62073 conditions, 7463 events. 5020/7463 cut-off events. For 117674/117674 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 40094 event pairs, 553 based on Foata normal form. 3/7460 useless extension candidates. Maximal degree in co-relation 61989. Up to 5509 conditions per place. [2023-11-17 16:29:37,218 INFO L140 encePairwiseOnDemand]: 292/306 looper letters, 855 selfloop transitions, 488 changer transitions 5/1348 dead transitions. [2023-11-17 16:29:37,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 1348 transitions, 22666 flow [2023-11-17 16:29:37,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-17 16:29:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-11-17 16:29:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3074 transitions. [2023-11-17 16:29:37,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28702147525676935 [2023-11-17 16:29:37,224 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3074 transitions. [2023-11-17 16:29:37,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3074 transitions. [2023-11-17 16:29:37,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:29:37,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3074 transitions. [2023-11-17 16:29:37,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 87.82857142857142) internal successors, (3074), 35 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:29:37,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 306.0) internal successors, (11016), 36 states have internal predecessors, (11016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:29:37,236 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 306.0) internal successors, (11016), 36 states have internal predecessors, (11016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:29:37,236 INFO L175 Difference]: Start difference. First operand has 269 places, 797 transitions, 12280 flow. Second operand 35 states and 3074 transitions. [2023-11-17 16:29:37,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 1348 transitions, 22666 flow [2023-11-17 16:29:38,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 1348 transitions, 20874 flow, removed 894 selfloop flow, removed 2 redundant places. [2023-11-17 16:29:38,154 INFO L231 Difference]: Finished difference. Result has 318 places, 1067 transitions, 16763 flow [2023-11-17 16:29:38,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=10924, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=265, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=16763, PETRI_PLACES=318, PETRI_TRANSITIONS=1067} [2023-11-17 16:29:38,155 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 288 predicate places. [2023-11-17 16:29:38,155 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 1067 transitions, 16763 flow [2023-11-17 16:29:38,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 79.87179487179488) internal successors, (3115), 39 states have internal predecessors, (3115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:29:38,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:29:38,155 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:29:38,160 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 16:29:38,356 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 16:29:38,356 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:29:38,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:29:38,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1127789798, now seen corresponding path program 4 times [2023-11-17 16:29:38,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:29:38,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118751787] [2023-11-17 16:29:38,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:29:38,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:29:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:29:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:29:39,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:29:39,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118751787] [2023-11-17 16:29:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118751787] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:29:39,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150788951] [2023-11-17 16:29:39,794 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:29:39,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:29:39,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:29:39,795 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 16:29:39,796 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 16:29:39,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:29:39,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:29:39,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-17 16:29:39,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:29:41,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:29:41,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:29:41,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 188 treesize of output 176 [2023-11-17 16:29:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:29:41,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:29:43,715 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2023-11-17 16:29:43,716 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 557 treesize of output 269 [2023-11-17 16:29:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:29:49,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150788951] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:29:49,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:29:49,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 31 [2023-11-17 16:29:49,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089976643] [2023-11-17 16:29:49,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:29:49,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 16:29:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:29:49,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 16:29:49,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2023-11-17 16:29:49,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 306 [2023-11-17 16:29:49,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 1067 transitions, 16763 flow. Second operand has 33 states, 33 states have (on average 80.12121212121212) internal successors, (2644), 33 states have internal predecessors, (2644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:29:49,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:29:49,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 306 [2023-11-17 16:29:49,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:29:59,331 INFO L124 PetriNetUnfolderBase]: 5841/8691 cut-off events. [2023-11-17 16:29:59,331 INFO L125 PetriNetUnfolderBase]: For 169069/169069 co-relation queries the response was YES. [2023-11-17 16:29:59,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75162 conditions, 8691 events. 5841/8691 cut-off events. For 169069/169069 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 48049 event pairs, 594 based on Foata normal form. 2/8687 useless extension candidates. Maximal degree in co-relation 75060. Up to 5918 conditions per place. [2023-11-17 16:29:59,411 INFO L140 encePairwiseOnDemand]: 291/306 looper letters, 874 selfloop transitions, 652 changer transitions 2/1528 dead transitions. [2023-11-17 16:29:59,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 1528 transitions, 26144 flow [2023-11-17 16:29:59,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-17 16:29:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-11-17 16:29:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 3502 transitions. [2023-11-17 16:29:59,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2861111111111111 [2023-11-17 16:29:59,415 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 3502 transitions. [2023-11-17 16:29:59,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 3502 transitions. [2023-11-17 16:29:59,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:29:59,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 3502 transitions. [2023-11-17 16:29:59,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 87.55) internal successors, (3502), 40 states have internal predecessors, (3502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:29:59,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 306.0) internal successors, (12546), 41 states have internal predecessors, (12546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:29:59,428 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 306.0) internal successors, (12546), 41 states have internal predecessors, (12546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:29:59,428 INFO L175 Difference]: Start difference. First operand has 318 places, 1067 transitions, 16763 flow. Second operand 40 states and 3502 transitions. [2023-11-17 16:29:59,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 1528 transitions, 26144 flow [2023-11-17 16:30:00,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 1528 transitions, 24751 flow, removed 683 selfloop flow, removed 5 redundant places. [2023-11-17 16:30:00,671 INFO L231 Difference]: Finished difference. Result has 367 places, 1244 transitions, 20740 flow [2023-11-17 16:30:00,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=15592, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1067, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=495, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=20740, PETRI_PLACES=367, PETRI_TRANSITIONS=1244} [2023-11-17 16:30:00,672 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 337 predicate places. [2023-11-17 16:30:00,672 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 1244 transitions, 20740 flow [2023-11-17 16:30:00,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 80.12121212121212) internal successors, (2644), 33 states have internal predecessors, (2644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:30:00,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:30:00,673 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:30:00,678 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 16:30:00,874 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 16:30:00,874 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:30:00,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:30:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1565325058, now seen corresponding path program 5 times [2023-11-17 16:30:00,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:30:00,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745693443] [2023-11-17 16:30:00,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:30:00,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:30:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:30:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:30:02,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:30:02,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745693443] [2023-11-17 16:30:02,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745693443] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:30:02,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293426177] [2023-11-17 16:30:02,409 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:30:02,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:30:02,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:30:02,411 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 16:30:02,412 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 16:30:02,527 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-17 16:30:02,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:30:02,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-17 16:30:02,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:30:03,561 INFO L349 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2023-11-17 16:30:03,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 126 [2023-11-17 16:30:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:30:03,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:30:09,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:30:09,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 897 treesize of output 1529 Received shutdown request... [2023-11-17 16:30:15,399 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 16:30:15,404 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 16:30:15,504 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-17 16:30:15,512 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 16:30:15,710 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 16:30:15,711 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-144-5-3-5-3-5-3-5-2-1 context. [2023-11-17 16:30:15,712 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-17 16:30:15,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-17 16:30:15,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-17 16:30:15,713 INFO L445 BasicCegarLoop]: Path program histogram: [16, 5, 1, 1, 1, 1] [2023-11-17 16:30:15,716 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 16:30:15,717 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 16:30:15,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 04:30:15 BasicIcfg [2023-11-17 16:30:15,720 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 16:30:15,725 INFO L158 Benchmark]: Toolchain (without parser) took 539816.95ms. Allocated memory was 181.4MB in the beginning and 971.0MB in the end (delta: 789.6MB). Free memory was 121.4MB in the beginning and 313.8MB in the end (delta: -192.5MB). Peak memory consumption was 778.0MB. Max. memory is 8.0GB. [2023-11-17 16:30:15,726 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 16:30:15,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.18ms. Allocated memory is still 181.4MB. Free memory was 121.1MB in the beginning and 109.4MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 16:30:15,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.72ms. Allocated memory is still 181.4MB. Free memory was 109.4MB in the beginning and 107.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 16:30:15,727 INFO L158 Benchmark]: Boogie Preprocessor took 26.17ms. Allocated memory is still 181.4MB. Free memory was 107.4MB in the beginning and 105.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 16:30:15,727 INFO L158 Benchmark]: RCFGBuilder took 509.65ms. Allocated memory was 181.4MB in the beginning and 298.8MB in the end (delta: 117.4MB). Free memory was 105.6MB in the beginning and 259.6MB in the end (delta: -153.9MB). Peak memory consumption was 21.1MB. Max. memory is 8.0GB. [2023-11-17 16:30:15,728 INFO L158 Benchmark]: TraceAbstraction took 538970.10ms. Allocated memory was 298.8MB in the beginning and 971.0MB in the end (delta: 672.1MB). Free memory was 258.9MB in the beginning and 313.8MB in the end (delta: -54.9MB). Peak memory consumption was 796.8MB. Max. memory is 8.0GB. [2023-11-17 16:30:15,728 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.18ms. Allocated memory is still 181.4MB. Free memory was 121.1MB in the beginning and 109.4MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.72ms. Allocated memory is still 181.4MB. Free memory was 109.4MB in the beginning and 107.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.17ms. Allocated memory is still 181.4MB. Free memory was 107.4MB in the beginning and 105.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 509.65ms. Allocated memory was 181.4MB in the beginning and 298.8MB in the end (delta: 117.4MB). Free memory was 105.6MB in the beginning and 259.6MB in the end (delta: -153.9MB). Peak memory consumption was 21.1MB. Max. memory is 8.0GB. * TraceAbstraction took 538970.10ms. Allocated memory was 298.8MB in the beginning and 971.0MB in the end (delta: 672.1MB). Free memory was 258.9MB in the beginning and 313.8MB in the end (delta: -54.9MB). Peak memory consumption was 796.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 144 PlacesBefore, 30 PlacesAfterwards, 146 TransitionsBefore, 24 TransitionsAfterwards, 1728 CoEnabledTransitionPairs, 8 FixpointIterations, 81 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 146 TotalNumberOfCompositions, 1838 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1729, independent: 1709, independent conditional: 0, independent unconditional: 1709, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1153, independent: 1144, independent conditional: 0, independent unconditional: 1144, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1153, independent: 1144, independent conditional: 0, independent unconditional: 1144, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1729, independent: 565, independent conditional: 0, independent unconditional: 565, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 1153, unknown conditional: 0, unknown unconditional: 1153] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-144-5-3-5-3-5-3-5-2-1 context. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-144-5-3-5-3-5-3-5-2-1 context. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-144-5-3-5-3-5-3-5-2-1 context. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-144-5-3-5-3-5-3-5-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 185 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 538.8s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 454.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 328 mSolverCounterUnknown, 3295 SdHoareTripleChecker+Valid, 325.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3295 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 322.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 542 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 321 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20591 IncrementalHoareTripleChecker+Invalid, 21782 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 321 mSolverCounterUnsat, 0 mSDtfsCounter, 20591 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1398 GetRequests, 705 SyntacticMatches, 31 SemanticMatches, 662 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6873 ImplicationChecksByTransitivity, 128.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20740occurred in iteration=24, InterpolantAutomatonStates: 431, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 57.8s InterpolantComputationTime, 1081 NumberOfCodeBlocks, 1069 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1524 ConstructedInterpolants, 37 QuantifiedInterpolants, 60720 SizeOfPredicates, 170 NumberOfNonLiveVariables, 4473 ConjunctsInSsa, 394 ConjunctsInUnsatCore, 66 InterpolantComputations, 4 PerfectInterpolantSequences, 143/339 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