/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/array-eq-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:43:48,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:43:48,741 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:43:48,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:43:48,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:43:48,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:43:48,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:43:48,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:43:48,770 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:43:48,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:43:48,774 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:43:48,774 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:43:48,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:43:48,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:43:48,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:43:48,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:43:48,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:43:48,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:43:48,776 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:43:48,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:43:48,777 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:43:48,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:43:48,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:43:48,778 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:43:48,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:43:48,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:43:48,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:43:48,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:43:48,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:43:48,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:43:48,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:43:48,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:43:48,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:43:49,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:43:49,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:43:49,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:43:49,032 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:43:49,032 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:43:49,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/array-eq-trans.wvr.c [2023-11-17 11:43:50,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:43:50,374 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:43:50,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/array-eq-trans.wvr.c [2023-11-17 11:43:50,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1fb3a20/43564119a94d4ec4aac5c9779ade6198/FLAG95ebcad9a [2023-11-17 11:43:50,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1fb3a20/43564119a94d4ec4aac5c9779ade6198 [2023-11-17 11:43:50,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:43:50,394 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:43:50,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:43:50,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:43:50,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:43:50,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:43:50" (1/1) ... [2023-11-17 11:43:50,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c41e5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:50, skipping insertion in model container [2023-11-17 11:43:50,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:43:50" (1/1) ... [2023-11-17 11:43:50,427 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:43:50,581 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/array-eq-trans.wvr.c[2776,2789] [2023-11-17 11:43:50,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:43:50,601 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:43:50,620 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/array-eq-trans.wvr.c[2776,2789] [2023-11-17 11:43:50,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:43:50,635 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:43:50,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:50 WrapperNode [2023-11-17 11:43:50,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:43:50,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:43:50,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:43:50,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:43:50,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:50" (1/1) ... [2023-11-17 11:43:50,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:50" (1/1) ... [2023-11-17 11:43:50,677 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 212 [2023-11-17 11:43:50,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:43:50,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:43:50,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:43:50,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:43:50,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:50" (1/1) ... [2023-11-17 11:43:50,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:50" (1/1) ... [2023-11-17 11:43:50,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:50" (1/1) ... [2023-11-17 11:43:50,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:50" (1/1) ... [2023-11-17 11:43:50,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:50" (1/1) ... [2023-11-17 11:43:50,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:50" (1/1) ... [2023-11-17 11:43:50,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:50" (1/1) ... [2023-11-17 11:43:50,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:50" (1/1) ... [2023-11-17 11:43:50,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:43:50,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:43:50,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:43:50,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:43:50,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:50" (1/1) ... [2023-11-17 11:43:50,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:43:50,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:43:50,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:43:50,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:43:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:43:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 11:43:50,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 11:43:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 11:43:50,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 11:43:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 11:43:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 11:43:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:43:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:43:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:43:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 11:43:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:43:50,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:43:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 11:43:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:43:50,784 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:43:50,919 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:43:50,921 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:43:51,286 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:43:51,646 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:43:51,646 INFO L307 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-17 11:43:51,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:43:51 BoogieIcfgContainer [2023-11-17 11:43:51,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:43:51,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:43:51,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:43:51,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:43:51,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:43:50" (1/3) ... [2023-11-17 11:43:51,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cf5023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:43:51, skipping insertion in model container [2023-11-17 11:43:51,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:50" (2/3) ... [2023-11-17 11:43:51,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cf5023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:43:51, skipping insertion in model container [2023-11-17 11:43:51,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:43:51" (3/3) ... [2023-11-17 11:43:51,654 INFO L112 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2023-11-17 11:43:51,670 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:43:51,671 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 11:43:51,671 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:43:51,727 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 11:43:51,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 42 transitions, 105 flow [2023-11-17 11:43:51,801 INFO L124 PetriNetUnfolderBase]: 9/39 cut-off events. [2023-11-17 11:43:51,802 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 11:43:51,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 9/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-11-17 11:43:51,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 42 transitions, 105 flow [2023-11-17 11:43:51,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 38 transitions, 94 flow [2023-11-17 11:43:51,818 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:43:51,827 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 38 transitions, 94 flow [2023-11-17 11:43:51,829 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 38 transitions, 94 flow [2023-11-17 11:43:51,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 94 flow [2023-11-17 11:43:51,844 INFO L124 PetriNetUnfolderBase]: 9/38 cut-off events. [2023-11-17 11:43:51,845 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 11:43:51,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 9/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-11-17 11:43:51,846 INFO L119 LiptonReduction]: Number of co-enabled transitions 396 [2023-11-17 11:43:53,399 INFO L134 LiptonReduction]: Checked pairs total: 489 [2023-11-17 11:43:53,399 INFO L136 LiptonReduction]: Total number of compositions: 16 [2023-11-17 11:43:53,417 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:43:53,424 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;@7b9bccf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:43:53,424 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 11:43:53,438 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:43:53,439 INFO L124 PetriNetUnfolderBase]: 6/27 cut-off events. [2023-11-17 11:43:53,439 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 11:43:53,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:53,440 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 11:43:53,440 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 11:43:53,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1172739133, now seen corresponding path program 1 times [2023-11-17 11:43:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:53,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300375173] [2023-11-17 11:43:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:54,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:54,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:54,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300375173] [2023-11-17 11:43:54,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300375173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:54,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:54,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:43:54,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479820770] [2023-11-17 11:43:54,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:54,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:43:54,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:54,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:43:54,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:43:54,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 58 [2023-11-17 11:43:54,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:54,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:54,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 58 [2023-11-17 11:43:54,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:54,307 INFO L124 PetriNetUnfolderBase]: 420/620 cut-off events. [2023-11-17 11:43:54,307 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-17 11:43:54,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 620 events. 420/620 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2262 event pairs, 198 based on Foata normal form. 1/398 useless extension candidates. Maximal degree in co-relation 549. Up to 347 conditions per place. [2023-11-17 11:43:54,316 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 24 selfloop transitions, 2 changer transitions 25/54 dead transitions. [2023-11-17 11:43:54,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 246 flow [2023-11-17 11:43:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:43:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:43:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2023-11-17 11:43:54,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30344827586206896 [2023-11-17 11:43:54,330 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 88 transitions. [2023-11-17 11:43:54,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 88 transitions. [2023-11-17 11:43:54,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:54,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 88 transitions. [2023-11-17 11:43:54,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:54,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:54,339 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:54,341 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 5 states and 88 transitions. [2023-11-17 11:43:54,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 246 flow [2023-11-17 11:43:54,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 54 transitions, 222 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-17 11:43:54,349 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 86 flow [2023-11-17 11:43:54,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2023-11-17 11:43:54,354 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2023-11-17 11:43:54,354 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 86 flow [2023-11-17 11:43:54,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:54,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:54,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:43:54,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:43:54,355 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 11:43:54,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:54,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1087479531, now seen corresponding path program 1 times [2023-11-17 11:43:54,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:54,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202484152] [2023-11-17 11:43:54,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:54,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:54,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:54,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202484152] [2023-11-17 11:43:54,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202484152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:54,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:54,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:43:54,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84006039] [2023-11-17 11:43:54,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:54,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:43:54,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:54,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:43:54,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:43:54,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 58 [2023-11-17 11:43:54,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:54,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:54,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 58 [2023-11-17 11:43:54,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:54,992 INFO L124 PetriNetUnfolderBase]: 527/771 cut-off events. [2023-11-17 11:43:54,993 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2023-11-17 11:43:54,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 771 events. 527/771 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2897 event pairs, 158 based on Foata normal form. 1/600 useless extension candidates. Maximal degree in co-relation 1668. Up to 303 conditions per place. [2023-11-17 11:43:54,997 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 39 selfloop transitions, 5 changer transitions 21/68 dead transitions. [2023-11-17 11:43:54,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 68 transitions, 323 flow [2023-11-17 11:43:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:43:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:43:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2023-11-17 11:43:54,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2023-11-17 11:43:54,999 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 116 transitions. [2023-11-17 11:43:54,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 116 transitions. [2023-11-17 11:43:55,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:55,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 116 transitions. [2023-11-17 11:43:55,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 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 11:43:55,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 58.0) internal successors, (464), 8 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:55,002 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 58.0) internal successors, (464), 8 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:55,002 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 86 flow. Second operand 7 states and 116 transitions. [2023-11-17 11:43:55,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 68 transitions, 323 flow [2023-11-17 11:43:55,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 68 transitions, 289 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-11-17 11:43:55,005 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 104 flow [2023-11-17 11:43:55,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-11-17 11:43:55,006 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-11-17 11:43:55,006 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 104 flow [2023-11-17 11:43:55,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:55,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:55,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:43:55,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:43:55,007 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 11:43:55,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash -964580323, now seen corresponding path program 1 times [2023-11-17 11:43:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:55,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435985115] [2023-11-17 11:43:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 11:43:55,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:55,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435985115] [2023-11-17 11:43:55,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435985115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:55,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:55,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:43:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63811459] [2023-11-17 11:43:55,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:55,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:43:55,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:55,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:43:55,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:43:55,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 58 [2023-11-17 11:43:55,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 104 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:55,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:55,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 58 [2023-11-17 11:43:55,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:55,487 INFO L124 PetriNetUnfolderBase]: 637/981 cut-off events. [2023-11-17 11:43:55,487 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2023-11-17 11:43:55,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 981 events. 637/981 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4297 event pairs, 230 based on Foata normal form. 2/744 useless extension candidates. Maximal degree in co-relation 2166. Up to 385 conditions per place. [2023-11-17 11:43:55,492 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 39 selfloop transitions, 6 changer transitions 18/66 dead transitions. [2023-11-17 11:43:55,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 66 transitions, 330 flow [2023-11-17 11:43:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:43:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:43:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2023-11-17 11:43:55,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.270935960591133 [2023-11-17 11:43:55,497 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 110 transitions. [2023-11-17 11:43:55,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 110 transitions. [2023-11-17 11:43:55,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:55,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 110 transitions. [2023-11-17 11:43:55,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:55,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 58.0) internal successors, (464), 8 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:55,501 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 58.0) internal successors, (464), 8 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:55,502 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 104 flow. Second operand 7 states and 110 transitions. [2023-11-17 11:43:55,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 66 transitions, 330 flow [2023-11-17 11:43:55,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 66 transitions, 304 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-17 11:43:55,506 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 122 flow [2023-11-17 11:43:55,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=122, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-11-17 11:43:55,507 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-11-17 11:43:55,507 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 122 flow [2023-11-17 11:43:55,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:43:55,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:55,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:43:55,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:43:55,508 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 11:43:55,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:55,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1789223257, now seen corresponding path program 1 times [2023-11-17 11:43:55,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:55,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513069264] [2023-11-17 11:43:55,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:55,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:56,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:56,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513069264] [2023-11-17 11:43:56,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513069264] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:43:56,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259152629] [2023-11-17 11:43:56,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:56,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:43:56,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:43:56,721 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:43:56,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-17 11:43:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:56,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-17 11:43:56,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:43:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:57,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:43:57,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:43:57,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 162 treesize of output 342 [2023-11-17 11:44:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:44:18,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259152629] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 11:44:18,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 11:44:18,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 16 [2023-11-17 11:44:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153382415] [2023-11-17 11:44:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:44:18,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:44:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:44:18,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:44:18,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2023-11-17 11:44:18,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 58 [2023-11-17 11:44:18,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 122 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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 11:44:18,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:44:18,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 58 [2023-11-17 11:44:18,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:44:19,068 INFO L124 PetriNetUnfolderBase]: 508/753 cut-off events. [2023-11-17 11:44:19,069 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2023-11-17 11:44:19,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1811 conditions, 753 events. 508/753 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2880 event pairs, 97 based on Foata normal form. 1/641 useless extension candidates. Maximal degree in co-relation 1786. Up to 659 conditions per place. [2023-11-17 11:44:19,073 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 40 selfloop transitions, 5 changer transitions 1/49 dead transitions. [2023-11-17 11:44:19,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 256 flow [2023-11-17 11:44:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:44:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:44:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2023-11-17 11:44:19,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30603448275862066 [2023-11-17 11:44:19,074 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 71 transitions. [2023-11-17 11:44:19,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 71 transitions. [2023-11-17 11:44:19,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:44:19,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 71 transitions. [2023-11-17 11:44:19,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:44:19,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:44:19,076 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:44:19,076 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 122 flow. Second operand 4 states and 71 transitions. [2023-11-17 11:44:19,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 256 flow [2023-11-17 11:44:19,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 243 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-17 11:44:19,078 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 142 flow [2023-11-17 11:44:19,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2023-11-17 11:44:19,079 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-11-17 11:44:19,079 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 142 flow [2023-11-17 11:44:19,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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 11:44:19,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:44:19,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:44:19,089 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 11:44:19,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:44:19,286 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 11:44:19,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:44:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash 64749712, now seen corresponding path program 1 times [2023-11-17 11:44:19,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:44:19,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333141371] [2023-11-17 11:44:19,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:44:19,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:44:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:44:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:44:19,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:44:19,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333141371] [2023-11-17 11:44:19,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333141371] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:44:19,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18683951] [2023-11-17 11:44:19,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:44:19,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:44:19,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:44:19,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:44:19,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 11:44:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:44:19,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-17 11:44:19,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:44:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:44:19,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:44:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:44:19,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18683951] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:44:19,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:44:19,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-11-17 11:44:19,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548072825] [2023-11-17 11:44:19,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:44:19,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-17 11:44:19,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:44:19,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-17 11:44:19,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-17 11:44:19,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 58 [2023-11-17 11:44:19,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 142 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:44:19,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:44:19,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 58 [2023-11-17 11:44:19,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:44:20,082 INFO L124 PetriNetUnfolderBase]: 959/1508 cut-off events. [2023-11-17 11:44:20,083 INFO L125 PetriNetUnfolderBase]: For 821/821 co-relation queries the response was YES. [2023-11-17 11:44:20,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3838 conditions, 1508 events. 959/1508 cut-off events. For 821/821 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7515 event pairs, 454 based on Foata normal form. 60/1566 useless extension candidates. Maximal degree in co-relation 2004. Up to 686 conditions per place. [2023-11-17 11:44:20,091 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 57 selfloop transitions, 5 changer transitions 15/80 dead transitions. [2023-11-17 11:44:20,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 80 transitions, 460 flow [2023-11-17 11:44:20,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:44:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:44:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2023-11-17 11:44:20,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27586206896551724 [2023-11-17 11:44:20,092 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 112 transitions. [2023-11-17 11:44:20,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 112 transitions. [2023-11-17 11:44:20,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:44:20,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 112 transitions. [2023-11-17 11:44:20,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 16.0) internal successors, (112), 7 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 11:44:20,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 58.0) internal successors, (464), 8 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:44:20,094 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 58.0) internal successors, (464), 8 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:44:20,094 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 142 flow. Second operand 7 states and 112 transitions. [2023-11-17 11:44:20,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 80 transitions, 460 flow [2023-11-17 11:44:20,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 80 transitions, 451 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:44:20,099 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 182 flow [2023-11-17 11:44:20,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-11-17 11:44:20,101 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2023-11-17 11:44:20,102 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 182 flow [2023-11-17 11:44:20,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:44:20,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:44:20,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:44:20,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-17 11:44:20,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:44:20,311 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 11:44:20,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:44:20,311 INFO L85 PathProgramCache]: Analyzing trace with hash 187446888, now seen corresponding path program 1 times [2023-11-17 11:44:20,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:44:20,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954931839] [2023-11-17 11:44:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:44:20,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:44:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:44:22,169 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 11:44:22,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:44:22,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954931839] [2023-11-17 11:44:22,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954931839] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:44:22,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149318982] [2023-11-17 11:44:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:44:22,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:44:22,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:44:22,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:44:22,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 11:44:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:44:22,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-17 11:44:22,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:44:22,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:44:22,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:44:22,351 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-17 11:44:22,352 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 2 case distinctions, treesize of input 17 treesize of output 24 [2023-11-17 11:44:22,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:44:22,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:44:22,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:44:22,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:44:22,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:44:22,581 INFO L349 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2023-11-17 11:44:22,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 45 [2023-11-17 11:44:22,742 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 11:44:22,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:44:22,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:44:22,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:44:22,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:44:22,942 INFO L349 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2023-11-17 11:44:22,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 56 [2023-11-17 11:44:23,136 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 11:44:23,231 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 11:44:23,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:44:23,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:44:23,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-17 11:44:23,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:44:23,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:44:23,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-17 11:44:23,847 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 11:44:23,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:44:26,352 INFO L349 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-11-17 11:44:26,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 304 treesize of output 146 [2023-11-17 11:44:26,358 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 11:44:26,762 INFO L349 Elim1Store]: treesize reduction 26, result has 90.5 percent of original size [2023-11-17 11:44:26,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 477250 treesize of output 458465 [2023-11-17 11:44:27,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:44:27,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7720 treesize of output 7582 [2023-11-17 11:44:27,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:44:27,856 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 7453 treesize of output 5947 [2023-11-17 11:44:28,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:44:28,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 6066 treesize of output 5698 [2023-11-17 11:44:28,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:44:28,402 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 5485 treesize of output 4683 [2023-11-17 11:47:26,976 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 11:47:26,978 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-17 11:47:26,978 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 11:47:26,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 11:47:27,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:47:27,179 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 11:47:27,185 INFO L158 Benchmark]: Toolchain (without parser) took 216791.35ms. Allocated memory was 305.1MB in the beginning and 987.8MB in the end (delta: 682.6MB). Free memory was 248.8MB in the beginning and 577.4MB in the end (delta: -328.6MB). Peak memory consumption was 599.2MB. Max. memory is 8.0GB. [2023-11-17 11:47:27,186 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:47:27,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.82ms. Allocated memory is still 305.1MB. Free memory was 248.5MB in the beginning and 236.6MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 11:47:27,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.77ms. Allocated memory is still 305.1MB. Free memory was 236.6MB in the beginning and 234.1MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:47:27,186 INFO L158 Benchmark]: Boogie Preprocessor took 31.85ms. Allocated memory is still 305.1MB. Free memory was 234.1MB in the beginning and 232.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:47:27,187 INFO L158 Benchmark]: RCFGBuilder took 936.76ms. Allocated memory is still 305.1MB. Free memory was 232.0MB in the beginning and 210.3MB in the end (delta: 21.7MB). Peak memory consumption was 31.0MB. Max. memory is 8.0GB. [2023-11-17 11:47:27,187 INFO L158 Benchmark]: TraceAbstraction took 215535.61ms. Allocated memory was 305.1MB in the beginning and 987.8MB in the end (delta: 682.6MB). Free memory was 209.3MB in the beginning and 577.4MB in the end (delta: -368.1MB). Peak memory consumption was 558.8MB. Max. memory is 8.0GB. [2023-11-17 11:47:27,188 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.12ms. Allocated memory is still 189.8MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.82ms. Allocated memory is still 305.1MB. Free memory was 248.5MB in the beginning and 236.6MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.77ms. Allocated memory is still 305.1MB. Free memory was 236.6MB in the beginning and 234.1MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.85ms. Allocated memory is still 305.1MB. Free memory was 234.1MB in the beginning and 232.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 936.76ms. Allocated memory is still 305.1MB. Free memory was 232.0MB in the beginning and 210.3MB in the end (delta: 21.7MB). Peak memory consumption was 31.0MB. Max. memory is 8.0GB. * TraceAbstraction took 215535.61ms. Allocated memory was 305.1MB in the beginning and 987.8MB in the end (delta: 682.6MB). Free memory was 209.3MB in the beginning and 577.4MB in the end (delta: -368.1MB). Peak memory consumption was 558.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 39 PlacesBefore, 32 PlacesAfterwards, 38 TransitionsBefore, 28 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 16 TotalNumberOfCompositions, 489 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 372, independent: 359, independent conditional: 0, independent unconditional: 359, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 246, independent: 236, independent conditional: 0, independent unconditional: 236, 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: 246, independent: 236, independent conditional: 0, independent unconditional: 236, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 372, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 246, unknown conditional: 0, unknown unconditional: 246] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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...