/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 00:31:04,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 00:31:04,259 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-VariableLbe.epf [2023-08-24 00:31:04,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 00:31:04,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 00:31:04,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 00:31:04,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 00:31:04,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 00:31:04,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 00:31:04,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 00:31:04,300 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 00:31:04,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 00:31:04,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 00:31:04,302 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 00:31:04,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 00:31:04,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 00:31:04,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 00:31:04,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 00:31:04,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 00:31:04,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 00:31:04,303 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 00:31:04,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 00:31:04,304 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 00:31:04,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 00:31:04,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 00:31:04,305 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 00:31:04,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 00:31:04,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 00:31:04,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 00:31:04,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 00:31:04,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 00:31:04,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 00:31:04,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 00:31:04,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 00:31:04,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 00:31:04,308 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-08-24 00:31:04,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 00:31:04,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 00:31:04,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 00:31:04,620 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 00:31:04,620 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 00:31:04,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-08-24 00:31:05,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 00:31:05,988 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 00:31:05,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-08-24 00:31:05,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a8e66046/e26f863a1ae548d498919713be1ba347/FLAG8defe1304 [2023-08-24 00:31:06,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a8e66046/e26f863a1ae548d498919713be1ba347 [2023-08-24 00:31:06,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 00:31:06,016 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 00:31:06,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 00:31:06,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 00:31:06,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 00:31:06,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 12:31:06" (1/1) ... [2023-08-24 00:31:06,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4815c463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:31:06, skipping insertion in model container [2023-08-24 00:31:06,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 12:31:06" (1/1) ... [2023-08-24 00:31:06,043 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 00:31:06,187 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/bench-exp1x3.wvr.c[1849,1862] [2023-08-24 00:31:06,189 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 00:31:06,198 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 00:31:06,220 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/bench-exp1x3.wvr.c[1849,1862] [2023-08-24 00:31:06,227 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 00:31:06,243 INFO L206 MainTranslator]: Completed translation [2023-08-24 00:31:06,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:31:06 WrapperNode [2023-08-24 00:31:06,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 00:31:06,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 00:31:06,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 00:31:06,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 00:31:06,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:31:06" (1/1) ... [2023-08-24 00:31:06,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:31:06" (1/1) ... [2023-08-24 00:31:06,279 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2023-08-24 00:31:06,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 00:31:06,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 00:31:06,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 00:31:06,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 00:31:06,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:31:06" (1/1) ... [2023-08-24 00:31:06,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:31:06" (1/1) ... [2023-08-24 00:31:06,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:31:06" (1/1) ... [2023-08-24 00:31:06,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:31:06" (1/1) ... [2023-08-24 00:31:06,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:31:06" (1/1) ... [2023-08-24 00:31:06,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:31:06" (1/1) ... [2023-08-24 00:31:06,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:31:06" (1/1) ... [2023-08-24 00:31:06,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:31:06" (1/1) ... [2023-08-24 00:31:06,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 00:31:06,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 00:31:06,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 00:31:06,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 00:31:06,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:31:06" (1/1) ... [2023-08-24 00:31:06,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 00:31:06,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:31:06,358 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-08-24 00:31:06,380 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-08-24 00:31:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 00:31:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 00:31:06,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 00:31:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 00:31:06,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 00:31:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 00:31:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 00:31:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 00:31:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 00:31:06,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 00:31:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 00:31:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 00:31:06,402 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 00:31:06,502 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 00:31:06,503 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 00:31:06,647 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 00:31:06,653 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 00:31:06,653 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-24 00:31:06,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 12:31:06 BoogieIcfgContainer [2023-08-24 00:31:06,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 00:31:06,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 00:31:06,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 00:31:06,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 00:31:06,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 12:31:06" (1/3) ... [2023-08-24 00:31:06,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c10bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 12:31:06, skipping insertion in model container [2023-08-24 00:31:06,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:31:06" (2/3) ... [2023-08-24 00:31:06,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c10bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 12:31:06, skipping insertion in model container [2023-08-24 00:31:06,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 12:31:06" (3/3) ... [2023-08-24 00:31:06,663 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2023-08-24 00:31:06,678 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 00:31:06,678 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 00:31:06,678 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 00:31:06,723 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 00:31:06,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 170 flow [2023-08-24 00:31:06,794 INFO L124 PetriNetUnfolderBase]: 6/75 cut-off events. [2023-08-24 00:31:06,794 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 00:31:06,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 6/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2023-08-24 00:31:06,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 170 flow [2023-08-24 00:31:06,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 146 flow [2023-08-24 00:31:06,806 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 00:31:06,818 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 67 transitions, 146 flow [2023-08-24 00:31:06,821 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 67 transitions, 146 flow [2023-08-24 00:31:06,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 146 flow [2023-08-24 00:31:06,846 INFO L124 PetriNetUnfolderBase]: 6/67 cut-off events. [2023-08-24 00:31:06,846 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 00:31:06,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 67 events. 6/67 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2023-08-24 00:31:06,848 INFO L119 LiptonReduction]: Number of co-enabled transitions 252 [2023-08-24 00:31:08,886 INFO L134 LiptonReduction]: Checked pairs total: 297 [2023-08-24 00:31:08,886 INFO L136 LiptonReduction]: Total number of compositions: 65 [2023-08-24 00:31:08,899 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 00:31:08,904 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=LoopsAndPotentialCycles, 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;@52979b08, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 00:31:08,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-24 00:31:08,908 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 00:31:08,909 INFO L124 PetriNetUnfolderBase]: 2/12 cut-off events. [2023-08-24 00:31:08,909 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 00:31:08,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:31:08,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:31:08,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 00:31:08,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:31:08,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1136073076, now seen corresponding path program 1 times [2023-08-24 00:31:08,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:31:08,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652942343] [2023-08-24 00:31:08,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:31:08,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:31:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:31:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:31:09,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:31:09,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652942343] [2023-08-24 00:31:09,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652942343] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:31:09,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:31:09,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 00:31:09,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118149337] [2023-08-24 00:31:09,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:31:09,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 00:31:09,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:31:09,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 00:31:09,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 00:31:09,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 142 [2023-08-24 00:31:09,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:09,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:31:09,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 142 [2023-08-24 00:31:09,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:31:09,480 INFO L124 PetriNetUnfolderBase]: 41/77 cut-off events. [2023-08-24 00:31:09,481 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-24 00:31:09,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 77 events. 41/77 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 165 event pairs, 9 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 120. Up to 51 conditions per place. [2023-08-24 00:31:09,485 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 19 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2023-08-24 00:31:09,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 23 transitions, 113 flow [2023-08-24 00:31:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 00:31:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 00:31:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2023-08-24 00:31:09,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4507042253521127 [2023-08-24 00:31:09,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 192 transitions. [2023-08-24 00:31:09,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 192 transitions. [2023-08-24 00:31:09,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:31:09,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 192 transitions. [2023-08-24 00:31:09,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:09,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:09,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:09,518 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 38 flow. Second operand 3 states and 192 transitions. [2023-08-24 00:31:09,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 23 transitions, 113 flow [2023-08-24 00:31:09,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 23 transitions, 99 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 00:31:09,522 INFO L231 Difference]: Finished difference. Result has 17 places, 15 transitions, 49 flow [2023-08-24 00:31:09,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=17, PETRI_TRANSITIONS=15} [2023-08-24 00:31:09,528 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, -1 predicate places. [2023-08-24 00:31:09,528 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 15 transitions, 49 flow [2023-08-24 00:31:09,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:09,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:31:09,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:31:09,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 00:31:09,529 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 00:31:09,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:31:09,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1884749856, now seen corresponding path program 1 times [2023-08-24 00:31:09,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:31:09,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656389065] [2023-08-24 00:31:09,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:31:09,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:31:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:31:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:31:09,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:31:09,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656389065] [2023-08-24 00:31:09,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656389065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:31:09,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:31:09,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 00:31:09,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660378913] [2023-08-24 00:31:09,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:31:09,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 00:31:09,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:31:09,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 00:31:09,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 00:31:09,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-08-24 00:31:09,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 49 flow. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:09,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:31:09,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-08-24 00:31:09,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:31:09,793 INFO L124 PetriNetUnfolderBase]: 39/75 cut-off events. [2023-08-24 00:31:09,793 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-24 00:31:09,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 75 events. 39/75 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 165 event pairs, 2 based on Foata normal form. 2/77 useless extension candidates. Maximal degree in co-relation 55. Up to 28 conditions per place. [2023-08-24 00:31:09,794 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 24 selfloop transitions, 6 changer transitions 4/34 dead transitions. [2023-08-24 00:31:09,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 34 transitions, 165 flow [2023-08-24 00:31:09,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 00:31:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 00:31:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2023-08-24 00:31:09,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4295774647887324 [2023-08-24 00:31:09,797 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 305 transitions. [2023-08-24 00:31:09,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 305 transitions. [2023-08-24 00:31:09,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:31:09,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 305 transitions. [2023-08-24 00:31:09,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:09,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:09,801 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:09,801 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 49 flow. Second operand 5 states and 305 transitions. [2023-08-24 00:31:09,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 34 transitions, 165 flow [2023-08-24 00:31:09,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 34 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 00:31:09,802 INFO L231 Difference]: Finished difference. Result has 21 places, 17 transitions, 70 flow [2023-08-24 00:31:09,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=21, PETRI_TRANSITIONS=17} [2023-08-24 00:31:09,803 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2023-08-24 00:31:09,803 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 17 transitions, 70 flow [2023-08-24 00:31:09,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:09,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:31:09,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:31:09,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 00:31:09,804 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 00:31:09,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:31:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1479151157, now seen corresponding path program 1 times [2023-08-24 00:31:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:31:09,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537182868] [2023-08-24 00:31:09,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:31:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:31:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:31:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:31:09,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:31:09,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537182868] [2023-08-24 00:31:09,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537182868] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:31:09,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:31:09,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 00:31:09,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441558451] [2023-08-24 00:31:09,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:31:09,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 00:31:09,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:31:09,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 00:31:09,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 00:31:09,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-08-24 00:31:09,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:09,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:31:09,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-08-24 00:31:09,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:31:10,004 INFO L124 PetriNetUnfolderBase]: 32/66 cut-off events. [2023-08-24 00:31:10,004 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-08-24 00:31:10,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 66 events. 32/66 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 140 event pairs, 6 based on Foata normal form. 4/70 useless extension candidates. Maximal degree in co-relation 57. Up to 45 conditions per place. [2023-08-24 00:31:10,005 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 15 selfloop transitions, 3 changer transitions 8/26 dead transitions. [2023-08-24 00:31:10,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 26 transitions, 142 flow [2023-08-24 00:31:10,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 00:31:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 00:31:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2023-08-24 00:31:10,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4278169014084507 [2023-08-24 00:31:10,008 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 243 transitions. [2023-08-24 00:31:10,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 243 transitions. [2023-08-24 00:31:10,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:31:10,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 243 transitions. [2023-08-24 00:31:10,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:10,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:10,012 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:10,012 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 70 flow. Second operand 4 states and 243 transitions. [2023-08-24 00:31:10,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 26 transitions, 142 flow [2023-08-24 00:31:10,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 139 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 00:31:10,014 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 62 flow [2023-08-24 00:31:10,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-08-24 00:31:10,016 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2023-08-24 00:31:10,018 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 62 flow [2023-08-24 00:31:10,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:10,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:31:10,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:31:10,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 00:31:10,019 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 00:31:10,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:31:10,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1582616416, now seen corresponding path program 2 times [2023-08-24 00:31:10,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:31:10,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845223992] [2023-08-24 00:31:10,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:31:10,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:31:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:31:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:31:10,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:31:10,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845223992] [2023-08-24 00:31:10,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845223992] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:31:10,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983103876] [2023-08-24 00:31:10,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 00:31:10,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:31:10,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:31:10,121 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-08-24 00:31:10,151 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-08-24 00:31:10,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 00:31:10,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 00:31:10,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 00:31:10,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:31:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:31:10,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:31:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:31:10,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983103876] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:31:10,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:31:10,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-24 00:31:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577038289] [2023-08-24 00:31:10,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:31:10,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 00:31:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:31:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 00:31:10,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 00:31:10,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-08-24 00:31:10,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:10,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:31:10,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-08-24 00:31:10,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:31:10,513 INFO L124 PetriNetUnfolderBase]: 34/63 cut-off events. [2023-08-24 00:31:10,513 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-24 00:31:10,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 63 events. 34/63 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 4 based on Foata normal form. 6/69 useless extension candidates. Maximal degree in co-relation 49. Up to 39 conditions per place. [2023-08-24 00:31:10,514 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 22 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2023-08-24 00:31:10,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 155 flow [2023-08-24 00:31:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 00:31:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 00:31:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 300 transitions. [2023-08-24 00:31:10,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4225352112676056 [2023-08-24 00:31:10,516 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 300 transitions. [2023-08-24 00:31:10,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 300 transitions. [2023-08-24 00:31:10,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:31:10,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 300 transitions. [2023-08-24 00:31:10,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:10,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:10,519 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:10,519 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 62 flow. Second operand 5 states and 300 transitions. [2023-08-24 00:31:10,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 155 flow [2023-08-24 00:31:10,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 147 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 00:31:10,521 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 91 flow [2023-08-24 00:31:10,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2023-08-24 00:31:10,522 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2023-08-24 00:31:10,522 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 91 flow [2023-08-24 00:31:10,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:10,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:31:10,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:31:10,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-24 00:31:10,728 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-08-24 00:31:10,729 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 00:31:10,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:31:10,729 INFO L85 PathProgramCache]: Analyzing trace with hash 410010517, now seen corresponding path program 2 times [2023-08-24 00:31:10,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:31:10,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549165493] [2023-08-24 00:31:10,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:31:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:31:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:31:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:31:10,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:31:10,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549165493] [2023-08-24 00:31:10,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549165493] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:31:10,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:31:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 00:31:10,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046699926] [2023-08-24 00:31:10,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:31:10,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 00:31:10,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:31:10,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 00:31:10,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 00:31:10,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 142 [2023-08-24 00:31:10,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:10,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:31:10,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 142 [2023-08-24 00:31:10,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:31:10,997 INFO L124 PetriNetUnfolderBase]: 40/73 cut-off events. [2023-08-24 00:31:10,997 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-08-24 00:31:11,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 73 events. 40/73 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 136 event pairs, 4 based on Foata normal form. 4/77 useless extension candidates. Maximal degree in co-relation 119. Up to 61 conditions per place. [2023-08-24 00:31:11,000 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 21 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2023-08-24 00:31:11,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 178 flow [2023-08-24 00:31:11,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 00:31:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 00:31:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 271 transitions. [2023-08-24 00:31:11,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3816901408450704 [2023-08-24 00:31:11,003 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 271 transitions. [2023-08-24 00:31:11,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 271 transitions. [2023-08-24 00:31:11,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:31:11,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 271 transitions. [2023-08-24 00:31:11,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:11,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:11,006 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:11,006 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 91 flow. Second operand 5 states and 271 transitions. [2023-08-24 00:31:11,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 178 flow [2023-08-24 00:31:11,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 173 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 00:31:11,010 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 127 flow [2023-08-24 00:31:11,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-08-24 00:31:11,012 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 12 predicate places. [2023-08-24 00:31:11,013 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 127 flow [2023-08-24 00:31:11,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:11,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:31:11,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:31:11,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 00:31:11,013 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 00:31:11,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:31:11,014 INFO L85 PathProgramCache]: Analyzing trace with hash 656812837, now seen corresponding path program 1 times [2023-08-24 00:31:11,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:31:11,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583303705] [2023-08-24 00:31:11,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:31:11,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:31:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:31:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:31:11,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:31:11,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583303705] [2023-08-24 00:31:11,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583303705] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:31:11,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739735520] [2023-08-24 00:31:11,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:31:11,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:31:11,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:31:11,387 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-08-24 00:31:11,449 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-08-24 00:31:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:31:11,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-24 00:31:11,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:31:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:31:36,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:31:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:31:47,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739735520] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:31:47,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:31:47,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2023-08-24 00:31:47,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054016170] [2023-08-24 00:31:47,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:31:47,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 00:31:47,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:31:47,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 00:31:47,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=147, Unknown=11, NotChecked=0, Total=210 [2023-08-24 00:31:47,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-08-24 00:31:47,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 127 flow. Second operand has 15 states, 15 states have (on average 56.333333333333336) internal successors, (845), 15 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:31:47,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:31:47,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-08-24 00:31:47,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:31:49,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:31:50,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:32:00,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:32:08,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:32:10,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:32:12,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:32:27,047 WARN L234 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 60 DAG size of output: 16 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 00:32:31,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:32:33,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:32:35,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:32:50,092 WARN L234 SmtUtils]: Spent 12.37s on a formula simplification. DAG size of input: 32 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 00:32:52,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:33:06,842 WARN L234 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 69 DAG size of output: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 00:33:25,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:33:31,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:33:34,724 INFO L124 PetriNetUnfolderBase]: 153/296 cut-off events. [2023-08-24 00:33:34,724 INFO L125 PetriNetUnfolderBase]: For 633/633 co-relation queries the response was YES. [2023-08-24 00:33:34,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 296 events. 153/296 cut-off events. For 633/633 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1142 event pairs, 4 based on Foata normal form. 13/309 useless extension candidates. Maximal degree in co-relation 590. Up to 103 conditions per place. [2023-08-24 00:33:34,727 INFO L140 encePairwiseOnDemand]: 135/142 looper letters, 61 selfloop transitions, 34 changer transitions 20/115 dead transitions. [2023-08-24 00:33:34,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 115 transitions, 808 flow [2023-08-24 00:33:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-24 00:33:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-24 00:33:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1083 transitions. [2023-08-24 00:33:34,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42370892018779344 [2023-08-24 00:33:34,731 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1083 transitions. [2023-08-24 00:33:34,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1083 transitions. [2023-08-24 00:33:34,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:33:34,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1083 transitions. [2023-08-24 00:33:34,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 60.166666666666664) internal successors, (1083), 18 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:34,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 142.0) internal successors, (2698), 19 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:34,739 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 142.0) internal successors, (2698), 19 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:34,739 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 127 flow. Second operand 18 states and 1083 transitions. [2023-08-24 00:33:34,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 115 transitions, 808 flow [2023-08-24 00:33:34,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 115 transitions, 781 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-24 00:33:34,743 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 479 flow [2023-08-24 00:33:34,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=479, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-08-24 00:33:34,744 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 41 predicate places. [2023-08-24 00:33:34,744 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 479 flow [2023-08-24 00:33:34,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 56.333333333333336) internal successors, (845), 15 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:34,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:33:34,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:33:34,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-24 00:33:34,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-24 00:33:34,946 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 00:33:34,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:33:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1905891163, now seen corresponding path program 2 times [2023-08-24 00:33:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:33:34,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140381115] [2023-08-24 00:33:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:33:34,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:33:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:33:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:35,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:33:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140381115] [2023-08-24 00:33:35,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140381115] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:33:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258206027] [2023-08-24 00:33:35,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 00:33:35,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:33:35,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:33:35,265 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-08-24 00:33:35,267 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-08-24 00:33:35,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 00:33:35,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 00:33:35,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-24 00:33:35,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:33:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:43,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:33:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:45,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258206027] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:33:45,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:33:45,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2023-08-24 00:33:45,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373273088] [2023-08-24 00:33:45,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:33:45,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 00:33:45,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:33:45,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 00:33:45,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=150, Unknown=2, NotChecked=0, Total=210 [2023-08-24 00:33:45,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-08-24 00:33:45,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 479 flow. Second operand has 15 states, 15 states have (on average 56.333333333333336) internal successors, (845), 15 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:45,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:33:45,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-08-24 00:33:45,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:34:00,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:06,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:16,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:17,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:22,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:24,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:28,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:30,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:32,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:33,247 INFO L124 PetriNetUnfolderBase]: 226/449 cut-off events. [2023-08-24 00:34:33,247 INFO L125 PetriNetUnfolderBase]: For 3789/3789 co-relation queries the response was YES. [2023-08-24 00:34:33,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2600 conditions, 449 events. 226/449 cut-off events. For 3789/3789 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2049 event pairs, 24 based on Foata normal form. 5/454 useless extension candidates. Maximal degree in co-relation 2525. Up to 246 conditions per place. [2023-08-24 00:34:33,253 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 95 selfloop transitions, 33 changer transitions 13/141 dead transitions. [2023-08-24 00:34:33,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 141 transitions, 1407 flow [2023-08-24 00:34:33,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-24 00:34:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-24 00:34:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1028 transitions. [2023-08-24 00:34:33,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258492129246065 [2023-08-24 00:34:33,259 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1028 transitions. [2023-08-24 00:34:33,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1028 transitions. [2023-08-24 00:34:33,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:34:33,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1028 transitions. [2023-08-24 00:34:33,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 60.470588235294116) internal successors, (1028), 17 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:34:33,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 142.0) internal successors, (2556), 18 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:34:33,266 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 142.0) internal successors, (2556), 18 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:34:33,266 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 479 flow. Second operand 17 states and 1028 transitions. [2023-08-24 00:34:33,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 141 transitions, 1407 flow [2023-08-24 00:34:33,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 141 transitions, 1258 flow, removed 73 selfloop flow, removed 2 redundant places. [2023-08-24 00:34:33,284 INFO L231 Difference]: Finished difference. Result has 81 places, 77 transitions, 790 flow [2023-08-24 00:34:33,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=790, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2023-08-24 00:34:33,284 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 63 predicate places. [2023-08-24 00:34:33,285 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 790 flow [2023-08-24 00:34:33,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 56.333333333333336) internal successors, (845), 15 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:34:33,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:34:33,285 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:34:33,293 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-08-24 00:34:33,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:34:33,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 00:34:33,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:34:33,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1594269707, now seen corresponding path program 3 times [2023-08-24 00:34:33,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:34:33,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354175330] [2023-08-24 00:34:33,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:34:33,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:34:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:34:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:34:33,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:34:33,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354175330] [2023-08-24 00:34:33,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354175330] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:34:33,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140374591] [2023-08-24 00:34:33,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 00:34:33,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:34:33,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:34:33,642 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 00:34:33,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 00:34:35,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 00:34:35,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 00:34:35,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-24 00:34:35,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:35:04,694 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~x1~0 2))) (let ((.cse5 (div (* (- 1) .cse0) 2))) (let ((.cse2 (mod c_~x2~0 4294967296)) (.cse1 (+ (mod (* 4294967295 .cse5) 4294967296) 1)) (.cse3 (+ (mod .cse0 4294967296) 1)) (.cse4 (mod c_~x1~0 4294967296))) (and (= (mod .cse0 2) 0) (= (mod c_~x2~0 2) 0) (<= .cse1 .cse2) (= (mod c_~x1~0 2) 0) (<= .cse3 .cse2) (<= .cse1 .cse4) (= (+ .cse5 (* (div (* (- 1) .cse5) 4294967296) 4294967296)) (let ((.cse6 (div (* (- 1) c_~x2~0) 2))) (+ .cse6 (* (div (* (- 1) .cse6) 4294967296) 4294967296)))) (<= .cse3 .cse4))))) is different from false [2023-08-24 00:35:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:35:10,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:35:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:35:17,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140374591] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:35:17,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:35:17,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 16 [2023-08-24 00:35:17,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694908032] [2023-08-24 00:35:17,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:35:17,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-24 00:35:17,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:35:17,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-24 00:35:17,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=164, Unknown=6, NotChecked=28, Total=272 [2023-08-24 00:35:17,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-08-24 00:35:17,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 790 flow. Second operand has 17 states, 17 states have (on average 56.0) internal successors, (952), 17 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:35:17,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:35:17,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-08-24 00:35:17,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:35:20,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:21,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:23,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:25,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:28,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:30,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:32,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:36,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:37,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:40,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:42,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:52,970 WARN L234 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 00:35:55,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:57,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:00,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:02,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:10,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:12,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:14,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:14,895 INFO L124 PetriNetUnfolderBase]: 363/705 cut-off events. [2023-08-24 00:36:14,895 INFO L125 PetriNetUnfolderBase]: For 10321/10321 co-relation queries the response was YES. [2023-08-24 00:36:14,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 705 events. 363/705 cut-off events. For 10321/10321 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3596 event pairs, 8 based on Foata normal form. 54/759 useless extension candidates. Maximal degree in co-relation 4199. Up to 217 conditions per place. [2023-08-24 00:36:14,902 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 104 selfloop transitions, 75 changer transitions 3/182 dead transitions. [2023-08-24 00:36:14,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 182 transitions, 2005 flow [2023-08-24 00:36:14,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-24 00:36:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-24 00:36:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1091 transitions. [2023-08-24 00:36:14,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42683881064162754 [2023-08-24 00:36:14,906 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1091 transitions. [2023-08-24 00:36:14,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1091 transitions. [2023-08-24 00:36:14,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:36:14,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1091 transitions. [2023-08-24 00:36:14,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 60.611111111111114) internal successors, (1091), 18 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:36:14,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 142.0) internal successors, (2698), 19 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:36:14,913 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 142.0) internal successors, (2698), 19 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:36:14,913 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 790 flow. Second operand 18 states and 1091 transitions. [2023-08-24 00:36:14,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 182 transitions, 2005 flow [2023-08-24 00:36:14,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 182 transitions, 1655 flow, removed 169 selfloop flow, removed 6 redundant places. [2023-08-24 00:36:14,942 INFO L231 Difference]: Finished difference. Result has 98 places, 116 transitions, 1214 flow [2023-08-24 00:36:14,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1214, PETRI_PLACES=98, PETRI_TRANSITIONS=116} [2023-08-24 00:36:14,943 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 80 predicate places. [2023-08-24 00:36:14,943 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 116 transitions, 1214 flow [2023-08-24 00:36:14,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 56.0) internal successors, (952), 17 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:36:14,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:36:14,944 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:36:14,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 00:36:15,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:36:15,157 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 00:36:15,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:36:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash -968434293, now seen corresponding path program 4 times [2023-08-24 00:36:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:36:15,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309820819] [2023-08-24 00:36:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:36:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:36:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:36:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:36:15,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:36:15,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309820819] [2023-08-24 00:36:15,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309820819] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:36:15,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960298089] [2023-08-24 00:36:15,472 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 00:36:15,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:36:15,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:36:15,473 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 00:36:15,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 00:36:22,657 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 00:36:22,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 00:36:22,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-24 00:36:22,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:36:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:36:45,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:36:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:36:59,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960298089] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:36:59,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:36:59,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 15 [2023-08-24 00:36:59,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414462472] [2023-08-24 00:36:59,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:36:59,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 00:36:59,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:36:59,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 00:36:59,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=167, Unknown=9, NotChecked=0, Total=240 [2023-08-24 00:36:59,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-08-24 00:36:59,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 116 transitions, 1214 flow. Second operand has 16 states, 16 states have (on average 56.375) internal successors, (902), 16 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:36:59,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:36:59,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-08-24 00:36:59,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:37:01,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:03,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:06,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:08,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:10,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:12,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:15,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:17,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:19,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:22,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:24,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:26,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:28,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:30,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:32,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:34,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:48,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:50,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:52,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:54,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:56,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:26,205 WARN L234 SmtUtils]: Spent 15.38s on a formula simplification. DAG size of input: 39 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 00:38:28,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:30,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:32,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:40,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:42,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:45,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:47,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:49,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:52,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:54,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:56,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:39:04,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:39:06,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:39:08,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:39:10,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:39:12,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:40:12,330 WARN L234 SmtUtils]: Spent 41.47s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 00:40:13,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:40:27,912 WARN L234 SmtUtils]: Spent 12.13s on a formula simplification. DAG size of input: 64 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 00:40:30,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:40:32,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:40:34,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:40:36,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:40:45,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:40:47,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:40:49,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:40:51,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:00,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:02,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:04,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:06,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:08,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:09,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:11,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:13,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:15,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:17,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:19,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:21,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:24,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:26,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:28,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:30,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:33,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:34,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:41:35,731 INFO L124 PetriNetUnfolderBase]: 396/803 cut-off events. [2023-08-24 00:41:35,731 INFO L125 PetriNetUnfolderBase]: For 12263/12263 co-relation queries the response was YES. [2023-08-24 00:41:35,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4924 conditions, 803 events. 396/803 cut-off events. For 12263/12263 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4328 event pairs, 38 based on Foata normal form. 6/805 useless extension candidates. Maximal degree in co-relation 4240. Up to 363 conditions per place. [2023-08-24 00:41:35,739 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 130 selfloop transitions, 72 changer transitions 18/220 dead transitions. [2023-08-24 00:41:35,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 220 transitions, 2558 flow [2023-08-24 00:41:35,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-24 00:41:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-24 00:41:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1303 transitions. [2023-08-24 00:41:35,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41709346991037133 [2023-08-24 00:41:35,743 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1303 transitions. [2023-08-24 00:41:35,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1303 transitions. [2023-08-24 00:41:35,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:41:35,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1303 transitions. [2023-08-24 00:41:35,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 59.22727272727273) internal successors, (1303), 22 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:41:35,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 142.0) internal successors, (3266), 23 states have internal predecessors, (3266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:41:35,751 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 142.0) internal successors, (3266), 23 states have internal predecessors, (3266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:41:35,751 INFO L175 Difference]: Start difference. First operand has 98 places, 116 transitions, 1214 flow. Second operand 22 states and 1303 transitions. [2023-08-24 00:41:35,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 220 transitions, 2558 flow [2023-08-24 00:41:35,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 220 transitions, 2161 flow, removed 187 selfloop flow, removed 6 redundant places. [2023-08-24 00:41:35,789 INFO L231 Difference]: Finished difference. Result has 119 places, 138 transitions, 1398 flow [2023-08-24 00:41:35,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1398, PETRI_PLACES=119, PETRI_TRANSITIONS=138} [2023-08-24 00:41:35,789 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 101 predicate places. [2023-08-24 00:41:35,789 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 138 transitions, 1398 flow [2023-08-24 00:41:35,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 56.375) internal successors, (902), 16 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:41:35,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:41:35,790 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:41:35,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 00:41:35,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:41:35,997 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 00:41:35,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:41:35,997 INFO L85 PathProgramCache]: Analyzing trace with hash -562835594, now seen corresponding path program 5 times [2023-08-24 00:41:35,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:41:35,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322853827] [2023-08-24 00:41:35,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:41:35,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:41:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:41:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:41:44,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:41:44,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322853827] [2023-08-24 00:41:44,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322853827] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:41:44,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890272844] [2023-08-24 00:41:44,961 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 00:41:44,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:41:44,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:41:44,965 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 00:41:44,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 00:43:38,842 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 00:43:38,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 00:43:38,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-24 00:43:38,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:43:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:43:54,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:44:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:44:05,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890272844] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:44:05,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:44:05,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 15 [2023-08-24 00:44:05,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833375674] [2023-08-24 00:44:05,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:44:05,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 00:44:05,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:44:05,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 00:44:05,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=172, Unknown=3, NotChecked=0, Total=240 [2023-08-24 00:44:05,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-08-24 00:44:05,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 138 transitions, 1398 flow. Second operand has 16 states, 16 states have (on average 56.1875) internal successors, (899), 16 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:44:05,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:44:05,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-08-24 00:44:05,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:44:10,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:14,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:23,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:24,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:28,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:30,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:32,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:34,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:37,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:39,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:41,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:43,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:45,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:47,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:49,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:51,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:52,741 INFO L124 PetriNetUnfolderBase]: 413/820 cut-off events. [2023-08-24 00:44:52,741 INFO L125 PetriNetUnfolderBase]: For 9435/9435 co-relation queries the response was YES. [2023-08-24 00:44:52,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4575 conditions, 820 events. 413/820 cut-off events. For 9435/9435 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4427 event pairs, 16 based on Foata normal form. 5/821 useless extension candidates. Maximal degree in co-relation 4443. Up to 379 conditions per place. [2023-08-24 00:44:52,749 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 152 selfloop transitions, 52 changer transitions 13/217 dead transitions. [2023-08-24 00:44:52,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 217 transitions, 2352 flow [2023-08-24 00:44:52,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-24 00:44:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-24 00:44:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 952 transitions. [2023-08-24 00:44:52,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41901408450704225 [2023-08-24 00:44:52,752 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 952 transitions. [2023-08-24 00:44:52,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 952 transitions. [2023-08-24 00:44:52,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:44:52,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 952 transitions. [2023-08-24 00:44:52,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 59.5) internal successors, (952), 16 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:44:52,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 142.0) internal successors, (2414), 17 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:44:52,758 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 142.0) internal successors, (2414), 17 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:44:52,758 INFO L175 Difference]: Start difference. First operand has 119 places, 138 transitions, 1398 flow. Second operand 16 states and 952 transitions. [2023-08-24 00:44:52,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 217 transitions, 2352 flow [2023-08-24 00:44:52,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 217 transitions, 2123 flow, removed 67 selfloop flow, removed 13 redundant places. [2023-08-24 00:44:52,785 INFO L231 Difference]: Finished difference. Result has 122 places, 147 transitions, 1411 flow [2023-08-24 00:44:52,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1411, PETRI_PLACES=122, PETRI_TRANSITIONS=147} [2023-08-24 00:44:52,786 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 104 predicate places. [2023-08-24 00:44:52,786 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 147 transitions, 1411 flow [2023-08-24 00:44:52,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 56.1875) internal successors, (899), 16 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:44:52,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:44:52,786 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:44:52,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 00:44:52,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:44:52,998 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 00:44:52,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:44:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1283600020, now seen corresponding path program 6 times [2023-08-24 00:44:52,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:44:52,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024767740] [2023-08-24 00:44:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:44:52,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:44:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:44:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:44:53,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:44:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024767740] [2023-08-24 00:44:53,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024767740] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:44:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895119062] [2023-08-24 00:44:53,119 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 00:44:53,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:44:53,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:44:53,120 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 00:44:53,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 00:45:14,705 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-24 00:45:14,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 00:45:14,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-24 00:45:14,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2023-08-24 00:45:42,680 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 00:45:42,691 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 00:45:43,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 00:45:43,881 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-24 00:45:43,886 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 137 [2023-08-24 00:45:43,887 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-08-24 00:45:43,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 00:45:43,887 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:282) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:729) 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.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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) 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) [2023-08-24 00:45:43,890 INFO L158 Benchmark]: Toolchain (without parser) took 877873.57ms. Allocated memory was 367.0MB in the beginning and 459.3MB in the end (delta: 92.3MB). Free memory was 343.4MB in the beginning and 193.4MB in the end (delta: 150.0MB). Peak memory consumption was 245.1MB. Max. memory is 16.0GB. [2023-08-24 00:45:43,890 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 367.0MB. Free memory is still 343.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 00:45:43,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.35ms. Allocated memory is still 367.0MB. Free memory was 342.9MB in the beginning and 332.8MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-24 00:45:43,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.27ms. Allocated memory is still 367.0MB. Free memory was 332.3MB in the beginning and 331.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 00:45:43,891 INFO L158 Benchmark]: Boogie Preprocessor took 32.96ms. Allocated memory is still 367.0MB. Free memory was 331.1MB in the beginning and 329.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 00:45:43,891 INFO L158 Benchmark]: RCFGBuilder took 341.45ms. Allocated memory is still 367.0MB. Free memory was 329.5MB in the beginning and 317.6MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-24 00:45:43,891 INFO L158 Benchmark]: TraceAbstraction took 877232.03ms. Allocated memory was 367.0MB in the beginning and 459.3MB in the end (delta: 92.3MB). Free memory was 316.9MB in the beginning and 193.4MB in the end (delta: 123.5MB). Peak memory consumption was 217.8MB. Max. memory is 16.0GB. [2023-08-24 00:45:43,892 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 367.0MB. Free memory is still 343.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 225.35ms. Allocated memory is still 367.0MB. Free memory was 342.9MB in the beginning and 332.8MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.27ms. Allocated memory is still 367.0MB. Free memory was 332.3MB in the beginning and 331.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.96ms. Allocated memory is still 367.0MB. Free memory was 331.1MB in the beginning and 329.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 341.45ms. Allocated memory is still 367.0MB. Free memory was 329.5MB in the beginning and 317.6MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * TraceAbstraction took 877232.03ms. Allocated memory was 367.0MB in the beginning and 459.3MB in the end (delta: 92.3MB). Free memory was 316.9MB in the beginning and 193.4MB in the end (delta: 123.5MB). Peak memory consumption was 217.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 68 PlacesBefore, 18 PlacesAfterwards, 67 TransitionsBefore, 13 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 65 TotalNumberOfCompositions, 297 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 297, independent: 297, independent conditional: 0, independent unconditional: 297, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 140, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 297, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 140, unknown conditional: 0, unknown unconditional: 140] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown