/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 --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix009.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:40:13,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:40:13,606 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-27 03:40:13,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:40:13,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:40:13,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:40:13,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:40:13,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:40:13,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:40:13,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:40:13,635 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:40:13,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:40:13,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:40:13,638 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:40:13,638 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:40:13,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:40:13,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:40:13,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:40:13,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:40:13,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:40:13,639 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:40:13,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:40:13,640 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:40:13,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:40:13,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:40:13,641 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:40:13,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:40:13,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:40:13,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:40:13,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:40:13,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:40:13,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:40:13,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:40:13,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:40:13,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:40:13,643 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:40:13,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:40:13,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:40:13,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:40:13,934 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:40:13,935 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:40:13,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009.opt.i [2023-08-27 03:40:14,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:40:15,105 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:40:15,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.opt.i [2023-08-27 03:40:15,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/523da74b2/3f58291e112a48a2902ba585f23a2fdd/FLAGfc0c748f0 [2023-08-27 03:40:15,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/523da74b2/3f58291e112a48a2902ba585f23a2fdd [2023-08-27 03:40:15,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:40:15,135 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:40:15,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:40:15,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:40:15,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:40:15,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:40:15" (1/1) ... [2023-08-27 03:40:15,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10589811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:40:15, skipping insertion in model container [2023-08-27 03:40:15,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:40:15" (1/1) ... [2023-08-27 03:40:15,183 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:40:15,432 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:40:15,443 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:40:15,467 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:40:15,470 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:40:15,511 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:40:15,532 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:40:15,532 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:40:15,538 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:40:15,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:40:15 WrapperNode [2023-08-27 03:40:15,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:40:15,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:40:15,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:40:15,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:40:15,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:40:15" (1/1) ... [2023-08-27 03:40:15,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:40:15" (1/1) ... [2023-08-27 03:40:15,595 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144 [2023-08-27 03:40:15,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:40:15,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:40:15,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:40:15,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:40:15,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:40:15" (1/1) ... [2023-08-27 03:40:15,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:40:15" (1/1) ... [2023-08-27 03:40:15,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:40:15" (1/1) ... [2023-08-27 03:40:15,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:40:15" (1/1) ... [2023-08-27 03:40:15,625 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:40:15" (1/1) ... [2023-08-27 03:40:15,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:40:15" (1/1) ... [2023-08-27 03:40:15,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:40:15" (1/1) ... [2023-08-27 03:40:15,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:40:15" (1/1) ... [2023-08-27 03:40:15,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:40:15,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:40:15,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:40:15,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:40:15,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:40:15" (1/1) ... [2023-08-27 03:40:15,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:40:15,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:40:15,661 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-27 03:40:15,671 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-27 03:40:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:40:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:40:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:40:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:40:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:40:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:40:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:40:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:40:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:40:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:40:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:40:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:40:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:40:15,690 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:40:15,784 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:40:15,785 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:40:15,974 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:40:16,098 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:40:16,099 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:40:16,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:40:16 BoogieIcfgContainer [2023-08-27 03:40:16,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:40:16,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:40:16,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:40:16,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:40:16,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:40:15" (1/3) ... [2023-08-27 03:40:16,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d945bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:40:16, skipping insertion in model container [2023-08-27 03:40:16,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:40:15" (2/3) ... [2023-08-27 03:40:16,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d945bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:40:16, skipping insertion in model container [2023-08-27 03:40:16,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:40:16" (3/3) ... [2023-08-27 03:40:16,107 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.opt.i [2023-08-27 03:40:16,118 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:40:16,118 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-27 03:40:16,118 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:40:16,162 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:40:16,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 101 transitions, 212 flow [2023-08-27 03:40:16,233 INFO L124 PetriNetUnfolderBase]: 3/99 cut-off events. [2023-08-27 03:40:16,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:40:16,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 99 events. 3/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2023-08-27 03:40:16,237 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 101 transitions, 212 flow [2023-08-27 03:40:16,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 99 transitions, 204 flow [2023-08-27 03:40:16,243 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:40:16,258 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 99 transitions, 204 flow [2023-08-27 03:40:16,261 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 99 transitions, 204 flow [2023-08-27 03:40:16,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 99 transitions, 204 flow [2023-08-27 03:40:16,281 INFO L124 PetriNetUnfolderBase]: 3/99 cut-off events. [2023-08-27 03:40:16,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:40:16,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 99 events. 3/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2023-08-27 03:40:16,283 INFO L119 LiptonReduction]: Number of co-enabled transitions 1662 [2023-08-27 03:40:19,110 INFO L134 LiptonReduction]: Checked pairs total: 5448 [2023-08-27 03:40:19,111 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-27 03:40:19,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:40:19,131 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;@aba3f2c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:40:19,131 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-27 03:40:19,134 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:40:19,134 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-27 03:40:19,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:40:19,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:40:19,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:40:19,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:40:19,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:40:19,138 INFO L85 PathProgramCache]: Analyzing trace with hash 481875926, now seen corresponding path program 1 times [2023-08-27 03:40:19,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:40:19,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158198321] [2023-08-27 03:40:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:40:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:40:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:40:19,464 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-27 03:40:19,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:40:19,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158198321] [2023-08-27 03:40:19,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158198321] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:40:19,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:40:19,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:40:19,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6780068] [2023-08-27 03:40:19,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:40:19,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:40:19,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:40:19,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:40:19,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:40:19,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197 [2023-08-27 03:40:19,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 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-27 03:40:19,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:40:19,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197 [2023-08-27 03:40:19,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:40:19,658 INFO L124 PetriNetUnfolderBase]: 275/532 cut-off events. [2023-08-27 03:40:19,658 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-27 03:40:19,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 532 events. 275/532 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2450 event pairs, 30 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 1008. Up to 396 conditions per place. [2023-08-27 03:40:19,666 INFO L140 encePairwiseOnDemand]: 193/197 looper letters, 25 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-27 03:40:19,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 30 transitions, 120 flow [2023-08-27 03:40:19,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:40:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:40:19,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-08-27 03:40:19,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47715736040609136 [2023-08-27 03:40:19,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-08-27 03:40:19,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-08-27 03:40:19,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:40:19,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-08-27 03:40:19,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 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-27 03:40:19,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-27 03:40:19,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-27 03:40:19,695 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 52 flow. Second operand 3 states and 282 transitions. [2023-08-27 03:40:19,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 30 transitions, 120 flow [2023-08-27 03:40:19,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:40:19,698 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 50 flow [2023-08-27 03:40:19,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2023-08-27 03:40:19,702 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2023-08-27 03:40:19,702 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 50 flow [2023-08-27 03:40:19,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 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-27 03:40:19,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:40:19,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:40:19,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:40:19,703 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:40:19,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:40:19,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2052073035, now seen corresponding path program 1 times [2023-08-27 03:40:19,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:40:19,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556250415] [2023-08-27 03:40:19,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:40:19,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:40:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:40:19,779 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-27 03:40:19,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:40:19,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556250415] [2023-08-27 03:40:19,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556250415] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:40:19,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:40:19,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:40:19,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048702475] [2023-08-27 03:40:19,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:40:19,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:40:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:40:19,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:40:19,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:40:19,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 197 [2023-08-27 03:40:19,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:40:19,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:40:19,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 197 [2023-08-27 03:40:19,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:40:19,858 INFO L124 PetriNetUnfolderBase]: 275/480 cut-off events. [2023-08-27 03:40:19,858 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-08-27 03:40:19,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 480 events. 275/480 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1892 event pairs, 275 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 986. Up to 468 conditions per place. [2023-08-27 03:40:19,861 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 17 selfloop transitions, 1 changer transitions 0/19 dead transitions. [2023-08-27 03:40:19,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 19 transitions, 82 flow [2023-08-27 03:40:19,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:40:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:40:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2023-08-27 03:40:19,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4450084602368866 [2023-08-27 03:40:19,864 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 263 transitions. [2023-08-27 03:40:19,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 263 transitions. [2023-08-27 03:40:19,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:40:19,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 263 transitions. [2023-08-27 03:40:19,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 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-27 03:40:19,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-27 03:40:19,867 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-27 03:40:19,867 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 50 flow. Second operand 3 states and 263 transitions. [2023-08-27 03:40:19,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 19 transitions, 82 flow [2023-08-27 03:40:19,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:40:19,869 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 44 flow [2023-08-27 03:40:19,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2023-08-27 03:40:19,870 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2023-08-27 03:40:19,870 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 44 flow [2023-08-27 03:40:19,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:40:19,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:40:19,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:40:19,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:40:19,873 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:40:19,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:40:19,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2052073036, now seen corresponding path program 1 times [2023-08-27 03:40:19,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:40:19,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74224151] [2023-08-27 03:40:19,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:40:19,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:40:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:40:19,927 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-27 03:40:19,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:40:19,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74224151] [2023-08-27 03:40:19,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74224151] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:40:19,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:40:19,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:40:19,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217776051] [2023-08-27 03:40:19,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:40:19,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:40:19,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:40:19,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:40:19,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:40:19,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 197 [2023-08-27 03:40:19,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:40:19,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:40:19,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 197 [2023-08-27 03:40:19,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:40:19,995 INFO L124 PetriNetUnfolderBase]: 192/350 cut-off events. [2023-08-27 03:40:19,995 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:40:19,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 350 events. 192/350 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1313 event pairs, 111 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 698. Up to 200 conditions per place. [2023-08-27 03:40:19,997 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 29 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-08-27 03:40:19,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 138 flow [2023-08-27 03:40:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:40:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:40:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2023-08-27 03:40:19,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4686971235194585 [2023-08-27 03:40:19,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2023-08-27 03:40:19,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2023-08-27 03:40:19,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:40:19,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2023-08-27 03:40:19,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 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-27 03:40:20,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-27 03:40:20,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-27 03:40:20,001 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 277 transitions. [2023-08-27 03:40:20,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 138 flow [2023-08-27 03:40:20,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 33 transitions, 137 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:40:20,002 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 64 flow [2023-08-27 03:40:20,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2023-08-27 03:40:20,003 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2023-08-27 03:40:20,003 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 64 flow [2023-08-27 03:40:20,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:40:20,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:40:20,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:40:20,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:40:20,006 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:40:20,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:40:20,007 INFO L85 PathProgramCache]: Analyzing trace with hash -773629736, now seen corresponding path program 1 times [2023-08-27 03:40:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:40:20,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671119708] [2023-08-27 03:40:20,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:40:20,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:40:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:40:20,135 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-27 03:40:20,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:40:20,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671119708] [2023-08-27 03:40:20,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671119708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:40:20,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:40:20,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:40:20,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352379374] [2023-08-27 03:40:20,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:40:20,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:40:20,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:40:20,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:40:20,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:40:20,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 197 [2023-08-27 03:40:20,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:40:20,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:40:20,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 197 [2023-08-27 03:40:20,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:40:20,209 INFO L124 PetriNetUnfolderBase]: 239/434 cut-off events. [2023-08-27 03:40:20,209 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-08-27 03:40:20,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 434 events. 239/434 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1705 event pairs, 85 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 1014. Up to 346 conditions per place. [2023-08-27 03:40:20,211 INFO L140 encePairwiseOnDemand]: 190/197 looper letters, 31 selfloop transitions, 6 changer transitions 2/39 dead transitions. [2023-08-27 03:40:20,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 194 flow [2023-08-27 03:40:20,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:40:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:40:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2023-08-27 03:40:20,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45685279187817257 [2023-08-27 03:40:20,212 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2023-08-27 03:40:20,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2023-08-27 03:40:20,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:40:20,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2023-08-27 03:40:20,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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-27 03:40:20,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-27 03:40:20,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-27 03:40:20,214 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 64 flow. Second operand 3 states and 270 transitions. [2023-08-27 03:40:20,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 194 flow [2023-08-27 03:40:20,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 39 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:40:20,216 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 107 flow [2023-08-27 03:40:20,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2023-08-27 03:40:20,216 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-08-27 03:40:20,216 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 107 flow [2023-08-27 03:40:20,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:40:20,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:40:20,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:40:20,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:40:20,217 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:40:20,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:40:20,217 INFO L85 PathProgramCache]: Analyzing trace with hash 535180848, now seen corresponding path program 1 times [2023-08-27 03:40:20,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:40:20,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767019783] [2023-08-27 03:40:20,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:40:20,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:40:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:40:20,281 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-27 03:40:20,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:40:20,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767019783] [2023-08-27 03:40:20,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767019783] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:40:20,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:40:20,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:40:20,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116511620] [2023-08-27 03:40:20,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:40:20,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:40:20,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:40:20,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:40:20,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:40:20,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 197 [2023-08-27 03:40:20,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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-27 03:40:20,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:40:20,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 197 [2023-08-27 03:40:20,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:40:20,369 INFO L124 PetriNetUnfolderBase]: 211/400 cut-off events. [2023-08-27 03:40:20,369 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2023-08-27 03:40:20,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 400 events. 211/400 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1591 event pairs, 79 based on Foata normal form. 6/394 useless extension candidates. Maximal degree in co-relation 1095. Up to 262 conditions per place. [2023-08-27 03:40:20,371 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 29 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2023-08-27 03:40:20,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 203 flow [2023-08-27 03:40:20,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:40:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:40:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-08-27 03:40:20,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4653130287648054 [2023-08-27 03:40:20,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-08-27 03:40:20,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-08-27 03:40:20,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:40:20,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-08-27 03:40:20,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 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-27 03:40:20,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-27 03:40:20,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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-27 03:40:20,374 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 107 flow. Second operand 3 states and 275 transitions. [2023-08-27 03:40:20,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 203 flow [2023-08-27 03:40:20,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:40:20,376 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 106 flow [2023-08-27 03:40:20,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2023-08-27 03:40:20,377 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2023-08-27 03:40:20,377 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 106 flow [2023-08-27 03:40:20,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 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-27 03:40:20,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:40:20,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:40:20,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:40:20,377 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:40:20,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:40:20,377 INFO L85 PathProgramCache]: Analyzing trace with hash -430822893, now seen corresponding path program 1 times [2023-08-27 03:40:20,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:40:20,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436342934] [2023-08-27 03:40:20,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:40:20,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:40:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:40:20,472 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-27 03:40:20,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:40:20,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436342934] [2023-08-27 03:40:20,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436342934] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:40:20,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:40:20,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:40:20,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099985601] [2023-08-27 03:40:20,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:40:20,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:40:20,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:40:20,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:40:20,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:40:20,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 197 [2023-08-27 03:40:20,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 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-27 03:40:20,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:40:20,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 197 [2023-08-27 03:40:20,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:40:20,555 INFO L124 PetriNetUnfolderBase]: 215/396 cut-off events. [2023-08-27 03:40:20,555 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2023-08-27 03:40:20,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1113 conditions, 396 events. 215/396 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1551 event pairs, 94 based on Foata normal form. 8/392 useless extension candidates. Maximal degree in co-relation 1101. Up to 242 conditions per place. [2023-08-27 03:40:20,557 INFO L140 encePairwiseOnDemand]: 190/197 looper letters, 36 selfloop transitions, 7 changer transitions 2/45 dead transitions. [2023-08-27 03:40:20,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 261 flow [2023-08-27 03:40:20,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:40:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:40:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 351 transitions. [2023-08-27 03:40:20,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44543147208121825 [2023-08-27 03:40:20,558 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 351 transitions. [2023-08-27 03:40:20,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 351 transitions. [2023-08-27 03:40:20,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:40:20,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 351 transitions. [2023-08-27 03:40:20,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 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-27 03:40:20,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 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-27 03:40:20,560 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 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-27 03:40:20,560 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 106 flow. Second operand 4 states and 351 transitions. [2023-08-27 03:40:20,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 261 flow [2023-08-27 03:40:20,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 45 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:40:20,562 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 149 flow [2023-08-27 03:40:20,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2023-08-27 03:40:20,562 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2023-08-27 03:40:20,562 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 149 flow [2023-08-27 03:40:20,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 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-27 03:40:20,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:40:20,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:40:20,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:40:20,563 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:40:20,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:40:20,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1147333017, now seen corresponding path program 1 times [2023-08-27 03:40:20,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:40:20,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173206697] [2023-08-27 03:40:20,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:40:20,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:40:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:40:20,663 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-27 03:40:20,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:40:20,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173206697] [2023-08-27 03:40:20,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173206697] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:40:20,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:40:20,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:40:20,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100309851] [2023-08-27 03:40:20,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:40:20,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:40:20,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:40:20,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:40:20,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:40:20,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 197 [2023-08-27 03:40:20,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 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-27 03:40:20,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:40:20,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 197 [2023-08-27 03:40:20,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:40:20,750 INFO L124 PetriNetUnfolderBase]: 98/220 cut-off events. [2023-08-27 03:40:20,750 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2023-08-27 03:40:20,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 220 events. 98/220 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 826 event pairs, 27 based on Foata normal form. 30/234 useless extension candidates. Maximal degree in co-relation 662. Up to 107 conditions per place. [2023-08-27 03:40:20,751 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 47 selfloop transitions, 6 changer transitions 2/57 dead transitions. [2023-08-27 03:40:20,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 57 transitions, 373 flow [2023-08-27 03:40:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:40:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:40:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2023-08-27 03:40:20,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44060913705583754 [2023-08-27 03:40:20,753 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 434 transitions. [2023-08-27 03:40:20,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 434 transitions. [2023-08-27 03:40:20,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:40:20,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 434 transitions. [2023-08-27 03:40:20,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:40:20,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 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-27 03:40:20,755 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 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-27 03:40:20,755 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 149 flow. Second operand 5 states and 434 transitions. [2023-08-27 03:40:20,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 57 transitions, 373 flow [2023-08-27 03:40:20,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:40:20,757 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 173 flow [2023-08-27 03:40:20,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-27 03:40:20,757 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2023-08-27 03:40:20,757 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 173 flow [2023-08-27 03:40:20,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 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-27 03:40:20,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:40:20,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:40:20,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:40:20,758 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:40:20,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:40:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash 415622186, now seen corresponding path program 1 times [2023-08-27 03:40:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:40:20,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964660639] [2023-08-27 03:40:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:40:20,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:40:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:40:20,802 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-27 03:40:20,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:40:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964660639] [2023-08-27 03:40:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964660639] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:40:20,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:40:20,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:40:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525980896] [2023-08-27 03:40:20,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:40:20,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:40:20,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:40:20,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:40:20,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:40:20,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 197 [2023-08-27 03:40:20,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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-27 03:40:20,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:40:20,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 197 [2023-08-27 03:40:20,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:40:20,858 INFO L124 PetriNetUnfolderBase]: 88/197 cut-off events. [2023-08-27 03:40:20,858 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2023-08-27 03:40:20,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 197 events. 88/197 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 688 event pairs, 38 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 683. Up to 84 conditions per place. [2023-08-27 03:40:20,859 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 25 selfloop transitions, 5 changer transitions 10/41 dead transitions. [2023-08-27 03:40:20,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 304 flow [2023-08-27 03:40:20,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:40:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:40:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 357 transitions. [2023-08-27 03:40:20,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4530456852791878 [2023-08-27 03:40:20,861 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 357 transitions. [2023-08-27 03:40:20,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 357 transitions. [2023-08-27 03:40:20,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:40:20,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 357 transitions. [2023-08-27 03:40:20,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 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-27 03:40:20,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 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-27 03:40:20,863 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 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-27 03:40:20,863 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 173 flow. Second operand 4 states and 357 transitions. [2023-08-27 03:40:20,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 304 flow [2023-08-27 03:40:20,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:40:20,865 INFO L231 Difference]: Finished difference. Result has 41 places, 20 transitions, 108 flow [2023-08-27 03:40:20,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=41, PETRI_TRANSITIONS=20} [2023-08-27 03:40:20,865 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2023-08-27 03:40:20,865 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 20 transitions, 108 flow [2023-08-27 03:40:20,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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-27 03:40:20,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:40:20,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:40:20,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:40:20,866 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:40:20,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:40:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash 417786013, now seen corresponding path program 1 times [2023-08-27 03:40:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:40:20,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424660464] [2023-08-27 03:40:20,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:40:20,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:40:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:40:21,020 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-27 03:40:21,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:40:21,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424660464] [2023-08-27 03:40:21,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424660464] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:40:21,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:40:21,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:40:21,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850192356] [2023-08-27 03:40:21,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:40:21,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:40:21,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:40:21,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:40:21,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:40:21,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 197 [2023-08-27 03:40:21,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 20 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 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-27 03:40:21,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:40:21,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 197 [2023-08-27 03:40:21,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:40:21,086 INFO L124 PetriNetUnfolderBase]: 33/85 cut-off events. [2023-08-27 03:40:21,086 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2023-08-27 03:40:21,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 85 events. 33/85 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 213 event pairs, 14 based on Foata normal form. 9/94 useless extension candidates. Maximal degree in co-relation 282. Up to 42 conditions per place. [2023-08-27 03:40:21,087 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 22 selfloop transitions, 5 changer transitions 9/37 dead transitions. [2023-08-27 03:40:21,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 246 flow [2023-08-27 03:40:21,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:40:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:40:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 498 transitions. [2023-08-27 03:40:21,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4213197969543147 [2023-08-27 03:40:21,088 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 498 transitions. [2023-08-27 03:40:21,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 498 transitions. [2023-08-27 03:40:21,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:40:21,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 498 transitions. [2023-08-27 03:40:21,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 83.0) internal successors, (498), 6 states have internal predecessors, (498), 0 states have call successors, (0), 0 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-27 03:40:21,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 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-27 03:40:21,091 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 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-27 03:40:21,091 INFO L175 Difference]: Start difference. First operand has 41 places, 20 transitions, 108 flow. Second operand 6 states and 498 transitions. [2023-08-27 03:40:21,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 246 flow [2023-08-27 03:40:21,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 195 flow, removed 10 selfloop flow, removed 10 redundant places. [2023-08-27 03:40:21,093 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 91 flow [2023-08-27 03:40:21,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=91, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-08-27 03:40:21,094 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2023-08-27 03:40:21,094 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 91 flow [2023-08-27 03:40:21,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 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-27 03:40:21,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:40:21,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:40:21,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:40:21,094 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:40:21,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:40:21,095 INFO L85 PathProgramCache]: Analyzing trace with hash -588140339, now seen corresponding path program 1 times [2023-08-27 03:40:21,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:40:21,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025403335] [2023-08-27 03:40:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:40:21,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:40:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:40:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:40:21,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:40:21,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025403335] [2023-08-27 03:40:21,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025403335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:40:21,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:40:21,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:40:21,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040325872] [2023-08-27 03:40:21,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:40:21,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:40:21,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:40:21,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:40:21,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:40:21,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 197 [2023-08-27 03:40:21,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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-27 03:40:21,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:40:21,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 197 [2023-08-27 03:40:21,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:40:21,303 INFO L124 PetriNetUnfolderBase]: 33/91 cut-off events. [2023-08-27 03:40:21,303 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-08-27 03:40:21,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 91 events. 33/91 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 255 event pairs, 2 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 288. Up to 59 conditions per place. [2023-08-27 03:40:21,304 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 19 selfloop transitions, 1 changer transitions 16/36 dead transitions. [2023-08-27 03:40:21,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 239 flow [2023-08-27 03:40:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:40:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:40:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 351 transitions. [2023-08-27 03:40:21,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44543147208121825 [2023-08-27 03:40:21,305 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 351 transitions. [2023-08-27 03:40:21,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 351 transitions. [2023-08-27 03:40:21,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:40:21,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 351 transitions. [2023-08-27 03:40:21,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 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-27 03:40:21,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 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-27 03:40:21,307 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 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-27 03:40:21,307 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 91 flow. Second operand 4 states and 351 transitions. [2023-08-27 03:40:21,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 239 flow [2023-08-27 03:40:21,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 211 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-27 03:40:21,308 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 76 flow [2023-08-27 03:40:21,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2023-08-27 03:40:21,309 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2023-08-27 03:40:21,309 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 76 flow [2023-08-27 03:40:21,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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-27 03:40:21,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:40:21,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:40:21,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:40:21,309 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:40:21,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:40:21,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1400582745, now seen corresponding path program 2 times [2023-08-27 03:40:21,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:40:21,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238389556] [2023-08-27 03:40:21,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:40:21,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:40:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:40:22,055 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-27 03:40:22,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:40:22,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238389556] [2023-08-27 03:40:22,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238389556] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:40:22,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:40:22,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:40:22,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737937844] [2023-08-27 03:40:22,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:40:22,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:40:22,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:40:22,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:40:22,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:40:22,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 197 [2023-08-27 03:40:22,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 76 flow. Second operand has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 0 states have call successors, (0), 0 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-27 03:40:22,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:40:22,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 197 [2023-08-27 03:40:22,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:40:22,183 INFO L124 PetriNetUnfolderBase]: 12/50 cut-off events. [2023-08-27 03:40:22,183 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-08-27 03:40:22,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 50 events. 12/50 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 2 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 152. Up to 17 conditions per place. [2023-08-27 03:40:22,183 INFO L140 encePairwiseOnDemand]: 190/197 looper letters, 13 selfloop transitions, 5 changer transitions 11/30 dead transitions. [2023-08-27 03:40:22,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 191 flow [2023-08-27 03:40:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:40:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:40:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 618 transitions. [2023-08-27 03:40:22,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39213197969543145 [2023-08-27 03:40:22,185 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 618 transitions. [2023-08-27 03:40:22,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 618 transitions. [2023-08-27 03:40:22,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:40:22,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 618 transitions. [2023-08-27 03:40:22,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 77.25) internal successors, (618), 8 states have internal predecessors, (618), 0 states have call successors, (0), 0 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-27 03:40:22,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 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-27 03:40:22,189 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 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-27 03:40:22,189 INFO L175 Difference]: Start difference. First operand has 33 places, 18 transitions, 76 flow. Second operand 8 states and 618 transitions. [2023-08-27 03:40:22,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 191 flow [2023-08-27 03:40:22,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 179 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-27 03:40:22,190 INFO L231 Difference]: Finished difference. Result has 38 places, 18 transitions, 85 flow [2023-08-27 03:40:22,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=85, PETRI_PLACES=38, PETRI_TRANSITIONS=18} [2023-08-27 03:40:22,191 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2023-08-27 03:40:22,191 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 18 transitions, 85 flow [2023-08-27 03:40:22,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 0 states have call successors, (0), 0 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-27 03:40:22,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:40:22,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:40:22,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:40:22,191 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:40:22,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:40:22,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2120524109, now seen corresponding path program 3 times [2023-08-27 03:40:22,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:40:22,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544788067] [2023-08-27 03:40:22,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:40:22,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:40:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:40:22,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:40:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:40:22,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:40:22,274 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:40:22,275 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (12 of 13 remaining) [2023-08-27 03:40:22,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2023-08-27 03:40:22,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2023-08-27 03:40:22,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (9 of 13 remaining) [2023-08-27 03:40:22,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2023-08-27 03:40:22,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2023-08-27 03:40:22,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2023-08-27 03:40:22,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-08-27 03:40:22,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2023-08-27 03:40:22,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2023-08-27 03:40:22,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (2 of 13 remaining) [2023-08-27 03:40:22,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2023-08-27 03:40:22,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2023-08-27 03:40:22,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:40:22,279 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:40:22,283 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:40:22,283 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:40:22,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:40:22 BasicIcfg [2023-08-27 03:40:22,331 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:40:22,332 INFO L158 Benchmark]: Toolchain (without parser) took 7197.00ms. Allocated memory was 358.6MB in the beginning and 455.1MB in the end (delta: 96.5MB). Free memory was 314.7MB in the beginning and 171.6MB in the end (delta: 143.2MB). Peak memory consumption was 240.7MB. Max. memory is 16.0GB. [2023-08-27 03:40:22,332 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 358.6MB. Free memory was 336.7MB in the beginning and 336.6MB in the end (delta: 92.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:40:22,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.49ms. Allocated memory is still 358.6MB. Free memory was 314.7MB in the beginning and 291.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:40:22,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.11ms. Allocated memory is still 358.6MB. Free memory was 291.7MB in the beginning and 288.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:40:22,332 INFO L158 Benchmark]: Boogie Preprocessor took 34.61ms. Allocated memory is still 358.6MB. Free memory was 288.5MB in the beginning and 286.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:40:22,332 INFO L158 Benchmark]: RCFGBuilder took 469.37ms. Allocated memory is still 358.6MB. Free memory was 286.4MB in the beginning and 246.6MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-27 03:40:22,333 INFO L158 Benchmark]: TraceAbstraction took 6229.21ms. Allocated memory was 358.6MB in the beginning and 455.1MB in the end (delta: 96.5MB). Free memory was 245.5MB in the beginning and 171.6MB in the end (delta: 74.0MB). Peak memory consumption was 171.5MB. Max. memory is 16.0GB. [2023-08-27 03:40:22,333 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 358.6MB. Free memory was 336.7MB in the beginning and 336.6MB in the end (delta: 92.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 403.49ms. Allocated memory is still 358.6MB. Free memory was 314.7MB in the beginning and 291.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.11ms. Allocated memory is still 358.6MB. Free memory was 291.7MB in the beginning and 288.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.61ms. Allocated memory is still 358.6MB. Free memory was 288.5MB in the beginning and 286.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 469.37ms. Allocated memory is still 358.6MB. Free memory was 286.4MB in the beginning and 246.6MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 6229.21ms. Allocated memory was 358.6MB in the beginning and 455.1MB in the end (delta: 96.5MB). Free memory was 245.5MB in the beginning and 171.6MB in the end (delta: 74.0MB). Peak memory consumption was 171.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 103 PlacesBefore, 29 PlacesAfterwards, 99 TransitionsBefore, 23 TransitionsAfterwards, 1662 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 96 TotalNumberOfCompositions, 5448 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2777, independent: 2559, independent conditional: 0, independent unconditional: 2559, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 984, independent: 940, independent conditional: 0, independent unconditional: 940, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2777, independent: 1619, independent conditional: 0, independent unconditional: 1619, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 984, unknown conditional: 0, unknown unconditional: 984] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 87, Positive conditional cache size: 0, Positive unconditional cache size: 87, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L831] 0 pthread_t t243; [L832] FCALL, FORK 0 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t243, ((void *)0), P0, ((void *)0))=-2, t243={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t244; [L834] FCALL, FORK 0 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t244, ((void *)0), P1, ((void *)0))=-1, t243={5:0}, t244={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L779] 2 y$w_buff1 = y$w_buff0 [L780] 2 y$w_buff0 = 1 [L781] 2 y$w_buff1_used = y$w_buff0_used [L782] 2 y$w_buff0_used = (_Bool)1 [L783] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L783] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L784] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 2 y$flush_delayed = weak$$choice2 [L793] 2 y$mem_tmp = y [L794] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L795] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L796] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L797] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L798] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L800] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L801] 2 __unbuffered_p1_EAX = y [L802] 2 y = y$flush_delayed ? y$mem_tmp : y [L803] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EBX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L816] EXPR 2 __unbuffered_cnt + 1 [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L772] EXPR 1 __unbuffered_cnt + 1 [L772] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={5:0}, t244={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix009.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 772]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 124 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 519 IncrementalHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 4 mSDtfsCounter, 519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=7, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 667 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:40:22,357 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 0 Received shutdown request...