/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-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 12:22:38,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 12:22:38,081 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:22:38,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 12:22:38,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 12:22:38,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 12:22:38,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 12:22:38,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 12:22:38,100 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 12:22:38,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 12:22:38,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 12:22:38,100 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 12:22:38,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 12:22:38,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 12:22:38,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 12:22:38,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 12:22:38,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 12:22:38,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 12:22:38,102 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 12:22:38,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 12:22:38,102 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 12:22:38,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 12:22:38,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 12:22:38,103 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 12:22:38,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 12:22:38,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:22:38,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 12:22:38,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 12:22:38,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 12:22:38,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 12:22:38,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 12:22:38,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 12:22:38,105 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:22:38,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 12:22:38,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 12:22:38,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 12:22:38,282 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 12:22:38,282 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 12:22:38,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2023-11-17 12:22:39,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 12:22:39,524 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 12:22:39,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2023-11-17 12:22:39,530 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69ed9f73/2e515358f0554ab2bad5a34e66d5856b/FLAG42ef8bc33 [2023-11-17 12:22:39,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69ed9f73/2e515358f0554ab2bad5a34e66d5856b [2023-11-17 12:22:39,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 12:22:39,543 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 12:22:39,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 12:22:39,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 12:22:39,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 12:22:39,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:22:39" (1/1) ... [2023-11-17 12:22:39,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4732b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:39, skipping insertion in model container [2023-11-17 12:22:39,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:22:39" (1/1) ... [2023-11-17 12:22:39,569 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 12:22:39,711 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2023-11-17 12:22:39,717 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:22:39,727 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 12:22:39,758 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2023-11-17 12:22:39,760 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:22:39,765 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:22:39,765 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:22:39,772 INFO L206 MainTranslator]: Completed translation [2023-11-17 12:22:39,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:39 WrapperNode [2023-11-17 12:22:39,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 12:22:39,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 12:22:39,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 12:22:39,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 12:22:39,796 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:22:39" (1/1) ... [2023-11-17 12:22:39,815 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:22:39" (1/1) ... [2023-11-17 12:22:39,837 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 199 [2023-11-17 12:22:39,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 12:22:39,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 12:22:39,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 12:22:39,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 12:22:39,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:39" (1/1) ... [2023-11-17 12:22:39,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:39" (1/1) ... [2023-11-17 12:22:39,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:39" (1/1) ... [2023-11-17 12:22:39,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:39" (1/1) ... [2023-11-17 12:22:39,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:39" (1/1) ... [2023-11-17 12:22:39,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:39" (1/1) ... [2023-11-17 12:22:39,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:39" (1/1) ... [2023-11-17 12:22:39,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:39" (1/1) ... [2023-11-17 12:22:39,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 12:22:39,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 12:22:39,865 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 12:22:39,865 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 12:22:39,866 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:39" (1/1) ... [2023-11-17 12:22:39,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:22:39,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:22:39,909 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:22:39,915 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:22:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 12:22:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 12:22:39,937 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 12:22:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 12:22:39,938 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 12:22:39,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 12:22:39,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 12:22:39,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 12:22:39,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 12:22:39,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 12:22:39,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 12:22:39,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 12:22:39,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 12:22:39,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 12:22:39,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 12:22:39,940 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:22:40,017 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 12:22:40,019 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 12:22:40,235 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 12:22:40,481 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 12:22:40,481 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 12:22:40,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:22:40 BoogieIcfgContainer [2023-11-17 12:22:40,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 12:22:40,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 12:22:40,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 12:22:40,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 12:22:40,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:22:39" (1/3) ... [2023-11-17 12:22:40,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d30bbc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:22:40, skipping insertion in model container [2023-11-17 12:22:40,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:22:39" (2/3) ... [2023-11-17 12:22:40,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d30bbc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:22:40, skipping insertion in model container [2023-11-17 12:22:40,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:22:40" (3/3) ... [2023-11-17 12:22:40,489 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2023-11-17 12:22:40,501 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 12:22:40,501 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 12:22:40,502 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 12:22:40,546 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 12:22:40,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 78 flow [2023-11-17 12:22:40,607 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2023-11-17 12:22:40,608 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:22:40,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 5/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2023-11-17 12:22:40,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 32 transitions, 78 flow [2023-11-17 12:22:40,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 29 transitions, 70 flow [2023-11-17 12:22:40,616 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 12:22:40,624 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 29 transitions, 70 flow [2023-11-17 12:22:40,626 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 29 transitions, 70 flow [2023-11-17 12:22:40,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 29 transitions, 70 flow [2023-11-17 12:22:40,633 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2023-11-17 12:22:40,634 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:22:40,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 29 events. 5/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2023-11-17 12:22:40,634 INFO L119 LiptonReduction]: Number of co-enabled transitions 202 [2023-11-17 12:22:40,857 INFO L134 LiptonReduction]: Checked pairs total: 375 [2023-11-17 12:22:40,857 INFO L136 LiptonReduction]: Total number of compositions: 7 [2023-11-17 12:22:40,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 12:22:40,872 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;@4aa00b70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:22:40,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 12:22:40,877 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 12:22:40,877 INFO L124 PetriNetUnfolderBase]: 5/22 cut-off events. [2023-11-17 12:22:40,878 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:22:40,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:22:40,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:22:40,879 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:22:40,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:22:40,882 INFO L85 PathProgramCache]: Analyzing trace with hash -97999697, now seen corresponding path program 1 times [2023-11-17 12:22:40,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:22:40,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761399854] [2023-11-17 12:22:40,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:22:40,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:22:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:22:41,247 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:22:41,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:22:41,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761399854] [2023-11-17 12:22:41,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761399854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:22:41,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:22:41,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:22:41,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123486275] [2023-11-17 12:22:41,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:22:41,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:22:41,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:22:41,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:22:41,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:22:41,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2023-11-17 12:22:41,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:22:41,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2023-11-17 12:22:41,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:22:41,395 INFO L124 PetriNetUnfolderBase]: 124/208 cut-off events. [2023-11-17 12:22:41,395 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-17 12:22:41,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 208 events. 124/208 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 619 event pairs, 29 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 393. Up to 126 conditions per place. [2023-11-17 12:22:41,400 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 30 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2023-11-17 12:22:41,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 149 flow [2023-11-17 12:22:41,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:22:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:22:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2023-11-17 12:22:41,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2023-11-17 12:22:41,411 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 58 transitions. [2023-11-17 12:22:41,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 58 transitions. [2023-11-17 12:22:41,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:22:41,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 58 transitions. [2023-11-17 12:22:41,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,421 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,423 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 4 states and 58 transitions. [2023-11-17 12:22:41,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 149 flow [2023-11-17 12:22:41,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 34 transitions, 139 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 12:22:41,428 INFO L231 Difference]: Finished difference. Result has 25 places, 24 transitions, 64 flow [2023-11-17 12:22:41,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=25, PETRI_TRANSITIONS=24} [2023-11-17 12:22:41,432 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2023-11-17 12:22:41,432 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 24 transitions, 64 flow [2023-11-17 12:22:41,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:22:41,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:22:41,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 12:22:41,433 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:22:41,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:22:41,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1194556489, now seen corresponding path program 1 times [2023-11-17 12:22:41,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:22:41,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539402545] [2023-11-17 12:22:41,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:22:41,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:22:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:22:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:22:41,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:22:41,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539402545] [2023-11-17 12:22:41,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539402545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:22:41,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:22:41,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:22:41,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914160957] [2023-11-17 12:22:41,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:22:41,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:22:41,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:22:41,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:22:41,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:22:41,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2023-11-17 12:22:41,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 24 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:22:41,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2023-11-17 12:22:41,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:22:41,631 INFO L124 PetriNetUnfolderBase]: 124/209 cut-off events. [2023-11-17 12:22:41,632 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-17 12:22:41,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 209 events. 124/209 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 597 event pairs, 78 based on Foata normal form. 1/173 useless extension candidates. Maximal degree in co-relation 202. Up to 208 conditions per place. [2023-11-17 12:22:41,634 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 22 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-11-17 12:22:41,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 25 transitions, 114 flow [2023-11-17 12:22:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:22:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:22:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2023-11-17 12:22:41,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2023-11-17 12:22:41,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 42 transitions. [2023-11-17 12:22:41,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 42 transitions. [2023-11-17 12:22:41,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:22:41,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 42 transitions. [2023-11-17 12:22:41,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,637 INFO L175 Difference]: Start difference. First operand has 25 places, 24 transitions, 64 flow. Second operand 3 states and 42 transitions. [2023-11-17 12:22:41,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 25 transitions, 114 flow [2023-11-17 12:22:41,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 12:22:41,638 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 72 flow [2023-11-17 12:22:41,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2023-11-17 12:22:41,639 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2023-11-17 12:22:41,639 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 72 flow [2023-11-17 12:22:41,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:22:41,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:22:41,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 12:22:41,640 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:22:41,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:22:41,640 INFO L85 PathProgramCache]: Analyzing trace with hash 540478889, now seen corresponding path program 1 times [2023-11-17 12:22:41,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:22:41,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497869626] [2023-11-17 12:22:41,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:22:41,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:22:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:22:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:22:41,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:22:41,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497869626] [2023-11-17 12:22:41,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497869626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:22:41,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:22:41,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 12:22:41,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089584145] [2023-11-17 12:22:41,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:22:41,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:22:41,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:22:41,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:22:41,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:22:41,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2023-11-17 12:22:41,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:22:41,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2023-11-17 12:22:41,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:22:41,763 INFO L124 PetriNetUnfolderBase]: 190/316 cut-off events. [2023-11-17 12:22:41,764 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-17 12:22:41,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 316 events. 190/316 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1041 event pairs, 78 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 672. Up to 187 conditions per place. [2023-11-17 12:22:41,767 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 33 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-11-17 12:22:41,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 38 transitions, 180 flow [2023-11-17 12:22:41,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:22:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:22:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2023-11-17 12:22:41,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042735042735043 [2023-11-17 12:22:41,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 59 transitions. [2023-11-17 12:22:41,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 59 transitions. [2023-11-17 12:22:41,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:22:41,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 59 transitions. [2023-11-17 12:22:41,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,771 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 72 flow. Second operand 3 states and 59 transitions. [2023-11-17 12:22:41,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 38 transitions, 180 flow [2023-11-17 12:22:41,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 38 transitions, 176 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 12:22:41,773 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 80 flow [2023-11-17 12:22:41,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=28, PETRI_TRANSITIONS=26} [2023-11-17 12:22:41,774 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2023-11-17 12:22:41,774 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 80 flow [2023-11-17 12:22:41,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:22:41,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:22:41,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 12:22:41,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:22:41,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:22:41,776 INFO L85 PathProgramCache]: Analyzing trace with hash -218997340, now seen corresponding path program 1 times [2023-11-17 12:22:41,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:22:41,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097515139] [2023-11-17 12:22:41,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:22:41,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:22:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:22:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:22:41,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:22:41,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097515139] [2023-11-17 12:22:41,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097515139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:22:41,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:22:41,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:22:41,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050230306] [2023-11-17 12:22:41,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:22:41,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:22:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:22:41,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:22:41,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:22:41,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2023-11-17 12:22:41,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:22:41,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2023-11-17 12:22:41,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:22:41,923 INFO L124 PetriNetUnfolderBase]: 227/392 cut-off events. [2023-11-17 12:22:41,923 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-17 12:22:41,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 392 events. 227/392 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1401 event pairs, 84 based on Foata normal form. 16/380 useless extension candidates. Maximal degree in co-relation 895. Up to 255 conditions per place. [2023-11-17 12:22:41,925 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 32 selfloop transitions, 2 changer transitions 5/40 dead transitions. [2023-11-17 12:22:41,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 40 transitions, 195 flow [2023-11-17 12:22:41,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:22:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:22:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2023-11-17 12:22:41,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2023-11-17 12:22:41,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 54 transitions. [2023-11-17 12:22:41,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 54 transitions. [2023-11-17 12:22:41,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:22:41,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 54 transitions. [2023-11-17 12:22:41,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,928 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 80 flow. Second operand 3 states and 54 transitions. [2023-11-17 12:22:41,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 40 transitions, 195 flow [2023-11-17 12:22:41,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 40 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 12:22:41,930 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 90 flow [2023-11-17 12:22:41,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2023-11-17 12:22:41,931 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2023-11-17 12:22:41,931 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 90 flow [2023-11-17 12:22:41,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:41,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:22:41,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:22:41,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 12:22:41,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:22:41,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:22:41,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1444082388, now seen corresponding path program 1 times [2023-11-17 12:22:41,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:22:41,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355853241] [2023-11-17 12:22:41,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:22:41,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:22:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:22:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:22:42,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:22:42,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355853241] [2023-11-17 12:22:42,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355853241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:22:42,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:22:42,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:22:42,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479049454] [2023-11-17 12:22:42,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:22:42,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:22:42,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:22:42,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:22:42,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:22:42,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2023-11-17 12:22:42,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:42,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:22:42,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2023-11-17 12:22:42,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:22:42,160 INFO L124 PetriNetUnfolderBase]: 296/529 cut-off events. [2023-11-17 12:22:42,160 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2023-11-17 12:22:42,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1273 conditions, 529 events. 296/529 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2132 event pairs, 237 based on Foata normal form. 16/501 useless extension candidates. Maximal degree in co-relation 997. Up to 392 conditions per place. [2023-11-17 12:22:42,165 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 25 selfloop transitions, 2 changer transitions 18/46 dead transitions. [2023-11-17 12:22:42,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 236 flow [2023-11-17 12:22:42,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:22:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:22:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2023-11-17 12:22:42,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153846153846154 [2023-11-17 12:22:42,168 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 81 transitions. [2023-11-17 12:22:42,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 81 transitions. [2023-11-17 12:22:42,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:22:42,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 81 transitions. [2023-11-17 12:22:42,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 16.2) internal successors, (81), 5 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:22:42,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:42,170 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:42,171 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 90 flow. Second operand 5 states and 81 transitions. [2023-11-17 12:22:42,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 236 flow [2023-11-17 12:22:42,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 12:22:42,173 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 104 flow [2023-11-17 12:22:42,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-11-17 12:22:42,175 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2023-11-17 12:22:42,175 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 104 flow [2023-11-17 12:22:42,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:42,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:22:42,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:22:42,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 12:22:42,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:22:42,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:22:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash 507387259, now seen corresponding path program 1 times [2023-11-17 12:22:42,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:22:42,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423388561] [2023-11-17 12:22:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:22:42,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:22:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:22:43,026 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:22:43,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:22:43,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423388561] [2023-11-17 12:22:43,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423388561] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:22:43,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667563289] [2023-11-17 12:22:43,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:22:43,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:22:43,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:22:43,032 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:22:43,079 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:22:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:22:43,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-17 12:22:43,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:22:43,251 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-17 12:22:43,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2023-11-17 12:22:43,270 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-17 12:22:43,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2023-11-17 12:22:43,293 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-17 12:22:43,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2023-11-17 12:22:43,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:22:43,531 INFO L349 Elim1Store]: treesize reduction 4, result has 90.2 percent of original size [2023-11-17 12:22:43,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 55 [2023-11-17 12:22:43,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 12:22:43,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:22:43,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:22:43,848 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:22:44,079 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 12:22:44,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-11-17 12:22:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:22:44,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:22:44,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:22:44,629 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 74 [2023-11-17 12:22:44,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:22:44,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 587 treesize of output 565 [2023-11-17 12:22:44,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:22:44,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 469 treesize of output 455 [2023-11-17 12:22:44,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:22:44,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 478 treesize of output 410 [2023-11-17 12:22:44,730 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-17 12:22:44,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 141 [2023-11-17 12:22:47,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:22:47,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 149 [2023-11-17 12:22:47,285 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-17 12:22:47,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-11-17 12:22:47,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:22:47,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2023-11-17 12:22:47,299 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:22:47,300 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:22:47,304 INFO L349 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2023-11-17 12:22:47,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 64 [2023-11-17 12:22:47,309 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 18 [2023-11-17 12:22:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:22:47,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667563289] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:22:47,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:22:47,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 27 [2023-11-17 12:22:47,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125088346] [2023-11-17 12:22:47,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:22:47,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-17 12:22:47,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:22:47,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-17 12:22:47,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=654, Unknown=4, NotChecked=0, Total=812 [2023-11-17 12:22:47,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 39 [2023-11-17 12:22:47,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 104 flow. Second operand has 29 states, 29 states have (on average 7.172413793103448) internal successors, (208), 29 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:47,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:22:47,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 39 [2023-11-17 12:22:47,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:22:51,832 INFO L124 PetriNetUnfolderBase]: 1083/1873 cut-off events. [2023-11-17 12:22:51,832 INFO L125 PetriNetUnfolderBase]: For 579/579 co-relation queries the response was YES. [2023-11-17 12:22:51,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4618 conditions, 1873 events. 1083/1873 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9732 event pairs, 92 based on Foata normal form. 25/1779 useless extension candidates. Maximal degree in co-relation 4599. Up to 381 conditions per place. [2023-11-17 12:22:51,839 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 184 selfloop transitions, 86 changer transitions 79/350 dead transitions. [2023-11-17 12:22:51,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 350 transitions, 1792 flow [2023-11-17 12:22:51,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-17 12:22:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-11-17 12:22:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 570 transitions. [2023-11-17 12:22:51,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3247863247863248 [2023-11-17 12:22:51,842 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 570 transitions. [2023-11-17 12:22:51,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 570 transitions. [2023-11-17 12:22:51,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:22:51,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 570 transitions. [2023-11-17 12:22:51,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 12.666666666666666) internal successors, (570), 45 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:51,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 39.0) internal successors, (1794), 46 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:51,847 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 39.0) internal successors, (1794), 46 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:51,847 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 104 flow. Second operand 45 states and 570 transitions. [2023-11-17 12:22:51,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 350 transitions, 1792 flow [2023-11-17 12:22:51,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 350 transitions, 1762 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-17 12:22:51,852 INFO L231 Difference]: Finished difference. Result has 104 places, 121 transitions, 893 flow [2023-11-17 12:22:51,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=893, PETRI_PLACES=104, PETRI_TRANSITIONS=121} [2023-11-17 12:22:51,852 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 79 predicate places. [2023-11-17 12:22:51,853 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 121 transitions, 893 flow [2023-11-17 12:22:51,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.172413793103448) internal successors, (208), 29 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:51,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:22:51,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:22:51,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-17 12:22:52,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-17 12:22:52,060 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:22:52,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:22:52,060 INFO L85 PathProgramCache]: Analyzing trace with hash 31360577, now seen corresponding path program 2 times [2023-11-17 12:22:52,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:22:52,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157331473] [2023-11-17 12:22:52,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:22:52,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:22:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:22:52,207 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:22:52,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:22:52,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157331473] [2023-11-17 12:22:52,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157331473] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:22:52,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312312617] [2023-11-17 12:22:52,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:22:52,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:22:52,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:22:52,209 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:22:52,234 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:22:52,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:22:52,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:22:52,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 12:22:52,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:22:52,330 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:22:52,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:22:52,370 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:22:52,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312312617] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:22:52,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:22:52,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2023-11-17 12:22:52,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730088214] [2023-11-17 12:22:52,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:22:52,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 12:22:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:22:52,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 12:22:52,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-17 12:22:52,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 39 [2023-11-17 12:22:52,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 121 transitions, 893 flow. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:52,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:22:52,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 39 [2023-11-17 12:22:52,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:22:52,693 INFO L124 PetriNetUnfolderBase]: 1135/1978 cut-off events. [2023-11-17 12:22:52,693 INFO L125 PetriNetUnfolderBase]: For 24250/24250 co-relation queries the response was YES. [2023-11-17 12:22:52,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8989 conditions, 1978 events. 1135/1978 cut-off events. For 24250/24250 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10395 event pairs, 103 based on Foata normal form. 138/2116 useless extension candidates. Maximal degree in co-relation 8898. Up to 536 conditions per place. [2023-11-17 12:22:52,706 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 161 selfloop transitions, 78 changer transitions 0/240 dead transitions. [2023-11-17 12:22:52,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 240 transitions, 2222 flow [2023-11-17 12:22:52,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 12:22:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 12:22:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2023-11-17 12:22:52,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3190883190883191 [2023-11-17 12:22:52,708 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 112 transitions. [2023-11-17 12:22:52,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 112 transitions. [2023-11-17 12:22:52,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:22:52,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 112 transitions. [2023-11-17 12:22:52,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:52,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:52,709 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:52,710 INFO L175 Difference]: Start difference. First operand has 104 places, 121 transitions, 893 flow. Second operand 9 states and 112 transitions. [2023-11-17 12:22:52,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 240 transitions, 2222 flow [2023-11-17 12:22:52,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 240 transitions, 1990 flow, removed 114 selfloop flow, removed 5 redundant places. [2023-11-17 12:22:52,742 INFO L231 Difference]: Finished difference. Result has 105 places, 170 transitions, 1493 flow [2023-11-17 12:22:52,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1493, PETRI_PLACES=105, PETRI_TRANSITIONS=170} [2023-11-17 12:22:52,743 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 80 predicate places. [2023-11-17 12:22:52,743 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 170 transitions, 1493 flow [2023-11-17 12:22:52,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:52,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:22:52,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:22:52,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 12:22:52,949 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:22:52,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:22:52,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:22:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1555673125, now seen corresponding path program 3 times [2023-11-17 12:22:52,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:22:52,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738672973] [2023-11-17 12:22:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:22:52,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:22:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:22:53,542 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:22:53,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:22:53,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738672973] [2023-11-17 12:22:53,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738672973] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:22:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315376612] [2023-11-17 12:22:53,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:22:53,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:22:53,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:22:53,546 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:22:53,573 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:22:53,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 12:22:53,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:22:53,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-17 12:22:53,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:22:53,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:22:53,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-17 12:22:53,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:22:53,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:22:53,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-17 12:22:53,723 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 23 treesize of output 1 [2023-11-17 12:22:53,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:22:53,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 12:22:53,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:22:53,832 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:22:53,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:22:53,952 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-17 12:22:53,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2023-11-17 12:22:53,957 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 23 treesize of output 11 [2023-11-17 12:22:54,043 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:22:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:22:54,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:22:54,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:22:54,510 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 56 treesize of output 45 [2023-11-17 12:22:54,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:22:54,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 422 treesize of output 378 [2023-11-17 12:22:54,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:22:54,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 358 treesize of output 327 [2023-11-17 12:22:54,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:22:54,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 231 [2023-11-17 12:22:54,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:22:54,864 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 117 treesize of output 81 [2023-11-17 12:22:54,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:22:54,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2188 treesize of output 1978 [2023-11-17 12:22:54,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:22:54,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1076 treesize of output 876 [2023-11-17 12:22:54,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:22:54,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 836 treesize of output 756 [2023-11-17 12:22:55,011 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 502 treesize of output 406 [2023-11-17 12:22:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:22:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315376612] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:22:59,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:22:59,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-11-17 12:22:59,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95271094] [2023-11-17 12:22:59,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:22:59,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-17 12:22:59,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:22:59,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-17 12:22:59,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=710, Unknown=13, NotChecked=0, Total=870 [2023-11-17 12:22:59,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 39 [2023-11-17 12:22:59,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 170 transitions, 1493 flow. Second operand has 30 states, 30 states have (on average 7.1) internal successors, (213), 30 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:22:59,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:22:59,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 39 [2023-11-17 12:22:59,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:22:59,927 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (not (= (mod c_~ok~0 256) 0))) (.cse7 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse0 (< c_~end~0 0)) (.cse3 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse1 (< c_~n~0 (+ c_~end~0 1))) (.cse8 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (= 0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or .cse0 .cse1 (and (or (forall ((~A~0.offset Int) (v_ArrVal_174 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174))) (= (select (select .cse2 c_~queue~0.base) .cse3) (select (select .cse2 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) .cse4) (forall ((~A~0.offset Int) (v_ArrVal_174 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174))) (let ((.cse5 (select (select .cse6 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_175 (Array Int Int))) (< .cse5 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175) c_~queue~0.base) .cse7) 1))) (not (= (select (select .cse6 c_~queue~0.base) .cse3) .cse5)))))))) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= .cse8 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= c_~ok~0 1) (<= (+ c_~start~0 c_~n~0) (+ c_~end~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse0 .cse1 (and (forall ((~A~0.offset Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174))) (let ((.cse10 (select (select .cse9 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= (select (select .cse9 c_~queue~0.base) .cse3) .cse10)) (forall ((v_ArrVal_175 (Array Int Int))) (< .cse10 (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175) c_~queue~0.base) .cse7) 1))))))) (or (forall ((~A~0.offset Int) (v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (not (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174))) (= (select (select .cse11 c_~queue~0.base) .cse3) (select (select .cse11 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) .cse4))) (or (and .cse4 (forall ((v_ArrVal_175 (Array Int Int))) (<= c_~v_old~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175) c_~queue~0.base) .cse7)))) .cse0 (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse12 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse12 c_~last~0) (not (= (select (select |c_#memory_int| c_~queue~0.base) .cse3) .cse12))))) .cse1) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= c_~start~0 c_~end~0) (<= .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2023-11-17 12:23:02,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 12:23:05,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 12:23:10,340 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~start~0 0)) (.cse0 (select |c_#memory_int| c_~queue~0.base))) (and (<= c_~start~0 0) (<= c_~v_old~0 (select .cse0 c_~queue~0.offset)) .cse1 (= |c_thread2Thread1of1ForFork0_~cond~0#1| 1) (not (= (mod c_~ok~0 256) 0)) (or (not .cse1) (< c_~v_old~0 (+ (select .cse0 0) 1))) (= c_~ok~0 1) (= c_~queue~0.offset 0) (<= (+ c_~i~0 1) c_~N~0) (forall ((v_ArrVal_175 (Array Int Int))) (<= c_~v_old~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)))))) is different from false [2023-11-17 12:23:11,177 INFO L124 PetriNetUnfolderBase]: 3114/5341 cut-off events. [2023-11-17 12:23:11,177 INFO L125 PetriNetUnfolderBase]: For 56377/56377 co-relation queries the response was YES. [2023-11-17 12:23:11,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28828 conditions, 5341 events. 3114/5341 cut-off events. For 56377/56377 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 32720 event pairs, 203 based on Foata normal form. 11/5352 useless extension candidates. Maximal degree in co-relation 26215. Up to 1279 conditions per place. [2023-11-17 12:23:11,210 INFO L140 encePairwiseOnDemand]: 23/39 looper letters, 384 selfloop transitions, 294 changer transitions 132/811 dead transitions. [2023-11-17 12:23:11,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 811 transitions, 8705 flow [2023-11-17 12:23:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-17 12:23:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-11-17 12:23:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 722 transitions. [2023-11-17 12:23:11,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30854700854700856 [2023-11-17 12:23:11,213 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 722 transitions. [2023-11-17 12:23:11,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 722 transitions. [2023-11-17 12:23:11,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:23:11,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 722 transitions. [2023-11-17 12:23:11,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 12.033333333333333) internal successors, (722), 60 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:11,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 39.0) internal successors, (2379), 61 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:11,224 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 39.0) internal successors, (2379), 61 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:11,224 INFO L175 Difference]: Start difference. First operand has 105 places, 170 transitions, 1493 flow. Second operand 60 states and 722 transitions. [2023-11-17 12:23:11,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 811 transitions, 8705 flow [2023-11-17 12:23:11,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 811 transitions, 7926 flow, removed 367 selfloop flow, removed 2 redundant places. [2023-11-17 12:23:11,441 INFO L231 Difference]: Finished difference. Result has 198 places, 393 transitions, 4628 flow [2023-11-17 12:23:11,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1378, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=4628, PETRI_PLACES=198, PETRI_TRANSITIONS=393} [2023-11-17 12:23:11,443 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 173 predicate places. [2023-11-17 12:23:11,443 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 393 transitions, 4628 flow [2023-11-17 12:23:11,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.1) internal successors, (213), 30 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:11,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:23:11,443 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] [2023-11-17 12:23:11,449 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:23:11,649 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:23:11,649 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:23:11,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:23:11,650 INFO L85 PathProgramCache]: Analyzing trace with hash 86641691, now seen corresponding path program 4 times [2023-11-17 12:23:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:23:11,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402479780] [2023-11-17 12:23:11,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:11,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:23:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:23:11,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:23:11,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402479780] [2023-11-17 12:23:11,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402479780] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:23:11,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455177856] [2023-11-17 12:23:11,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:23:11,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:11,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:23:11,727 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:23:11,755 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:23:11,815 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:23:11,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:23:11,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-17 12:23:11,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:23:11,838 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:23:11,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:23:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:23:11,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455177856] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:23:11,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:23:11,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2023-11-17 12:23:11,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182288442] [2023-11-17 12:23:11,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:23:11,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 12:23:11,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:23:11,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 12:23:11,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-17 12:23:11,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2023-11-17 12:23:11,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 393 transitions, 4628 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:11,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:23:11,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2023-11-17 12:23:11,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:23:12,721 INFO L124 PetriNetUnfolderBase]: 2713/4748 cut-off events. [2023-11-17 12:23:12,722 INFO L125 PetriNetUnfolderBase]: For 52992/52992 co-relation queries the response was YES. [2023-11-17 12:23:12,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29334 conditions, 4748 events. 2713/4748 cut-off events. For 52992/52992 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 29018 event pairs, 396 based on Foata normal form. 272/5008 useless extension candidates. Maximal degree in co-relation 29172. Up to 2468 conditions per place. [2023-11-17 12:23:12,763 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 301 selfloop transitions, 103 changer transitions 2/407 dead transitions. [2023-11-17 12:23:12,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 407 transitions, 5532 flow [2023-11-17 12:23:12,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:23:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:23:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2023-11-17 12:23:12,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-17 12:23:12,765 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 78 transitions. [2023-11-17 12:23:12,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 78 transitions. [2023-11-17 12:23:12,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:23:12,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 78 transitions. [2023-11-17 12:23:12,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 19.5) internal successors, (78), 4 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:23:12,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:12,765 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:12,766 INFO L175 Difference]: Start difference. First operand has 198 places, 393 transitions, 4628 flow. Second operand 4 states and 78 transitions. [2023-11-17 12:23:12,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 407 transitions, 5532 flow [2023-11-17 12:23:12,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 407 transitions, 5015 flow, removed 186 selfloop flow, removed 27 redundant places. [2023-11-17 12:23:12,970 INFO L231 Difference]: Finished difference. Result has 164 places, 357 transitions, 4266 flow [2023-11-17 12:23:12,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3212, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4266, PETRI_PLACES=164, PETRI_TRANSITIONS=357} [2023-11-17 12:23:12,971 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 139 predicate places. [2023-11-17 12:23:12,971 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 357 transitions, 4266 flow [2023-11-17 12:23:12,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:12,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:23:12,972 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:23:12,980 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:23:13,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:13,177 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:23:13,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:23:13,178 INFO L85 PathProgramCache]: Analyzing trace with hash 44098692, now seen corresponding path program 5 times [2023-11-17 12:23:13,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:23:13,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536046318] [2023-11-17 12:23:13,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:13,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:23:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:23:13,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:23:13,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536046318] [2023-11-17 12:23:13,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536046318] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:23:13,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056720945] [2023-11-17 12:23:13,295 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 12:23:13,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:13,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:23:13,309 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:23:13,359 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:23:13,445 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:23:13,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:23:13,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 12:23:13,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:23:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:23:13,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:23:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:23:13,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056720945] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:23:13,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:23:13,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-11-17 12:23:13,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834943537] [2023-11-17 12:23:13,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:23:13,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-17 12:23:13,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:23:13,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-17 12:23:13,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-11-17 12:23:13,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2023-11-17 12:23:13,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 357 transitions, 4266 flow. Second operand has 15 states, 15 states have (on average 9.2) internal successors, (138), 15 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:13,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:23:13,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2023-11-17 12:23:13,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:23:14,657 INFO L124 PetriNetUnfolderBase]: 3445/6025 cut-off events. [2023-11-17 12:23:14,657 INFO L125 PetriNetUnfolderBase]: For 61478/61478 co-relation queries the response was YES. [2023-11-17 12:23:14,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37554 conditions, 6025 events. 3445/6025 cut-off events. For 61478/61478 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 38919 event pairs, 453 based on Foata normal form. 83/6084 useless extension candidates. Maximal degree in co-relation 33560. Up to 2245 conditions per place. [2023-11-17 12:23:14,697 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 479 selfloop transitions, 115 changer transitions 0/595 dead transitions. [2023-11-17 12:23:14,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 595 transitions, 8512 flow [2023-11-17 12:23:14,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 12:23:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 12:23:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2023-11-17 12:23:14,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31794871794871793 [2023-11-17 12:23:14,699 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 124 transitions. [2023-11-17 12:23:14,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 124 transitions. [2023-11-17 12:23:14,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:23:14,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 124 transitions. [2023-11-17 12:23:14,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:14,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:14,700 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:14,700 INFO L175 Difference]: Start difference. First operand has 164 places, 357 transitions, 4266 flow. Second operand 10 states and 124 transitions. [2023-11-17 12:23:14,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 595 transitions, 8512 flow [2023-11-17 12:23:14,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 595 transitions, 8017 flow, removed 57 selfloop flow, removed 5 redundant places. [2023-11-17 12:23:15,005 INFO L231 Difference]: Finished difference. Result has 171 places, 403 transitions, 4883 flow [2023-11-17 12:23:15,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3974, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4883, PETRI_PLACES=171, PETRI_TRANSITIONS=403} [2023-11-17 12:23:15,006 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 146 predicate places. [2023-11-17 12:23:15,006 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 403 transitions, 4883 flow [2023-11-17 12:23:15,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.2) internal successors, (138), 15 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:15,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:23:15,006 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:23:15,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-17 12:23:15,211 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,SelfDestructingSolverStorable9 [2023-11-17 12:23:15,211 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:23:15,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:23:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash -436154826, now seen corresponding path program 1 times [2023-11-17 12:23:15,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:23:15,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180652034] [2023-11-17 12:23:15,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:15,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:23:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 12:23:15,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:23:15,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180652034] [2023-11-17 12:23:15,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180652034] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:23:15,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050989849] [2023-11-17 12:23:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:15,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:15,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:23:15,337 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:23:15,338 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:23:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:15,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 12:23:15,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:23:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 12:23:15,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:23:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 12:23:15,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050989849] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:23:15,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:23:15,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-11-17 12:23:15,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952451213] [2023-11-17 12:23:15,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:23:15,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-17 12:23:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:23:15,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-17 12:23:15,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-11-17 12:23:15,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2023-11-17 12:23:15,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 403 transitions, 4883 flow. Second operand has 15 states, 15 states have (on average 9.066666666666666) internal successors, (136), 15 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:15,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:23:15,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2023-11-17 12:23:15,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:23:16,675 INFO L124 PetriNetUnfolderBase]: 3400/6105 cut-off events. [2023-11-17 12:23:16,675 INFO L125 PetriNetUnfolderBase]: For 58957/58957 co-relation queries the response was YES. [2023-11-17 12:23:16,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38130 conditions, 6105 events. 3400/6105 cut-off events. For 58957/58957 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 40625 event pairs, 387 based on Foata normal form. 184/6265 useless extension candidates. Maximal degree in co-relation 35348. Up to 3922 conditions per place. [2023-11-17 12:23:16,717 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 405 selfloop transitions, 38 changer transitions 119/563 dead transitions. [2023-11-17 12:23:16,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 563 transitions, 7860 flow [2023-11-17 12:23:16,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 12:23:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 12:23:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2023-11-17 12:23:16,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33903133903133903 [2023-11-17 12:23:16,718 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 119 transitions. [2023-11-17 12:23:16,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 119 transitions. [2023-11-17 12:23:16,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:23:16,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 119 transitions. [2023-11-17 12:23:16,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 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:23:16,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:16,719 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:16,719 INFO L175 Difference]: Start difference. First operand has 171 places, 403 transitions, 4883 flow. Second operand 9 states and 119 transitions. [2023-11-17 12:23:16,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 563 transitions, 7860 flow [2023-11-17 12:23:16,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 563 transitions, 7780 flow, removed 32 selfloop flow, removed 3 redundant places. [2023-11-17 12:23:16,977 INFO L231 Difference]: Finished difference. Result has 178 places, 358 transitions, 4350 flow [2023-11-17 12:23:16,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=4670, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4350, PETRI_PLACES=178, PETRI_TRANSITIONS=358} [2023-11-17 12:23:16,978 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 153 predicate places. [2023-11-17 12:23:16,978 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 358 transitions, 4350 flow [2023-11-17 12:23:16,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.066666666666666) internal successors, (136), 15 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:16,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:23:16,978 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 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:23:16,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-17 12:23:17,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:17,184 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:23:17,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:23:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash -26370266, now seen corresponding path program 6 times [2023-11-17 12:23:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:23:17,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896368736] [2023-11-17 12:23:17,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:17,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:23:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:23:18,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:23:18,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896368736] [2023-11-17 12:23:18,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896368736] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:23:18,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087930248] [2023-11-17 12:23:18,814 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 12:23:18,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:18,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:23:18,815 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:23:18,818 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:23:18,951 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-17 12:23:18,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:23:18,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-17 12:23:18,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:23:19,115 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:23:19,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:19,159 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:23:19,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:19,265 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:23:19,394 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-17 12:23:19,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2023-11-17 12:23:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:23:19,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:23:19,731 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_~i~0 4))) (.cse2 (* c_~end~0 4))) (and (or (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_330 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_330))) (= (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 ~queue~0.base) (+ .cse2 ~queue~0.offset)))))) (not (= (mod c_~ok~0 256) 0))) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_330 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_330))) (let ((.cse4 (select .cse3 ~queue~0.base))) (or (not (= (select (select .cse3 c_~A~0.base) .cse1) (select .cse4 (+ .cse2 ~queue~0.offset)))) (< c_~v_old~0 (+ (select .cse4 (+ (* c_~start~0 4) ~queue~0.offset)) 1)))))))) is different from false [2023-11-17 12:23:19,775 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (* c_~end~0 4))) (and (forall ((v_ArrVal_329 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_330 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_330))) (let ((.cse0 (select .cse1 ~queue~0.base))) (or (< (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ (select .cse0 (+ (* c_~start~0 4) ~queue~0.offset)) 1)) (not (= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2) (select .cse0 (+ .cse3 ~queue~0.offset)))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_329 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_330 (Array Int Int))) (not (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_329) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_330))) (= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2) (select (select .cse4 ~queue~0.base) (+ .cse3 ~queue~0.offset))))))))) is different from false [2023-11-17 12:23:19,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:19,784 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 56 treesize of output 45 [2023-11-17 12:23:19,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:19,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 422 treesize of output 378 [2023-11-17 12:23:19,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:19,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 358 treesize of output 327 [2023-11-17 12:23:19,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:19,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 231 [2023-11-17 12:23:19,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:19,868 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 74 [2023-11-17 12:23:19,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:19,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 587 treesize of output 565 [2023-11-17 12:23:19,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:19,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 532 treesize of output 464 [2023-11-17 12:23:19,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:19,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 367 treesize of output 353 [2023-11-17 12:23:19,948 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-17 12:23:19,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 141 [2023-11-17 12:23:22,186 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 12:23:22,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 1 [2023-11-17 12:23:22,192 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 12:23:22,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 1 [2023-11-17 12:23:22,213 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 12:23:22,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2023-11-17 12:23:22,228 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-17 12:23:22,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-11-17 12:23:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2023-11-17 12:23:22,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087930248] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:23:22,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:23:22,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 34 [2023-11-17 12:23:22,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121026528] [2023-11-17 12:23:22,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:23:22,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-17 12:23:22,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:23:22,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-17 12:23:22,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=945, Unknown=3, NotChecked=130, Total=1260 [2023-11-17 12:23:22,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 39 [2023-11-17 12:23:22,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 358 transitions, 4350 flow. Second operand has 36 states, 36 states have (on average 6.916666666666667) internal successors, (249), 36 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:23:22,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:23:22,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 39 [2023-11-17 12:23:22,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:23:24,949 INFO L124 PetriNetUnfolderBase]: 4153/7241 cut-off events. [2023-11-17 12:23:24,949 INFO L125 PetriNetUnfolderBase]: For 70622/70622 co-relation queries the response was YES. [2023-11-17 12:23:24,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47443 conditions, 7241 events. 4153/7241 cut-off events. For 70622/70622 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 48593 event pairs, 269 based on Foata normal form. 27/7236 useless extension candidates. Maximal degree in co-relation 47385. Up to 2636 conditions per place. [2023-11-17 12:23:25,002 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 340 selfloop transitions, 239 changer transitions 38/618 dead transitions. [2023-11-17 12:23:25,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 618 transitions, 8546 flow [2023-11-17 12:23:25,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 12:23:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-17 12:23:25,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 273 transitions. [2023-11-17 12:23:25,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28 [2023-11-17 12:23:25,004 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 273 transitions. [2023-11-17 12:23:25,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 273 transitions. [2023-11-17 12:23:25,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:23:25,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 273 transitions. [2023-11-17 12:23:25,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 10.92) internal successors, (273), 25 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:25,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 39.0) internal successors, (1014), 26 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:25,012 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 39.0) internal successors, (1014), 26 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:25,012 INFO L175 Difference]: Start difference. First operand has 178 places, 358 transitions, 4350 flow. Second operand 25 states and 273 transitions. [2023-11-17 12:23:25,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 618 transitions, 8546 flow [2023-11-17 12:23:25,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 618 transitions, 8398 flow, removed 39 selfloop flow, removed 8 redundant places. [2023-11-17 12:23:25,428 INFO L231 Difference]: Finished difference. Result has 199 places, 441 transitions, 6165 flow [2023-11-17 12:23:25,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=4217, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=6165, PETRI_PLACES=199, PETRI_TRANSITIONS=441} [2023-11-17 12:23:25,428 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 174 predicate places. [2023-11-17 12:23:25,429 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 441 transitions, 6165 flow [2023-11-17 12:23:25,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 6.916666666666667) internal successors, (249), 36 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:23:25,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:23:25,429 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 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:23:25,436 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:23:25,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:25,635 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:23:25,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:23:25,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1448703974, now seen corresponding path program 7 times [2023-11-17 12:23:25,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:23:25,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974494529] [2023-11-17 12:23:25,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:25,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:23:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:23:26,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:23:26,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974494529] [2023-11-17 12:23:26,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974494529] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:23:26,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591031795] [2023-11-17 12:23:26,947 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 12:23:26,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:26,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:23:26,963 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:23:26,996 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:23:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:27,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-17 12:23:27,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:23:27,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-17 12:23:29,282 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-17 12:23:29,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2023-11-17 12:23:29,287 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 27 treesize of output 15 [2023-11-17 12:23:29,372 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 23 treesize of output 7 [2023-11-17 12:23:29,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:23:29,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:23:29,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:29,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 131 [2023-11-17 12:23:29,630 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 38 treesize of output 32 [2023-11-17 12:23:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-17 12:23:29,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591031795] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:23:29,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:23:29,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 31 [2023-11-17 12:23:29,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661227795] [2023-11-17 12:23:29,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:23:29,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 12:23:29,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:23:29,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 12:23:29,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=880, Unknown=1, NotChecked=0, Total=1056 [2023-11-17 12:23:29,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 39 [2023-11-17 12:23:29,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 441 transitions, 6165 flow. Second operand has 33 states, 33 states have (on average 7.090909090909091) internal successors, (234), 33 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:29,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:23:29,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 39 [2023-11-17 12:23:29,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:23:34,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 12:23:38,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 12:23:40,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 12:23:42,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 12:23:44,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 12:23:46,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 12:23:50,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 12:23:52,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 12:23:54,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 12:23:56,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 12:23:58,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 12:24:00,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 12:24:00,712 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_377 (Array Int Int))) (<= c_~v_old~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_377) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)))) (not (= (mod c_~ok~0 256) 0)) (= c_~ok~0 1)) is different from false [2023-11-17 12:24:04,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 12:24:06,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 12:24:09,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 12:24:10,816 INFO L124 PetriNetUnfolderBase]: 6364/11027 cut-off events. [2023-11-17 12:24:10,816 INFO L125 PetriNetUnfolderBase]: For 138479/138479 co-relation queries the response was YES. [2023-11-17 12:24:10,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79192 conditions, 11027 events. 6364/11027 cut-off events. For 138479/138479 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 78991 event pairs, 559 based on Foata normal form. 9/11006 useless extension candidates. Maximal degree in co-relation 79125. Up to 3616 conditions per place. [2023-11-17 12:24:10,895 INFO L140 encePairwiseOnDemand]: 24/39 looper letters, 402 selfloop transitions, 387 changer transitions 42/832 dead transitions. [2023-11-17 12:24:10,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 832 transitions, 13064 flow [2023-11-17 12:24:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 12:24:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-17 12:24:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 337 transitions. [2023-11-17 12:24:10,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2979664014146773 [2023-11-17 12:24:10,897 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 337 transitions. [2023-11-17 12:24:10,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 337 transitions. [2023-11-17 12:24:10,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:10,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 337 transitions. [2023-11-17 12:24:10,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 11.620689655172415) internal successors, (337), 29 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:10,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 39.0) internal successors, (1170), 30 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:10,899 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 39.0) internal successors, (1170), 30 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:10,900 INFO L175 Difference]: Start difference. First operand has 199 places, 441 transitions, 6165 flow. Second operand 29 states and 337 transitions. [2023-11-17 12:24:10,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 832 transitions, 13064 flow [2023-11-17 12:24:11,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 832 transitions, 12756 flow, removed 129 selfloop flow, removed 9 redundant places. [2023-11-17 12:24:11,989 INFO L231 Difference]: Finished difference. Result has 230 places, 628 transitions, 10635 flow [2023-11-17 12:24:11,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=6007, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=10635, PETRI_PLACES=230, PETRI_TRANSITIONS=628} [2023-11-17 12:24:11,990 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 205 predicate places. [2023-11-17 12:24:11,990 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 628 transitions, 10635 flow [2023-11-17 12:24:11,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.090909090909091) internal successors, (234), 33 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:11,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:11,990 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 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:24:12,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:12,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-17 12:24:12,195 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:24:12,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash 741936961, now seen corresponding path program 8 times [2023-11-17 12:24:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:12,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970352685] [2023-11-17 12:24:12,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:13,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:13,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970352685] [2023-11-17 12:24:13,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970352685] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:13,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061787094] [2023-11-17 12:24:13,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:24:13,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:13,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:13,227 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:24:13,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-17 12:24:13,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:24:13,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:13,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-17 12:24:13,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:13,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:24:13,603 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-17 12:24:13,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2023-11-17 12:24:13,608 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 27 treesize of output 15 [2023-11-17 12:24:13,688 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 23 treesize of output 7 [2023-11-17 12:24:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:24:13,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:13,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:24:13,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 131 [2023-11-17 12:24:13,933 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 38 treesize of output 32 [2023-11-17 12:24:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-17 12:24:14,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061787094] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:14,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:14,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 8] total 32 [2023-11-17 12:24:14,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129199066] [2023-11-17 12:24:14,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:14,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-17 12:24:14,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:14,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-17 12:24:14,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2023-11-17 12:24:14,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 39 [2023-11-17 12:24:14,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 628 transitions, 10635 flow. Second operand has 34 states, 34 states have (on average 7.088235294117647) internal successors, (241), 34 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:14,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:14,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 39 [2023-11-17 12:24:14,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:17,329 INFO L124 PetriNetUnfolderBase]: 6821/11758 cut-off events. [2023-11-17 12:24:17,329 INFO L125 PetriNetUnfolderBase]: For 205716/205716 co-relation queries the response was YES. [2023-11-17 12:24:17,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97817 conditions, 11758 events. 6821/11758 cut-off events. For 205716/205716 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 84410 event pairs, 528 based on Foata normal form. 9/11739 useless extension candidates. Maximal degree in co-relation 97737. Up to 4308 conditions per place. [2023-11-17 12:24:17,417 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 379 selfloop transitions, 403 changer transitions 28/811 dead transitions. [2023-11-17 12:24:17,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 811 transitions, 15118 flow [2023-11-17 12:24:17,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 12:24:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-17 12:24:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 188 transitions. [2023-11-17 12:24:17,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30128205128205127 [2023-11-17 12:24:17,419 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 188 transitions. [2023-11-17 12:24:17,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 188 transitions. [2023-11-17 12:24:17,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:17,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 188 transitions. [2023-11-17 12:24:17,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 11.75) internal successors, (188), 16 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:17,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 39.0) internal successors, (663), 17 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:17,420 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 39.0) internal successors, (663), 17 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:17,420 INFO L175 Difference]: Start difference. First operand has 230 places, 628 transitions, 10635 flow. Second operand 16 states and 188 transitions. [2023-11-17 12:24:17,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 811 transitions, 15118 flow [2023-11-17 12:24:19,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 811 transitions, 14369 flow, removed 304 selfloop flow, removed 10 redundant places. [2023-11-17 12:24:19,175 INFO L231 Difference]: Finished difference. Result has 238 places, 682 transitions, 12466 flow [2023-11-17 12:24:19,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=10050, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=342, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=12466, PETRI_PLACES=238, PETRI_TRANSITIONS=682} [2023-11-17 12:24:19,176 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 213 predicate places. [2023-11-17 12:24:19,176 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 682 transitions, 12466 flow [2023-11-17 12:24:19,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.088235294117647) internal successors, (241), 34 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:19,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:19,176 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:19,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:19,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-17 12:24:19,381 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:24:19,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:19,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1840862164, now seen corresponding path program 9 times [2023-11-17 12:24:19,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:19,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495107478] [2023-11-17 12:24:19,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:19,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 12:24:19,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:19,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495107478] [2023-11-17 12:24:19,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495107478] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:19,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801326553] [2023-11-17 12:24:19,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:24:19,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:19,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:19,477 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:24:19,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-17 12:24:19,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 12:24:19,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:19,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 12:24:19,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 12:24:19,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-17 12:24:19,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801326553] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:19,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:19,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2023-11-17 12:24:19,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338980465] [2023-11-17 12:24:19,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:19,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 12:24:19,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:19,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 12:24:19,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-17 12:24:19,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2023-11-17 12:24:19,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 682 transitions, 12466 flow. Second operand has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:19,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:19,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2023-11-17 12:24:19,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:22,009 INFO L124 PetriNetUnfolderBase]: 4476/7808 cut-off events. [2023-11-17 12:24:22,009 INFO L125 PetriNetUnfolderBase]: For 160435/160435 co-relation queries the response was YES. [2023-11-17 12:24:22,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68540 conditions, 7808 events. 4476/7808 cut-off events. For 160435/160435 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 53126 event pairs, 740 based on Foata normal form. 140/7760 useless extension candidates. Maximal degree in co-relation 68460. Up to 6462 conditions per place. [2023-11-17 12:24:22,101 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 353 selfloop transitions, 16 changer transitions 176/546 dead transitions. [2023-11-17 12:24:22,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 546 transitions, 11032 flow [2023-11-17 12:24:22,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 12:24:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 12:24:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2023-11-17 12:24:22,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33048433048433046 [2023-11-17 12:24:22,117 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 116 transitions. [2023-11-17 12:24:22,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 116 transitions. [2023-11-17 12:24:22,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:22,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 116 transitions. [2023-11-17 12:24:22,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:22,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:22,119 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:22,119 INFO L175 Difference]: Start difference. First operand has 238 places, 682 transitions, 12466 flow. Second operand 9 states and 116 transitions. [2023-11-17 12:24:22,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 546 transitions, 11032 flow [2023-11-17 12:24:23,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 546 transitions, 9837 flow, removed 239 selfloop flow, removed 27 redundant places. [2023-11-17 12:24:23,213 INFO L231 Difference]: Finished difference. Result has 203 places, 368 transitions, 6030 flow [2023-11-17 12:24:23,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=7872, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6030, PETRI_PLACES=203, PETRI_TRANSITIONS=368} [2023-11-17 12:24:23,214 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 178 predicate places. [2023-11-17 12:24:23,214 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 368 transitions, 6030 flow [2023-11-17 12:24:23,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:23,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:23,215 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:23,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:23,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-17 12:24:23,419 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:24:23,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:23,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1585478775, now seen corresponding path program 10 times [2023-11-17 12:24:23,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:23,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720350968] [2023-11-17 12:24:23,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:23,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:24,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:24,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720350968] [2023-11-17 12:24:24,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720350968] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:24,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555353971] [2023-11-17 12:24:24,416 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:24:24,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:24,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:24,417 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:24:24,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-17 12:24:24,550 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:24:24,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:24,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-17 12:24:24,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:25,203 INFO L349 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2023-11-17 12:24:25,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 56 [2023-11-17 12:24:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:25,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:27,145 INFO L349 Elim1Store]: treesize reduction 144, result has 85.6 percent of original size [2023-11-17 12:24:27,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 237 treesize of output 915 [2023-11-17 12:26:25,863 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 12:26:26,015 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 12:26:26,255 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 12:26:29,141 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 12:26:29,818 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 12:26:30,138 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 12:26:30,213 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 12:26:30,308 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 12:26:31,090 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 12:26:32,552 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 12:26:33,918 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 12:27:23,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-11-17 12:27:23,995 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-17 12:27:23,997 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-17 12:27:24,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-17 12:27:24,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-17 12:27:24,201 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2023-11-17 12:27:24,205 INFO L158 Benchmark]: Toolchain (without parser) took 284662.38ms. Allocated memory was 266.3MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 215.9MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2023-11-17 12:27:24,205 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 208.7MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 12:27:24,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.67ms. Allocated memory is still 266.3MB. Free memory was 215.5MB in the beginning and 203.7MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 12:27:24,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.36ms. Allocated memory is still 266.3MB. Free memory was 203.7MB in the beginning and 201.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 12:27:24,205 INFO L158 Benchmark]: Boogie Preprocessor took 26.95ms. Allocated memory is still 266.3MB. Free memory was 201.6MB in the beginning and 199.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 12:27:24,206 INFO L158 Benchmark]: RCFGBuilder took 618.05ms. Allocated memory is still 266.3MB. Free memory was 199.8MB in the beginning and 212.1MB in the end (delta: -12.4MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2023-11-17 12:27:24,206 INFO L158 Benchmark]: TraceAbstraction took 283719.66ms. Allocated memory was 266.3MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 211.1MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2023-11-17 12:27:24,206 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 208.7MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.67ms. Allocated memory is still 266.3MB. Free memory was 215.5MB in the beginning and 203.7MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.36ms. Allocated memory is still 266.3MB. Free memory was 203.7MB in the beginning and 201.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.95ms. Allocated memory is still 266.3MB. Free memory was 201.6MB in the beginning and 199.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 618.05ms. Allocated memory is still 266.3MB. Free memory was 199.8MB in the beginning and 212.1MB in the end (delta: -12.4MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 283719.66ms. Allocated memory was 266.3MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 211.1MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 31 PlacesBefore, 25 PlacesAfterwards, 29 TransitionsBefore, 23 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 375 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 232, independent: 207, independent conditional: 0, independent unconditional: 207, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 115, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 115, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 232, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 115, unknown conditional: 0, unknown unconditional: 115] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...