/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 12:17:38,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 12:17:38,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 12:17:38,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 12:17:38,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 12:17:38,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 12:17:38,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 12:17:38,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 12:17:38,606 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 12:17:38,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 12:17:38,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 12:17:38,611 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 12:17:38,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 12:17:38,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 12:17:38,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 12:17:38,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 12:17:38,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 12:17:38,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 12:17:38,613 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 12:17:38,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 12:17:38,614 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 12:17:38,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 12:17:38,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 12:17:38,615 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 12:17:38,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 12:17:38,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:17:38,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 12:17:38,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 12:17:38,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 12:17:38,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 12:17:38,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 12:17:38,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 12:17:38,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 12:17:38,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 12:17:38,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 12:17:38,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 12:17:38,879 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 12:17:38,884 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 12:17:38,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2023-11-17 12:17:40,098 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 12:17:40,263 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 12:17:40,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2023-11-17 12:17:40,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de3cf89da/514db563d9844931a8aba9cb3c6c5629/FLAG5b4e32d69 [2023-11-17 12:17:40,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de3cf89da/514db563d9844931a8aba9cb3c6c5629 [2023-11-17 12:17:40,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 12:17:40,287 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 12:17:40,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 12:17:40,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 12:17:40,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 12:17:40,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:17:40" (1/1) ... [2023-11-17 12:17:40,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614e55a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:17:40, skipping insertion in model container [2023-11-17 12:17:40,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:17:40" (1/1) ... [2023-11-17 12:17:40,325 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 12:17:40,477 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-min-max-inc.wvr.c[3070,3083] [2023-11-17 12:17:40,485 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:17:40,493 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 12:17:40,528 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-min-max-inc.wvr.c[3070,3083] [2023-11-17 12:17:40,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:17:40,538 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:17:40,538 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:17:40,544 INFO L206 MainTranslator]: Completed translation [2023-11-17 12:17:40,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:17:40 WrapperNode [2023-11-17 12:17:40,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 12:17:40,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 12:17:40,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 12:17:40,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 12:17:40,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:17:40" (1/1) ... [2023-11-17 12:17:40,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:17:40" (1/1) ... [2023-11-17 12:17:40,579 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2023-11-17 12:17:40,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 12:17:40,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 12:17:40,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 12:17:40,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 12:17:40,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:17:40" (1/1) ... [2023-11-17 12:17:40,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:17:40" (1/1) ... [2023-11-17 12:17:40,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:17:40" (1/1) ... [2023-11-17 12:17:40,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:17:40" (1/1) ... [2023-11-17 12:17:40,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:17:40" (1/1) ... [2023-11-17 12:17:40,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:17:40" (1/1) ... [2023-11-17 12:17:40,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:17:40" (1/1) ... [2023-11-17 12:17:40,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:17:40" (1/1) ... [2023-11-17 12:17:40,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 12:17:40,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 12:17:40,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 12:17:40,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 12:17:40,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:17:40" (1/1) ... [2023-11-17 12:17:40,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:17:40,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:17:40,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 12:17:40,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 12:17:40,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 12:17:40,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 12:17:40,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 12:17:40,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 12:17:40,687 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 12:17:40,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 12:17:40,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 12:17:40,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 12:17:40,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 12:17:40,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 12:17:40,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-17 12:17:40,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-17 12:17:40,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 12:17:40,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 12:17:40,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 12:17:40,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 12:17:40,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 12:17:40,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 12:17:40,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 12:17:40,690 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 12:17:40,827 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 12:17:40,829 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 12:17:41,139 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 12:17:41,370 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 12:17:41,371 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 12:17:41,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:17:41 BoogieIcfgContainer [2023-11-17 12:17:41,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 12:17:41,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 12:17:41,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 12:17:41,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 12:17:41,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:17:40" (1/3) ... [2023-11-17 12:17:41,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5023fdbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:17:41, skipping insertion in model container [2023-11-17 12:17:41,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:17:40" (2/3) ... [2023-11-17 12:17:41,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5023fdbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:17:41, skipping insertion in model container [2023-11-17 12:17:41,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:17:41" (3/3) ... [2023-11-17 12:17:41,382 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2023-11-17 12:17:41,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 12:17:41,398 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 12:17:41,398 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 12:17:41,465 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-17 12:17:41,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 126 flow [2023-11-17 12:17:41,552 INFO L124 PetriNetUnfolderBase]: 4/45 cut-off events. [2023-11-17 12:17:41,552 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 12:17:41,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 45 events. 4/45 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 84 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-17 12:17:41,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 49 transitions, 126 flow [2023-11-17 12:17:41,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 44 transitions, 112 flow [2023-11-17 12:17:41,568 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 12:17:41,582 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 44 transitions, 112 flow [2023-11-17 12:17:41,584 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 44 transitions, 112 flow [2023-11-17 12:17:41,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 112 flow [2023-11-17 12:17:41,620 INFO L124 PetriNetUnfolderBase]: 4/44 cut-off events. [2023-11-17 12:17:41,620 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 12:17:41,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 44 events. 4/44 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 83 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-17 12:17:41,622 INFO L119 LiptonReduction]: Number of co-enabled transitions 750 [2023-11-17 12:17:42,341 INFO L134 LiptonReduction]: Checked pairs total: 1170 [2023-11-17 12:17:42,341 INFO L136 LiptonReduction]: Total number of compositions: 13 [2023-11-17 12:17:42,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 12:17:42,367 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;@6bb4e57e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:17:42,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 12:17:42,381 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 12:17:42,381 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2023-11-17 12:17:42,381 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 12:17:42,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:17:42,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:17:42,383 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 2 more)] === [2023-11-17 12:17:42,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:17:42,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1980727026, now seen corresponding path program 1 times [2023-11-17 12:17:42,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:17:42,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167200233] [2023-11-17 12:17:42,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:17:42,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:17:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:17:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:17:42,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:17:42,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167200233] [2023-11-17 12:17:42,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167200233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:17:42,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:17:42,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:17:42,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277050048] [2023-11-17 12:17:42,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:17:42,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:17:42,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:17:42,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:17:42,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:17:42,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 62 [2023-11-17 12:17:42,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:42,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:17:42,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 62 [2023-11-17 12:17:42,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:17:43,256 INFO L124 PetriNetUnfolderBase]: 1312/1790 cut-off events. [2023-11-17 12:17:43,257 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2023-11-17 12:17:43,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3791 conditions, 1790 events. 1312/1790 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5907 event pairs, 787 based on Foata normal form. 0/1455 useless extension candidates. Maximal degree in co-relation 3330. Up to 1474 conditions per place. [2023-11-17 12:17:43,273 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 44 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2023-11-17 12:17:43,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 221 flow [2023-11-17 12:17:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:17:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:17:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2023-11-17 12:17:43,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2023-11-17 12:17:43,287 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 96 transitions. [2023-11-17 12:17:43,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 96 transitions. [2023-11-17 12:17:43,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:17:43,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 96 transitions. [2023-11-17 12:17:43,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:43,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:43,298 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:43,300 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 96 transitions. [2023-11-17 12:17:43,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 221 flow [2023-11-17 12:17:43,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 199 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-17 12:17:43,310 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-11-17 12:17:43,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-11-17 12:17:43,316 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-11-17 12:17:43,316 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-11-17 12:17:43,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:43,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:17:43,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:17:43,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 12:17:43,317 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 2 more)] === [2023-11-17 12:17:43,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:17:43,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1360453289, now seen corresponding path program 1 times [2023-11-17 12:17:43,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:17:43,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760143493] [2023-11-17 12:17:43,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:17:43,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:17:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:17:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:17:43,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:17:43,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760143493] [2023-11-17 12:17:43,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760143493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:17:43,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:17:43,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:17:43,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763335303] [2023-11-17 12:17:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:17:43,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:17:43,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:17:43,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:17:43,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:17:43,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 62 [2023-11-17 12:17:43,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:43,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:17:43,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 62 [2023-11-17 12:17:43,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:17:43,779 INFO L124 PetriNetUnfolderBase]: 1632/2222 cut-off events. [2023-11-17 12:17:43,779 INFO L125 PetriNetUnfolderBase]: For 515/515 co-relation queries the response was YES. [2023-11-17 12:17:43,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5065 conditions, 2222 events. 1632/2222 cut-off events. For 515/515 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7645 event pairs, 977 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 1796. Up to 1790 conditions per place. [2023-11-17 12:17:43,822 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 46 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2023-11-17 12:17:43,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 229 flow [2023-11-17 12:17:43,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:17:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:17:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2023-11-17 12:17:43,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2023-11-17 12:17:43,827 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 96 transitions. [2023-11-17 12:17:43,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 96 transitions. [2023-11-17 12:17:43,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:17:43,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 96 transitions. [2023-11-17 12:17:43,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:43,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:43,831 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:43,831 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 96 transitions. [2023-11-17 12:17:43,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 229 flow [2023-11-17 12:17:43,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 219 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 12:17:43,834 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-11-17 12:17:43,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-11-17 12:17:43,835 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-11-17 12:17:43,836 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-11-17 12:17:43,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:43,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:17:43,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:17:43,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 12:17:43,844 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 2 more)] === [2023-11-17 12:17:43,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:17:43,844 INFO L85 PathProgramCache]: Analyzing trace with hash 543140395, now seen corresponding path program 1 times [2023-11-17 12:17:43,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:17:43,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577494197] [2023-11-17 12:17:43,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:17:43,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:17:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:17:43,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:17:43,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:17:43,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577494197] [2023-11-17 12:17:43,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577494197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:17:43,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:17:43,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:17:43,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960210177] [2023-11-17 12:17:43,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:17:43,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:17:43,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:17:43,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:17:43,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:17:43,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 62 [2023-11-17 12:17:43,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:43,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:17:43,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 62 [2023-11-17 12:17:43,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:17:44,325 INFO L124 PetriNetUnfolderBase]: 2138/2902 cut-off events. [2023-11-17 12:17:44,326 INFO L125 PetriNetUnfolderBase]: For 964/964 co-relation queries the response was YES. [2023-11-17 12:17:44,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7067 conditions, 2902 events. 2138/2902 cut-off events. For 964/964 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10519 event pairs, 1243 based on Foata normal form. 0/2449 useless extension candidates. Maximal degree in co-relation 2239. Up to 2222 conditions per place. [2023-11-17 12:17:44,341 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 49 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-11-17 12:17:44,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 253 flow [2023-11-17 12:17:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:17:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:17:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2023-11-17 12:17:44,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906 [2023-11-17 12:17:44,343 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 101 transitions. [2023-11-17 12:17:44,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 101 transitions. [2023-11-17 12:17:44,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:17:44,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 101 transitions. [2023-11-17 12:17:44,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:44,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:44,345 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:44,345 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 101 transitions. [2023-11-17 12:17:44,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 253 flow [2023-11-17 12:17:44,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 243 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 12:17:44,348 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-11-17 12:17:44,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-11-17 12:17:44,349 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-17 12:17:44,349 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-11-17 12:17:44,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:44,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:17:44,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:17:44,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 12:17:44,350 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 2 more)] === [2023-11-17 12:17:44,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:17:44,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1265999243, now seen corresponding path program 1 times [2023-11-17 12:17:44,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:17:44,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129373453] [2023-11-17 12:17:44,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:17:44,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:17:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:17:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:17:44,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:17:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129373453] [2023-11-17 12:17:44,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129373453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:17:44,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:17:44,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:17:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011694235] [2023-11-17 12:17:44,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:17:44,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:17:44,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:17:44,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:17:44,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:17:44,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2023-11-17 12:17:44,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:44,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:17:44,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2023-11-17 12:17:44,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:17:44,797 INFO L124 PetriNetUnfolderBase]: 2138/2903 cut-off events. [2023-11-17 12:17:44,797 INFO L125 PetriNetUnfolderBase]: For 1301/1301 co-relation queries the response was YES. [2023-11-17 12:17:44,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7648 conditions, 2903 events. 2138/2903 cut-off events. For 1301/1301 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10167 event pairs, 1685 based on Foata normal form. 0/2450 useless extension candidates. Maximal degree in co-relation 2581. Up to 2903 conditions per place. [2023-11-17 12:17:44,818 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 33 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-11-17 12:17:44,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 172 flow [2023-11-17 12:17:44,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:17:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:17:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2023-11-17 12:17:44,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2023-11-17 12:17:44,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 81 transitions. [2023-11-17 12:17:44,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 81 transitions. [2023-11-17 12:17:44,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:17:44,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 81 transitions. [2023-11-17 12:17:44,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:44,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:44,823 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:44,823 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 81 transitions. [2023-11-17 12:17:44,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 172 flow [2023-11-17 12:17:44,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 166 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 12:17:44,827 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-11-17 12:17:44,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-11-17 12:17:44,829 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-11-17 12:17:44,829 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-11-17 12:17:44,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:44,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:17:44,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:17:44,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 12:17:44,830 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 2 more)] === [2023-11-17 12:17:44,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:17:44,830 INFO L85 PathProgramCache]: Analyzing trace with hash -835635148, now seen corresponding path program 1 times [2023-11-17 12:17:44,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:17:44,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372037959] [2023-11-17 12:17:44,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:17:44,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:17:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:17:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:17:45,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:17:45,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372037959] [2023-11-17 12:17:45,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372037959] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:17:45,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597741628] [2023-11-17 12:17:45,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:17:45,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:17:45,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:17:45,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:17:45,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-17 12:17:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:17:45,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 12:17:45,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:17:45,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:17:45,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:17:45,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:17:45,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-17 12:17:45,953 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 15 treesize of output 7 [2023-11-17 12:17:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:17:45,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:17:46,784 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~min~0 1)) (.cse2 (+ (* c_thread1Thread1of1ForFork3_~i~0 4) c_~A~0.offset))) (and (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (or (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ 2 .cse0))))) (< (select (select .cse1 c_~A~0.base) .cse2) .cse3)))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (let ((.cse4 (select .cse6 c_~A~0.base))) (or (< (select .cse4 .cse2) .cse3) (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< (select .cse4 c_~A~0.offset) (+ .cse5 1)) (< c_~min~0 (+ .cse5 3)) (< 2147483645 .cse5)))))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (let ((.cse7 (select .cse10 c_~A~0.base))) (let ((.cse9 (select .cse7 .cse2))) (or (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse8 (select (select (store .cse10 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< (select .cse7 c_~A~0.offset) (+ .cse8 1)) (< .cse9 (+ .cse8 3)) (< 2147483645 .cse8)))) (< c_~min~0 .cse9)))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (let ((.cse11 (select (select .cse13 c_~A~0.base) .cse2))) (or (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< .cse11 (+ 2 .cse12)) (< 2147483646 .cse12)))) (< c_~min~0 .cse11))))))) is different from false [2023-11-17 12:17:46,861 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~min~0 1))) (and (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (let ((.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< .cse0 (+ .cse1 3)) (< 2147483645 .cse1)))) (< c_~min~0 .cse0))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (let ((.cse3 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< .cse3 (+ 2 .cse4)) (< 2147483646 .cse4)))) (< c_~min~0 .cse3))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (or (< (select (select .cse6 c_~A~0.base) c_~A~0.offset) .cse7) (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse8 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ .cse8 3)) (< 2147483645 .cse8))))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119))) (or (< (select (select .cse9 c_~A~0.base) c_~A~0.offset) .cse7) (forall ((v_ArrVal_120 (Array Int Int))) (let ((.cse10 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_120) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse10) (< c_~min~0 (+ 2 .cse10)))))))))) is different from false [2023-11-17 12:17:46,967 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 1221 treesize of output 1097 [2023-11-17 12:17:47,001 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 211 treesize of output 203 [2023-11-17 12:17:47,008 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 203 treesize of output 199 [2023-11-17 12:17:47,015 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 199 treesize of output 193 [2023-11-17 12:17:47,023 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 193 treesize of output 185 [2023-11-17 12:17:47,030 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 185 treesize of output 181 [2023-11-17 12:17:47,037 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 181 treesize of output 179 [2023-11-17 12:17:47,044 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 179 treesize of output 177 [2023-11-17 12:17:47,051 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 177 treesize of output 173 [2023-11-17 12:17:47,055 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-17 12:17:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:17:49,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597741628] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:17:49,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:17:49,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 28 [2023-11-17 12:17:49,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515947673] [2023-11-17 12:17:49,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:17:49,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-17 12:17:49,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:17:49,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-17 12:17:49,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=639, Unknown=9, NotChecked=106, Total=870 [2023-11-17 12:17:49,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2023-11-17 12:17:49,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 30 states, 30 states have (on average 14.1) internal successors, (423), 30 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:49,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:17:49,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2023-11-17 12:17:49,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:17:56,191 INFO L124 PetriNetUnfolderBase]: 17980/24717 cut-off events. [2023-11-17 12:17:56,192 INFO L125 PetriNetUnfolderBase]: For 6867/6867 co-relation queries the response was YES. [2023-11-17 12:17:56,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64030 conditions, 24717 events. 17980/24717 cut-off events. For 6867/6867 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 135608 event pairs, 1118 based on Foata normal form. 14/19455 useless extension candidates. Maximal degree in co-relation 64016. Up to 5303 conditions per place. [2023-11-17 12:17:56,324 INFO L140 encePairwiseOnDemand]: 49/62 looper letters, 352 selfloop transitions, 102 changer transitions 431/885 dead transitions. [2023-11-17 12:17:56,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 885 transitions, 4417 flow [2023-11-17 12:17:56,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-11-17 12:17:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-11-17 12:17:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 1369 transitions. [2023-11-17 12:17:56,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43295382669196714 [2023-11-17 12:17:56,330 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 1369 transitions. [2023-11-17 12:17:56,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 1369 transitions. [2023-11-17 12:17:56,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:17:56,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 1369 transitions. [2023-11-17 12:17:56,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 26.84313725490196) internal successors, (1369), 51 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:56,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 62.0) internal successors, (3224), 52 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:56,341 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 62.0) internal successors, (3224), 52 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:56,342 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 51 states and 1369 transitions. [2023-11-17 12:17:56,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 885 transitions, 4417 flow [2023-11-17 12:17:56,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 885 transitions, 4413 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 12:17:56,470 INFO L231 Difference]: Finished difference. Result has 137 places, 150 transitions, 1123 flow [2023-11-17 12:17:56,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=1123, PETRI_PLACES=137, PETRI_TRANSITIONS=150} [2023-11-17 12:17:56,472 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 97 predicate places. [2023-11-17 12:17:56,472 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 150 transitions, 1123 flow [2023-11-17 12:17:56,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 14.1) internal successors, (423), 30 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:56,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:17:56,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:17:56,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-17 12:17:56,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:17:56,679 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 2 more)] === [2023-11-17 12:17:56,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:17:56,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1641153900, now seen corresponding path program 2 times [2023-11-17 12:17:56,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:17:56,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141930952] [2023-11-17 12:17:56,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:17:56,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:17:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:17:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 12:17:56,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:17:56,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141930952] [2023-11-17 12:17:56,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141930952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:17:56,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:17:56,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:17:56,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385159899] [2023-11-17 12:17:56,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:17:56,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:17:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:17:56,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:17:56,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:17:56,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2023-11-17 12:17:56,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 150 transitions, 1123 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:56,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:17:56,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2023-11-17 12:17:56,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:17:59,768 INFO L124 PetriNetUnfolderBase]: 15268/21169 cut-off events. [2023-11-17 12:17:59,768 INFO L125 PetriNetUnfolderBase]: For 493983/493983 co-relation queries the response was YES. [2023-11-17 12:17:59,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136423 conditions, 21169 events. 15268/21169 cut-off events. For 493983/493983 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 115163 event pairs, 2400 based on Foata normal form. 14/21183 useless extension candidates. Maximal degree in co-relation 136356. Up to 12647 conditions per place. [2023-11-17 12:17:59,979 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 132 selfloop transitions, 6 changer transitions 253/391 dead transitions. [2023-11-17 12:17:59,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 391 transitions, 3781 flow [2023-11-17 12:17:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:17:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:17:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2023-11-17 12:17:59,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47096774193548385 [2023-11-17 12:17:59,980 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 146 transitions. [2023-11-17 12:17:59,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 146 transitions. [2023-11-17 12:17:59,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:17:59,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 146 transitions. [2023-11-17 12:17:59,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:59,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:59,982 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:17:59,982 INFO L175 Difference]: Start difference. First operand has 137 places, 150 transitions, 1123 flow. Second operand 5 states and 146 transitions. [2023-11-17 12:17:59,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 391 transitions, 3781 flow [2023-11-17 12:18:02,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 391 transitions, 3546 flow, removed 116 selfloop flow, removed 23 redundant places. [2023-11-17 12:18:02,758 INFO L231 Difference]: Finished difference. Result has 96 places, 102 transitions, 712 flow [2023-11-17 12:18:02,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=712, PETRI_PLACES=96, PETRI_TRANSITIONS=102} [2023-11-17 12:18:02,759 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 56 predicate places. [2023-11-17 12:18:02,759 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 102 transitions, 712 flow [2023-11-17 12:18:02,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:02,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:18:02,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:18:02,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 12:18:02,760 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 2 more)] === [2023-11-17 12:18:02,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:18:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1935161666, now seen corresponding path program 3 times [2023-11-17 12:18:02,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:18:02,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402338112] [2023-11-17 12:18:02,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:18:02,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:18:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:18:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:18:03,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:18:03,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402338112] [2023-11-17 12:18:03,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402338112] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:18:03,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928654369] [2023-11-17 12:18:03,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:18:03,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:18:03,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:18:03,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:18:03,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 12:18:03,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 12:18:03,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:18:03,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-17 12:18:03,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:18:03,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:18:03,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:18:03,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:18:03,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:18:03,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-17 12:18:04,060 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 17 treesize of output 9 [2023-11-17 12:18:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:18:04,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:18:06,471 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_188 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_187) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_188) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 3 .cse0)) (< 2147483645 .cse0)))) is different from false [2023-11-17 12:18:06,753 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 113 treesize of output 97 [2023-11-17 12:18:06,759 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 93 treesize of output 85 [2023-11-17 12:18:06,764 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 49 treesize of output 45 [2023-11-17 12:18:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:18:06,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928654369] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:18:06,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:18:06,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 32 [2023-11-17 12:18:06,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150904776] [2023-11-17 12:18:06,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:18:06,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-17 12:18:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:18:06,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-17 12:18:06,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=857, Unknown=12, NotChecked=62, Total=1122 [2023-11-17 12:18:06,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2023-11-17 12:18:06,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 102 transitions, 712 flow. Second operand has 34 states, 34 states have (on average 12.647058823529411) internal successors, (430), 34 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:06,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:18:06,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2023-11-17 12:18:06,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:18:13,989 INFO L124 PetriNetUnfolderBase]: 23236/31933 cut-off events. [2023-11-17 12:18:13,989 INFO L125 PetriNetUnfolderBase]: For 573182/573182 co-relation queries the response was YES. [2023-11-17 12:18:14,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198151 conditions, 31933 events. 23236/31933 cut-off events. For 573182/573182 co-relation queries the response was YES. Maximal size of possible extension queue 1118. Compared 180401 event pairs, 1360 based on Foata normal form. 16/31949 useless extension candidates. Maximal degree in co-relation 198103. Up to 9472 conditions per place. [2023-11-17 12:18:14,247 INFO L140 encePairwiseOnDemand]: 49/62 looper letters, 440 selfloop transitions, 97 changer transitions 365/902 dead transitions. [2023-11-17 12:18:14,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 902 transitions, 8894 flow [2023-11-17 12:18:14,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-17 12:18:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-17 12:18:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 1028 transitions. [2023-11-17 12:18:14,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39477726574500765 [2023-11-17 12:18:14,252 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 1028 transitions. [2023-11-17 12:18:14,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 1028 transitions. [2023-11-17 12:18:14,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:18:14,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 1028 transitions. [2023-11-17 12:18:14,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 24.476190476190474) internal successors, (1028), 42 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:14,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 62.0) internal successors, (2666), 43 states have internal predecessors, (2666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:14,259 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 62.0) internal successors, (2666), 43 states have internal predecessors, (2666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:14,259 INFO L175 Difference]: Start difference. First operand has 96 places, 102 transitions, 712 flow. Second operand 42 states and 1028 transitions. [2023-11-17 12:18:14,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 902 transitions, 8894 flow [2023-11-17 12:18:15,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 902 transitions, 7732 flow, removed 545 selfloop flow, removed 12 redundant places. [2023-11-17 12:18:15,864 INFO L231 Difference]: Finished difference. Result has 136 places, 169 transitions, 1531 flow [2023-11-17 12:18:15,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=1531, PETRI_PLACES=136, PETRI_TRANSITIONS=169} [2023-11-17 12:18:15,864 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 96 predicate places. [2023-11-17 12:18:15,865 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 169 transitions, 1531 flow [2023-11-17 12:18:15,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 12.647058823529411) internal successors, (430), 34 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:15,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:18:15,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:18:15,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-17 12:18:16,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-17 12:18:16,066 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 2 more)] === [2023-11-17 12:18:16,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:18:16,067 INFO L85 PathProgramCache]: Analyzing trace with hash -822208374, now seen corresponding path program 4 times [2023-11-17 12:18:16,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:18:16,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149315227] [2023-11-17 12:18:16,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:18:16,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:18:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:18:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:18:16,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:18:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149315227] [2023-11-17 12:18:16,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149315227] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:18:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406330060] [2023-11-17 12:18:16,514 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:18:16,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:18:16,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:18:16,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:18:16,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 12:18:16,624 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:18:16,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:18:16,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 12:18:16,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:18:16,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 12:18:16,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:18:16,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:18:16,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:18:16,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:18:16,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-17 12:18:17,003 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:18:17,003 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-11-17 12:18:17,010 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 15 treesize of output 7 [2023-11-17 12:18:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:18:17,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:18:17,321 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_239) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ 2 .cse0))))) (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_239) c_~A~0.base) c_~A~0.offset))) (or (< (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse1 1)) (< 2147483645 .cse1) (< c_~min~0 (+ 3 .cse1)))))) is different from false [2023-11-17 12:18:17,357 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_239 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_239) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 3 .cse0)) (< (select (select .cse1 c_~A~0.base) c_~A~0.offset) (+ .cse0 1)) (< 2147483645 .cse0))))) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_239 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_239) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse2)) (< 2147483646 .cse2))))) is different from false [2023-11-17 12:18:17,658 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_239 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_239) c_~A~0.base) c_~A~0.offset))) (or (< .cse0 (+ 2 .cse1)) (< 2147483646 .cse1)))) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_239 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238))) (let ((.cse3 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_239) c_~A~0.base) c_~A~0.offset))) (or (< (select (select .cse2 c_~A~0.base) c_~A~0.offset) (+ .cse3 1)) (< 2147483645 .cse3) (< .cse0 (+ 3 .cse3)))))))) is different from false [2023-11-17 12:18:17,700 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (v_ArrVal_239 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_237))) (let ((.cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_239) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 2 .cse1)) (< 2147483646 .cse1))))) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int)) (v_ArrVal_239 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_237))) (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_239) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ 3 .cse3)) (< 2147483645 .cse3) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse3 1)))))))) is different from false [2023-11-17 12:18:17,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:18:17,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 82 [2023-11-17 12:18:17,720 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 1948 treesize of output 1796 [2023-11-17 12:18:17,750 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 61 treesize of output 55 [2023-11-17 12:18:17,756 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 160 treesize of output 136 [2023-11-17 12:18:17,763 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 46 treesize of output 42 [2023-11-17 12:18:17,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:18:17,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2023-11-17 12:18:17,800 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:18:17,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 383 treesize of output 343 [2023-11-17 12:18:17,809 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 45 treesize of output 37 [2023-11-17 12:18:17,812 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 11 treesize of output 9 [2023-11-17 12:18:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-17 12:18:17,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406330060] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:18:17,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:18:17,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 12] total 32 [2023-11-17 12:18:17,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928880674] [2023-11-17 12:18:17,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:18:17,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-17 12:18:17,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:18:17,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-17 12:18:17,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=738, Unknown=13, NotChecked=236, Total=1122 [2023-11-17 12:18:17,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2023-11-17 12:18:17,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 169 transitions, 1531 flow. Second operand has 34 states, 34 states have (on average 13.735294117647058) internal successors, (467), 34 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:17,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:18:17,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2023-11-17 12:18:17,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:18:23,843 INFO L124 PetriNetUnfolderBase]: 21350/29507 cut-off events. [2023-11-17 12:18:23,844 INFO L125 PetriNetUnfolderBase]: For 465612/465612 co-relation queries the response was YES. [2023-11-17 12:18:24,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185896 conditions, 29507 events. 21350/29507 cut-off events. For 465612/465612 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 167320 event pairs, 533 based on Foata normal form. 16/29523 useless extension candidates. Maximal degree in co-relation 185835. Up to 8817 conditions per place. [2023-11-17 12:18:24,089 INFO L140 encePairwiseOnDemand]: 42/62 looper letters, 174 selfloop transitions, 61 changer transitions 517/752 dead transitions. [2023-11-17 12:18:24,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 752 transitions, 8071 flow [2023-11-17 12:18:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-17 12:18:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-11-17 12:18:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 822 transitions. [2023-11-17 12:18:24,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37880184331797234 [2023-11-17 12:18:24,094 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 822 transitions. [2023-11-17 12:18:24,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 822 transitions. [2023-11-17 12:18:24,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:18:24,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 822 transitions. [2023-11-17 12:18:24,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 23.485714285714284) internal successors, (822), 35 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:24,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 62.0) internal successors, (2232), 36 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:24,100 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 62.0) internal successors, (2232), 36 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:24,100 INFO L175 Difference]: Start difference. First operand has 136 places, 169 transitions, 1531 flow. Second operand 35 states and 822 transitions. [2023-11-17 12:18:24,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 752 transitions, 8071 flow [2023-11-17 12:18:25,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 752 transitions, 7696 flow, removed 152 selfloop flow, removed 15 redundant places. [2023-11-17 12:18:25,436 INFO L231 Difference]: Finished difference. Result has 165 places, 129 transitions, 1388 flow [2023-11-17 12:18:25,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1388, PETRI_PLACES=165, PETRI_TRANSITIONS=129} [2023-11-17 12:18:25,437 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 125 predicate places. [2023-11-17 12:18:25,437 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 129 transitions, 1388 flow [2023-11-17 12:18:25,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 13.735294117647058) internal successors, (467), 34 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:25,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:18:25,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:18:25,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 12:18:25,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:18:25,640 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 2 more)] === [2023-11-17 12:18:25,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:18:25,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1222289464, now seen corresponding path program 5 times [2023-11-17 12:18:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:18:25,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481643006] [2023-11-17 12:18:25,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:18:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:18:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:18:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 12:18:25,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:18:25,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481643006] [2023-11-17 12:18:25,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481643006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:18:25,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:18:25,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:18:25,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194163188] [2023-11-17 12:18:25,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:18:25,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:18:25,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:18:25,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:18:25,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:18:25,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2023-11-17 12:18:25,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 129 transitions, 1388 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:25,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:18:25,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2023-11-17 12:18:25,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:18:27,976 INFO L124 PetriNetUnfolderBase]: 10074/14027 cut-off events. [2023-11-17 12:18:27,982 INFO L125 PetriNetUnfolderBase]: For 575651/575651 co-relation queries the response was YES. [2023-11-17 12:18:28,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123358 conditions, 14027 events. 10074/14027 cut-off events. For 575651/575651 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 71115 event pairs, 1940 based on Foata normal form. 10/14037 useless extension candidates. Maximal degree in co-relation 123298. Up to 9298 conditions per place. [2023-11-17 12:18:28,101 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 143 selfloop transitions, 9 changer transitions 147/299 dead transitions. [2023-11-17 12:18:28,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 299 transitions, 3888 flow [2023-11-17 12:18:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:18:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:18:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2023-11-17 12:18:28,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44193548387096776 [2023-11-17 12:18:28,102 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 137 transitions. [2023-11-17 12:18:28,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 137 transitions. [2023-11-17 12:18:28,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:18:28,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 137 transitions. [2023-11-17 12:18:28,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:28,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:28,104 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:28,104 INFO L175 Difference]: Start difference. First operand has 165 places, 129 transitions, 1388 flow. Second operand 5 states and 137 transitions. [2023-11-17 12:18:28,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 299 transitions, 3888 flow [2023-11-17 12:18:28,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 299 transitions, 3215 flow, removed 196 selfloop flow, removed 36 redundant places. [2023-11-17 12:18:28,991 INFO L231 Difference]: Finished difference. Result has 108 places, 125 transitions, 1105 flow [2023-11-17 12:18:28,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1105, PETRI_PLACES=108, PETRI_TRANSITIONS=125} [2023-11-17 12:18:28,992 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 68 predicate places. [2023-11-17 12:18:28,992 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 125 transitions, 1105 flow [2023-11-17 12:18:28,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:28,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:18:28,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:18:28,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 12:18:28,993 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 2 more)] === [2023-11-17 12:18:28,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:18:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash -231736530, now seen corresponding path program 6 times [2023-11-17 12:18:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:18:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546305092] [2023-11-17 12:18:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:18:28,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:18:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:18:29,321 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 12:18:29,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:18:29,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546305092] [2023-11-17 12:18:29,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546305092] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:18:29,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102500813] [2023-11-17 12:18:29,321 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 12:18:29,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:18:29,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:18:29,323 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:18:29,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 12:18:29,534 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-17 12:18:29,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:18:29,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-17 12:18:29,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:18:29,679 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 15 treesize of output 7 [2023-11-17 12:18:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:18:29,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:18:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:18:30,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102500813] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 12:18:30,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 12:18:30,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 9] total 19 [2023-11-17 12:18:30,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458223756] [2023-11-17 12:18:30,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:18:30,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 12:18:30,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:18:30,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 12:18:30,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2023-11-17 12:18:30,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2023-11-17 12:18:30,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 125 transitions, 1105 flow. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:30,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:18:30,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2023-11-17 12:18:30,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:18:32,807 INFO L124 PetriNetUnfolderBase]: 16861/23288 cut-off events. [2023-11-17 12:18:32,807 INFO L125 PetriNetUnfolderBase]: For 415397/415397 co-relation queries the response was YES. [2023-11-17 12:18:32,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158059 conditions, 23288 events. 16861/23288 cut-off events. For 415397/415397 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 128115 event pairs, 1058 based on Foata normal form. 5/23293 useless extension candidates. Maximal degree in co-relation 158020. Up to 11924 conditions per place. [2023-11-17 12:18:32,998 INFO L140 encePairwiseOnDemand]: 49/62 looper letters, 274 selfloop transitions, 142 changer transitions 55/471 dead transitions. [2023-11-17 12:18:32,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 471 transitions, 5353 flow [2023-11-17 12:18:32,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 12:18:32,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 12:18:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 293 transitions. [2023-11-17 12:18:33,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42961876832844575 [2023-11-17 12:18:33,000 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 293 transitions. [2023-11-17 12:18:33,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 293 transitions. [2023-11-17 12:18:33,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:18:33,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 293 transitions. [2023-11-17 12:18:33,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 26.636363636363637) internal successors, (293), 11 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:33,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 62.0) internal successors, (744), 12 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:33,002 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 62.0) internal successors, (744), 12 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:33,002 INFO L175 Difference]: Start difference. First operand has 108 places, 125 transitions, 1105 flow. Second operand 11 states and 293 transitions. [2023-11-17 12:18:33,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 471 transitions, 5353 flow [2023-11-17 12:18:33,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 471 transitions, 5255 flow, removed 30 selfloop flow, removed 4 redundant places. [2023-11-17 12:18:33,516 INFO L231 Difference]: Finished difference. Result has 121 places, 275 transitions, 3231 flow [2023-11-17 12:18:33,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3231, PETRI_PLACES=121, PETRI_TRANSITIONS=275} [2023-11-17 12:18:33,517 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 81 predicate places. [2023-11-17 12:18:33,517 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 275 transitions, 3231 flow [2023-11-17 12:18:33,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:33,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:18:33,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:18:33,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 12:18:33,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:18:33,719 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 2 more)] === [2023-11-17 12:18:33,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:18:33,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1781729144, now seen corresponding path program 7 times [2023-11-17 12:18:33,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:18:33,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825916928] [2023-11-17 12:18:33,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:18:33,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:18:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:18:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:18:34,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:18:34,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825916928] [2023-11-17 12:18:34,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825916928] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:18:34,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174617487] [2023-11-17 12:18:34,023 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 12:18:34,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:18:34,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:18:34,024 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:18:34,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 12:18:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:18:34,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-17 12:18:34,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:18:34,195 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 15 treesize of output 7 [2023-11-17 12:18:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:18:34,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:18:34,435 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 12:18:34,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174617487] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:18:34,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:18:34,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2023-11-17 12:18:34,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157020708] [2023-11-17 12:18:34,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:18:34,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-17 12:18:34,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:18:34,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-17 12:18:34,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2023-11-17 12:18:34,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2023-11-17 12:18:34,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 275 transitions, 3231 flow. Second operand has 17 states, 17 states have (on average 14.764705882352942) internal successors, (251), 17 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:34,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:18:34,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2023-11-17 12:18:34,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:18:48,211 INFO L124 PetriNetUnfolderBase]: 64361/89815 cut-off events. [2023-11-17 12:18:48,211 INFO L125 PetriNetUnfolderBase]: For 1770262/1770262 co-relation queries the response was YES. [2023-11-17 12:18:48,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653338 conditions, 89815 events. 64361/89815 cut-off events. For 1770262/1770262 co-relation queries the response was YES. Maximal size of possible extension queue 3326. Compared 602004 event pairs, 5738 based on Foata normal form. 88/89903 useless extension candidates. Maximal degree in co-relation 653293. Up to 41285 conditions per place. [2023-11-17 12:18:49,178 INFO L140 encePairwiseOnDemand]: 50/62 looper letters, 257 selfloop transitions, 212 changer transitions 2017/2486 dead transitions. [2023-11-17 12:18:49,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 2486 transitions, 33322 flow [2023-11-17 12:18:49,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-17 12:18:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-11-17 12:18:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 1027 transitions. [2023-11-17 12:18:49,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41411290322580646 [2023-11-17 12:18:49,181 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 1027 transitions. [2023-11-17 12:18:49,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 1027 transitions. [2023-11-17 12:18:49,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:18:49,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 1027 transitions. [2023-11-17 12:18:49,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 25.675) internal successors, (1027), 40 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:49,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 62.0) internal successors, (2542), 41 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:49,187 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 62.0) internal successors, (2542), 41 states have internal predecessors, (2542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:49,187 INFO L175 Difference]: Start difference. First operand has 121 places, 275 transitions, 3231 flow. Second operand 40 states and 1027 transitions. [2023-11-17 12:18:49,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 2486 transitions, 33322 flow [2023-11-17 12:18:54,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 2486 transitions, 33174 flow, removed 74 selfloop flow, removed 1 redundant places. [2023-11-17 12:18:54,693 INFO L231 Difference]: Finished difference. Result has 194 places, 335 transitions, 5420 flow [2023-11-17 12:18:54,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=3213, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=5420, PETRI_PLACES=194, PETRI_TRANSITIONS=335} [2023-11-17 12:18:54,694 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 154 predicate places. [2023-11-17 12:18:54,694 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 335 transitions, 5420 flow [2023-11-17 12:18:54,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.764705882352942) internal successors, (251), 17 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:54,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:18:54,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:18:54,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 12:18:54,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-17 12:18:54,896 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 2 more)] === [2023-11-17 12:18:54,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:18:54,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1478853628, now seen corresponding path program 8 times [2023-11-17 12:18:54,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:18:54,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760348265] [2023-11-17 12:18:54,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:18:54,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:18:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:18:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:18:55,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:18:55,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760348265] [2023-11-17 12:18:55,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760348265] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:18:55,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755444000] [2023-11-17 12:18:55,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:18:55,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:18:55,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:18:55,247 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:18:55,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 12:18:55,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:18:55,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:18:55,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 12:18:55,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:18:55,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:18:55,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:18:55,569 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 15 treesize of output 7 [2023-11-17 12:18:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:18:55,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:18:55,934 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 27 treesize of output 19 [2023-11-17 12:18:55,959 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 12:18:55,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755444000] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:18:55,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:18:55,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 25 [2023-11-17 12:18:55,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465043519] [2023-11-17 12:18:55,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:18:55,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-17 12:18:55,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:18:55,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-17 12:18:55,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2023-11-17 12:18:55,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 62 [2023-11-17 12:18:55,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 335 transitions, 5420 flow. Second operand has 27 states, 27 states have (on average 14.148148148148149) internal successors, (382), 27 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:18:55,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:18:55,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 62 [2023-11-17 12:18:55,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:19:11,848 INFO L124 PetriNetUnfolderBase]: 51191/71982 cut-off events. [2023-11-17 12:19:11,849 INFO L125 PetriNetUnfolderBase]: For 4508271/4508271 co-relation queries the response was YES. [2023-11-17 12:19:13,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760752 conditions, 71982 events. 51191/71982 cut-off events. For 4508271/4508271 co-relation queries the response was YES. Maximal size of possible extension queue 2780. Compared 477699 event pairs, 5147 based on Foata normal form. 93/72075 useless extension candidates. Maximal degree in co-relation 760671. Up to 33376 conditions per place. [2023-11-17 12:19:13,298 INFO L140 encePairwiseOnDemand]: 50/62 looper letters, 228 selfloop transitions, 282 changer transitions 1413/1923 dead transitions. [2023-11-17 12:19:13,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 1923 transitions, 34937 flow [2023-11-17 12:19:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-17 12:19:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-17 12:19:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 1006 transitions. [2023-11-17 12:19:13,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38632872503840243 [2023-11-17 12:19:13,302 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 1006 transitions. [2023-11-17 12:19:13,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 1006 transitions. [2023-11-17 12:19:13,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:19:13,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 1006 transitions. [2023-11-17 12:19:13,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 23.952380952380953) internal successors, (1006), 42 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:19:13,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 62.0) internal successors, (2666), 43 states have internal predecessors, (2666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:19:13,311 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 62.0) internal successors, (2666), 43 states have internal predecessors, (2666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:19:13,311 INFO L175 Difference]: Start difference. First operand has 194 places, 335 transitions, 5420 flow. Second operand 42 states and 1006 transitions. [2023-11-17 12:19:13,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 1923 transitions, 34937 flow [2023-11-17 12:19:29,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 1923 transitions, 33029 flow, removed 919 selfloop flow, removed 18 redundant places. [2023-11-17 12:19:29,442 INFO L231 Difference]: Finished difference. Result has 223 places, 394 transitions, 7316 flow [2023-11-17 12:19:29,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=5040, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=7316, PETRI_PLACES=223, PETRI_TRANSITIONS=394} [2023-11-17 12:19:29,443 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 183 predicate places. [2023-11-17 12:19:29,443 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 394 transitions, 7316 flow [2023-11-17 12:19:29,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 14.148148148148149) internal successors, (382), 27 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:19:29,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:19:29,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:19:29,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 12:19:29,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:19:29,649 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 2 more)] === [2023-11-17 12:19:29,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:19:29,650 INFO L85 PathProgramCache]: Analyzing trace with hash -720002216, now seen corresponding path program 9 times [2023-11-17 12:19:29,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:19:29,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379954713] [2023-11-17 12:19:29,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:19:29,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:19:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:19:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:19:30,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:19:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379954713] [2023-11-17 12:19:30,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379954713] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:19:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511473963] [2023-11-17 12:19:30,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:19:30,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:19:30,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:19:30,257 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:19:30,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-17 12:19:30,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 12:19:30,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:19:30,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-17 12:19:30,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:19:30,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:19:30,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:19:30,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:19:30,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:19:30,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-17 12:19:30,790 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 17 treesize of output 9 [2023-11-17 12:19:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:19:30,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:19:41,438 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 141 treesize of output 113 [2023-11-17 12:19:41,442 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 17 treesize of output 15 [2023-11-17 12:19:41,445 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 24 treesize of output 20 [2023-11-17 12:19:41,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:19:41,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511473963] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:19:41,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:19:41,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 13] total 34 [2023-11-17 12:19:41,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959407362] [2023-11-17 12:19:41,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:19:41,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-17 12:19:41,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:19:41,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-17 12:19:41,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1025, Unknown=15, NotChecked=0, Total=1260 [2023-11-17 12:19:41,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 62 [2023-11-17 12:19:41,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 394 transitions, 7316 flow. Second operand has 36 states, 36 states have (on average 10.583333333333334) internal successors, (381), 36 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:19:41,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:19:41,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 62 [2023-11-17 12:19:41,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:20:03,285 INFO L124 PetriNetUnfolderBase]: 50065/69674 cut-off events. [2023-11-17 12:20:03,285 INFO L125 PetriNetUnfolderBase]: For 6504981/6504981 co-relation queries the response was YES. [2023-11-17 12:20:04,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852782 conditions, 69674 events. 50065/69674 cut-off events. For 6504981/6504981 co-relation queries the response was YES. Maximal size of possible extension queue 2372. Compared 443825 event pairs, 1815 based on Foata normal form. 67/69741 useless extension candidates. Maximal degree in co-relation 852682. Up to 31922 conditions per place. [2023-11-17 12:20:04,895 INFO L140 encePairwiseOnDemand]: 49/62 looper letters, 310 selfloop transitions, 223 changer transitions 2097/2630 dead transitions. [2023-11-17 12:20:04,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 2630 transitions, 54301 flow [2023-11-17 12:20:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2023-11-17 12:20:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2023-11-17 12:20:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1991 transitions. [2023-11-17 12:20:04,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30583717357910906 [2023-11-17 12:20:04,905 INFO L72 ComplementDD]: Start complementDD. Operand 105 states and 1991 transitions. [2023-11-17 12:20:04,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 1991 transitions. [2023-11-17 12:20:04,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:20:04,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 105 states and 1991 transitions. [2023-11-17 12:20:04,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 106 states, 105 states have (on average 18.961904761904762) internal successors, (1991), 105 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:20:04,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 106 states, 106 states have (on average 62.0) internal successors, (6572), 106 states have internal predecessors, (6572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:20:04,918 INFO L81 ComplementDD]: Finished complementDD. Result has 106 states, 106 states have (on average 62.0) internal successors, (6572), 106 states have internal predecessors, (6572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:20:04,919 INFO L175 Difference]: Start difference. First operand has 223 places, 394 transitions, 7316 flow. Second operand 105 states and 1991 transitions. [2023-11-17 12:20:04,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 2630 transitions, 54301 flow [2023-11-17 12:21:22,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 2630 transitions, 46565 flow, removed 3550 selfloop flow, removed 36 redundant places. [2023-11-17 12:21:22,471 INFO L231 Difference]: Finished difference. Result has 352 places, 305 transitions, 6320 flow [2023-11-17 12:21:22,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=6616, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=6320, PETRI_PLACES=352, PETRI_TRANSITIONS=305} [2023-11-17 12:21:22,472 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 312 predicate places. [2023-11-17 12:21:22,473 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 305 transitions, 6320 flow [2023-11-17 12:21:22,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 10.583333333333334) internal successors, (381), 36 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:21:22,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:21:22,473 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 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 12:21:22,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-17 12:21:22,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:21:22,674 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 2 more)] === [2023-11-17 12:21:22,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:21:22,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1253782766, now seen corresponding path program 10 times [2023-11-17 12:21:22,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:21:22,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719954903] [2023-11-17 12:21:22,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:21:22,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:21:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:21:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:21:22,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:21:22,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719954903] [2023-11-17 12:21:22,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719954903] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:21:22,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487130301] [2023-11-17 12:21:22,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:21:22,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:21:22,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:21:22,797 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:21:22,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-17 12:21:22,935 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:21:22,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:21:22,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 12:21:22,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:21:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:21:23,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:21:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:21:23,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487130301] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:21:23,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:21:23,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-11-17 12:21:23,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338408017] [2023-11-17 12:21:23,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:21:23,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-17 12:21:23,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:21:23,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-17 12:21:23,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-11-17 12:21:23,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 62 [2023-11-17 12:21:23,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 305 transitions, 6320 flow. Second operand has 16 states, 16 states have (on average 15.5625) internal successors, (249), 16 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:21:23,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:21:23,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 62 [2023-11-17 12:21:23,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand