/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 PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:16:03,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:16:03,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 11:16:03,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:16:03,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:16:03,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:16:03,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:16:03,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:16:03,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:16:03,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:16:03,475 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:16:03,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:16:03,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:16:03,476 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:16:03,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:16:03,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:16:03,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:16:03,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:16:03,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:16:03,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:16:03,477 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:16:03,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:16:03,478 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:16:03,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:16:03,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:16:03,479 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:16:03,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:16:03,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:16:03,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:16:03,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:16:03,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:16:03,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:16:03,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:16:03,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:16:03,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:16:03,481 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 -> PROGRAM_FIRST [2023-08-24 11:16:03,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:16:03,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:16:03,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:16:03,736 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:16:03,736 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:16:03,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2023-08-24 11:16:04,753 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:16:04,949 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:16:04,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2023-08-24 11:16:04,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/443da78cc/8886510a90884b9eabff47f162be7530/FLAG106488109 [2023-08-24 11:16:04,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/443da78cc/8886510a90884b9eabff47f162be7530 [2023-08-24 11:16:04,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:16:04,968 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:16:04,974 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:16:04,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:16:04,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:16:04,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:16:04" (1/1) ... [2023-08-24 11:16:04,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd48c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:16:04, skipping insertion in model container [2023-08-24 11:16:04,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:16:04" (1/1) ... [2023-08-24 11:16:05,015 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:16:05,255 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i[30540,30553] [2023-08-24 11:16:05,260 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:16:05,268 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:16:05,290 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [254] [2023-08-24 11:16:05,291 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [254] [2023-08-24 11:16:05,302 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i[30540,30553] [2023-08-24 11:16:05,304 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:16:05,339 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:16:05,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:16:05 WrapperNode [2023-08-24 11:16:05,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:16:05,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:16:05,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:16:05,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:16:05,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:16:05" (1/1) ... [2023-08-24 11:16:05,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:16:05" (1/1) ... [2023-08-24 11:16:05,384 INFO L138 Inliner]: procedures = 171, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2023-08-24 11:16:05,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:16:05,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:16:05,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:16:05,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:16:05,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:16:05" (1/1) ... [2023-08-24 11:16:05,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:16:05" (1/1) ... [2023-08-24 11:16:05,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:16:05" (1/1) ... [2023-08-24 11:16:05,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:16:05" (1/1) ... [2023-08-24 11:16:05,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:16:05" (1/1) ... [2023-08-24 11:16:05,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:16:05" (1/1) ... [2023-08-24 11:16:05,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:16:05" (1/1) ... [2023-08-24 11:16:05,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:16:05" (1/1) ... [2023-08-24 11:16:05,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:16:05,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:16:05,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:16:05,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:16:05,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:16:05" (1/1) ... [2023-08-24 11:16:05,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:16:05,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:16:05,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 11:16:05,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 11:16:05,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 11:16:05,467 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-24 11:16:05,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-24 11:16:05,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:16:05,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:16:05,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:16:05,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:16:05,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:16:05,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:16:05,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:16:05,469 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 11:16:05,562 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:16:05,563 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:16:05,680 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:16:05,699 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:16:05,700 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-24 11:16:05,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:16:05 BoogieIcfgContainer [2023-08-24 11:16:05,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:16:05,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:16:05,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:16:05,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:16:05,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:16:04" (1/3) ... [2023-08-24 11:16:05,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7c7b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:16:05, skipping insertion in model container [2023-08-24 11:16:05,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:16:05" (2/3) ... [2023-08-24 11:16:05,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7c7b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:16:05, skipping insertion in model container [2023-08-24 11:16:05,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:16:05" (3/3) ... [2023-08-24 11:16:05,707 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2023-08-24 11:16:05,719 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:16:05,719 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 11:16:05,719 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:16:05,762 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:16:05,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 161 flow [2023-08-24 11:16:05,846 INFO L124 PetriNetUnfolderBase]: 9/88 cut-off events. [2023-08-24 11:16:05,846 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:16:05,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 88 events. 9/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2023-08-24 11:16:05,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 78 transitions, 161 flow [2023-08-24 11:16:05,874 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 78 transitions, 161 flow [2023-08-24 11:16:05,878 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:16:05,888 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 78 transitions, 161 flow [2023-08-24 11:16:05,891 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 78 transitions, 161 flow [2023-08-24 11:16:05,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 161 flow [2023-08-24 11:16:05,926 INFO L124 PetriNetUnfolderBase]: 9/88 cut-off events. [2023-08-24 11:16:05,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:16:05,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 88 events. 9/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2023-08-24 11:16:05,927 INFO L119 LiptonReduction]: Number of co-enabled transitions 1144 [2023-08-24 11:16:07,843 INFO L134 LiptonReduction]: Checked pairs total: 894 [2023-08-24 11:16:07,844 INFO L136 LiptonReduction]: Total number of compositions: 81 [2023-08-24 11:16:07,856 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:16:07,861 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;@269f79d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:16:07,861 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-24 11:16:07,863 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:16:07,863 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2023-08-24 11:16:07,863 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:16:07,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:07,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-24 11:16:07,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:07,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:07,868 INFO L85 PathProgramCache]: Analyzing trace with hash 365604591, now seen corresponding path program 1 times [2023-08-24 11:16:07,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:07,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419850012] [2023-08-24 11:16:07,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:07,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:16:07,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:07,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419850012] [2023-08-24 11:16:07,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419850012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:07,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:07,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:16:07,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702103417] [2023-08-24 11:16:07,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:07,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-24 11:16:08,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:08,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-24 11:16:08,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-24 11:16:08,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 159 [2023-08-24 11:16:08,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 12 places, 10 transitions, 25 flow. Second operand has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:08,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:08,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 159 [2023-08-24 11:16:08,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:08,034 INFO L124 PetriNetUnfolderBase]: 7/19 cut-off events. [2023-08-24 11:16:08,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:16:08,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 19 events. 7/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 4 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 30. Up to 19 conditions per place. [2023-08-24 11:16:08,035 INFO L140 encePairwiseOnDemand]: 157/159 looper letters, 0 selfloop transitions, 0 changer transitions 8/8 dead transitions. [2023-08-24 11:16:08,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 8 transitions, 35 flow [2023-08-24 11:16:08,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-24 11:16:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-24 11:16:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 147 transitions. [2023-08-24 11:16:08,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46226415094339623 [2023-08-24 11:16:08,043 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 147 transitions. [2023-08-24 11:16:08,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 147 transitions. [2023-08-24 11:16:08,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:08,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 147 transitions. [2023-08-24 11:16:08,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:08,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:08,050 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:08,051 INFO L175 Difference]: Start difference. First operand has 12 places, 10 transitions, 25 flow. Second operand 2 states and 147 transitions. [2023-08-24 11:16:08,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 8 transitions, 35 flow [2023-08-24 11:16:08,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 8 transitions, 35 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:16:08,052 INFO L231 Difference]: Finished difference. Result has 11 places, 0 transitions, 0 flow [2023-08-24 11:16:08,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=21, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=0, PETRI_PLACES=11, PETRI_TRANSITIONS=0} [2023-08-24 11:16:08,055 INFO L281 CegarLoopForPetriNet]: 12 programPoint places, -1 predicate places. [2023-08-24 11:16:08,056 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 0 transitions, 0 flow [2023-08-24 11:16:08,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:08,057 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-08-24 11:16:08,058 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-08-24 11:16:08,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:16:08,058 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-24 11:16:08,060 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2023-08-24 11:16:08,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 161 flow [2023-08-24 11:16:08,071 INFO L124 PetriNetUnfolderBase]: 9/88 cut-off events. [2023-08-24 11:16:08,071 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:16:08,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 88 events. 9/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2023-08-24 11:16:08,072 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 78 transitions, 161 flow [2023-08-24 11:16:08,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 78 transitions, 161 flow [2023-08-24 11:16:08,072 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:16:08,072 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 78 transitions, 161 flow [2023-08-24 11:16:08,072 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 78 transitions, 161 flow [2023-08-24 11:16:08,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 161 flow [2023-08-24 11:16:08,080 INFO L124 PetriNetUnfolderBase]: 9/88 cut-off events. [2023-08-24 11:16:08,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:16:08,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 88 events. 9/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 56. Up to 4 conditions per place. [2023-08-24 11:16:08,081 INFO L119 LiptonReduction]: Number of co-enabled transitions 1144 [2023-08-24 11:16:10,014 INFO L134 LiptonReduction]: Checked pairs total: 924 [2023-08-24 11:16:10,014 INFO L136 LiptonReduction]: Total number of compositions: 83 [2023-08-24 11:16:10,015 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-24 11:16:10,016 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;@269f79d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:16:10,016 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-24 11:16:10,018 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:16:10,018 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2023-08-24 11:16:10,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:16:10,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:10,018 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-24 11:16:10,019 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 11:16:10,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:10,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1011638020, now seen corresponding path program 1 times [2023-08-24 11:16:10,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:10,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719488922] [2023-08-24 11:16:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:10,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:16:10,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:16:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:16:10,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:16:10,053 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:16:10,053 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-24 11:16:10,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:16:10,054 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-24 11:16:10,054 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-24 11:16:10,054 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 11:16:10,054 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-24 11:16:10,068 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:16:10,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 258 flow [2023-08-24 11:16:10,085 INFO L124 PetriNetUnfolderBase]: 17/145 cut-off events. [2023-08-24 11:16:10,086 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:16:10,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 145 events. 17/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 252 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 100. Up to 6 conditions per place. [2023-08-24 11:16:10,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 123 transitions, 258 flow [2023-08-24 11:16:10,087 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 123 transitions, 258 flow [2023-08-24 11:16:10,088 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:16:10,088 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 123 transitions, 258 flow [2023-08-24 11:16:10,088 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 123 transitions, 258 flow [2023-08-24 11:16:10,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 258 flow [2023-08-24 11:16:10,099 INFO L124 PetriNetUnfolderBase]: 17/145 cut-off events. [2023-08-24 11:16:10,099 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:16:10,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 145 events. 17/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 252 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 100. Up to 6 conditions per place. [2023-08-24 11:16:10,102 INFO L119 LiptonReduction]: Number of co-enabled transitions 6248 [2023-08-24 11:16:12,051 INFO L134 LiptonReduction]: Checked pairs total: 9776 [2023-08-24 11:16:12,051 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-24 11:16:12,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:16:12,053 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;@269f79d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:16:12,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-24 11:16:12,054 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:16:12,055 INFO L124 PetriNetUnfolderBase]: 2/13 cut-off events. [2023-08-24 11:16:12,055 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:16:12,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:12,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 11:16:12,055 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:12,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:12,055 INFO L85 PathProgramCache]: Analyzing trace with hash 698340090, now seen corresponding path program 1 times [2023-08-24 11:16:12,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:12,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801713596] [2023-08-24 11:16:12,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:12,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:16:12,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:12,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801713596] [2023-08-24 11:16:12,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801713596] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:12,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:12,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:16:12,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981357118] [2023-08-24 11:16:12,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:12,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-24 11:16:12,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:12,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-24 11:16:12,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-24 11:16:12,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 238 [2023-08-24 11:16:12,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 32 transitions, 76 flow. Second operand has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:12,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 238 [2023-08-24 11:16:12,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:12,132 INFO L124 PetriNetUnfolderBase]: 98/222 cut-off events. [2023-08-24 11:16:12,132 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-24 11:16:12,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 222 events. 98/222 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 906 event pairs, 64 based on Foata normal form. 21/202 useless extension candidates. Maximal degree in co-relation 104. Up to 149 conditions per place. [2023-08-24 11:16:12,137 INFO L140 encePairwiseOnDemand]: 233/238 looper letters, 14 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-24 11:16:12,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 94 flow [2023-08-24 11:16:12,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-24 11:16:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-24 11:16:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 233 transitions. [2023-08-24 11:16:12,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894957983193277 [2023-08-24 11:16:12,142 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 233 transitions. [2023-08-24 11:16:12,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 233 transitions. [2023-08-24 11:16:12,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:12,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 233 transitions. [2023-08-24 11:16:12,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,145 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,145 INFO L175 Difference]: Start difference. First operand has 29 places, 32 transitions, 76 flow. Second operand 2 states and 233 transitions. [2023-08-24 11:16:12,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 94 flow [2023-08-24 11:16:12,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 92 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-24 11:16:12,146 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 64 flow [2023-08-24 11:16:12,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2023-08-24 11:16:12,146 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-08-24 11:16:12,147 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 64 flow [2023-08-24 11:16:12,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:12,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:12,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:16:12,147 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:12,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:12,147 INFO L85 PathProgramCache]: Analyzing trace with hash -620647984, now seen corresponding path program 1 times [2023-08-24 11:16:12,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:12,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367167210] [2023-08-24 11:16:12,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:12,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:16:12,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:12,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367167210] [2023-08-24 11:16:12,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367167210] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:12,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:12,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:12,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815720666] [2023-08-24 11:16:12,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:12,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:12,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:12,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:12,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:12,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 238 [2023-08-24 11:16:12,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:12,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 238 [2023-08-24 11:16:12,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:12,290 INFO L124 PetriNetUnfolderBase]: 115/243 cut-off events. [2023-08-24 11:16:12,290 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-24 11:16:12,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 243 events. 115/243 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1027 event pairs, 54 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 444. Up to 149 conditions per place. [2023-08-24 11:16:12,292 INFO L140 encePairwiseOnDemand]: 235/238 looper letters, 20 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-24 11:16:12,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 129 flow [2023-08-24 11:16:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-08-24 11:16:12,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44397759103641454 [2023-08-24 11:16:12,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-08-24 11:16:12,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-08-24 11:16:12,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:12,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-08-24 11:16:12,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,301 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,301 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 64 flow. Second operand 3 states and 317 transitions. [2023-08-24 11:16:12,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 129 flow [2023-08-24 11:16:12,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 129 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:16:12,302 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 76 flow [2023-08-24 11:16:12,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-08-24 11:16:12,302 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2023-08-24 11:16:12,303 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 76 flow [2023-08-24 11:16:12,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:12,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:12,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:16:12,303 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:12,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:12,304 INFO L85 PathProgramCache]: Analyzing trace with hash -450613029, now seen corresponding path program 1 times [2023-08-24 11:16:12,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:12,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325257795] [2023-08-24 11:16:12,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:12,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:12,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:16:12,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:12,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325257795] [2023-08-24 11:16:12,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325257795] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:12,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:12,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:12,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909647799] [2023-08-24 11:16:12,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:12,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:12,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:12,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:12,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:12,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 238 [2023-08-24 11:16:12,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:12,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 238 [2023-08-24 11:16:12,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:12,417 INFO L124 PetriNetUnfolderBase]: 275/491 cut-off events. [2023-08-24 11:16:12,417 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2023-08-24 11:16:12,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 491 events. 275/491 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2264 event pairs, 125 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 1064. Up to 296 conditions per place. [2023-08-24 11:16:12,419 INFO L140 encePairwiseOnDemand]: 233/238 looper letters, 31 selfloop transitions, 4 changer transitions 1/41 dead transitions. [2023-08-24 11:16:12,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 179 flow [2023-08-24 11:16:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:12,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2023-08-24 11:16:12,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42436974789915966 [2023-08-24 11:16:12,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2023-08-24 11:16:12,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2023-08-24 11:16:12,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:12,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2023-08-24 11:16:12,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,423 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 76 flow. Second operand 3 states and 303 transitions. [2023-08-24 11:16:12,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 179 flow [2023-08-24 11:16:12,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 175 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 11:16:12,424 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 98 flow [2023-08-24 11:16:12,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2023-08-24 11:16:12,424 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2023-08-24 11:16:12,425 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 98 flow [2023-08-24 11:16:12,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:12,425 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:12,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:16:12,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:12,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:12,425 INFO L85 PathProgramCache]: Analyzing trace with hash -885022386, now seen corresponding path program 1 times [2023-08-24 11:16:12,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:12,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114836175] [2023-08-24 11:16:12,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:12,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:12,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114836175] [2023-08-24 11:16:12,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114836175] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:12,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:12,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:12,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359598752] [2023-08-24 11:16:12,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:12,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:12,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:12,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:12,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 238 [2023-08-24 11:16:12,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:12,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 238 [2023-08-24 11:16:12,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:12,519 INFO L124 PetriNetUnfolderBase]: 147/336 cut-off events. [2023-08-24 11:16:12,519 INFO L125 PetriNetUnfolderBase]: For 77/79 co-relation queries the response was YES. [2023-08-24 11:16:12,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 336 events. 147/336 cut-off events. For 77/79 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1568 event pairs, 89 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 694. Up to 206 conditions per place. [2023-08-24 11:16:12,521 INFO L140 encePairwiseOnDemand]: 235/238 looper letters, 22 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-08-24 11:16:12,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 170 flow [2023-08-24 11:16:12,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:12,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-08-24 11:16:12,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425770308123249 [2023-08-24 11:16:12,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-08-24 11:16:12,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-08-24 11:16:12,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:12,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-08-24 11:16:12,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,526 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 98 flow. Second operand 3 states and 316 transitions. [2023-08-24 11:16:12,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 170 flow [2023-08-24 11:16:12,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:12,529 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 102 flow [2023-08-24 11:16:12,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2023-08-24 11:16:12,530 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2023-08-24 11:16:12,530 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 102 flow [2023-08-24 11:16:12,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:12,530 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:12,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:16:12,531 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:12,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash 155201366, now seen corresponding path program 1 times [2023-08-24 11:16:12,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:12,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136349089] [2023-08-24 11:16:12,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:12,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 11:16:12,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:12,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136349089] [2023-08-24 11:16:12,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136349089] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:12,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:12,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:12,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987100002] [2023-08-24 11:16:12,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:12,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:12,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:12,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:12,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:12,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 238 [2023-08-24 11:16:12,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 102 flow. Second operand has 3 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-24 11:16:12,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:12,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 238 [2023-08-24 11:16:12,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:12,649 INFO L124 PetriNetUnfolderBase]: 287/507 cut-off events. [2023-08-24 11:16:12,649 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2023-08-24 11:16:12,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 507 events. 287/507 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2239 event pairs, 129 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 1242. Up to 294 conditions per place. [2023-08-24 11:16:12,651 INFO L140 encePairwiseOnDemand]: 233/238 looper letters, 30 selfloop transitions, 4 changer transitions 4/43 dead transitions. [2023-08-24 11:16:12,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 214 flow [2023-08-24 11:16:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-08-24 11:16:12,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4215686274509804 [2023-08-24 11:16:12,652 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-08-24 11:16:12,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-08-24 11:16:12,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:12,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-08-24 11:16:12,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,655 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,655 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 102 flow. Second operand 3 states and 301 transitions. [2023-08-24 11:16:12,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 214 flow [2023-08-24 11:16:12,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 210 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 11:16:12,656 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 120 flow [2023-08-24 11:16:12,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-08-24 11:16:12,657 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2023-08-24 11:16:12,657 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 120 flow [2023-08-24 11:16:12,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-24 11:16:12,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:12,657 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:12,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:16:12,658 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:12,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:12,658 INFO L85 PathProgramCache]: Analyzing trace with hash 777161033, now seen corresponding path program 1 times [2023-08-24 11:16:12,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:12,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370373836] [2023-08-24 11:16:12,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:12,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:12,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:12,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370373836] [2023-08-24 11:16:12,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370373836] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:16:12,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569941600] [2023-08-24 11:16:12,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:12,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:12,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:16:12,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:16:12,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 11:16:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:12,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 11:16:12,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:16:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:12,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:16:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:12,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569941600] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:16:12,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:16:12,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-24 11:16:12,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002882661] [2023-08-24 11:16:12,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:16:12,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:12,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:12,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:12,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:16:12,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 238 [2023-08-24 11:16:12,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:12,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 238 [2023-08-24 11:16:12,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:12,936 INFO L124 PetriNetUnfolderBase]: 171/353 cut-off events. [2023-08-24 11:16:12,937 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2023-08-24 11:16:12,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 353 events. 171/353 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1681 event pairs, 97 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 885. Up to 218 conditions per place. [2023-08-24 11:16:12,938 INFO L140 encePairwiseOnDemand]: 235/238 looper letters, 28 selfloop transitions, 3 changer transitions 2/48 dead transitions. [2023-08-24 11:16:12,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 248 flow [2023-08-24 11:16:12,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:16:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:16:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2023-08-24 11:16:12,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44432773109243695 [2023-08-24 11:16:12,940 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2023-08-24 11:16:12,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2023-08-24 11:16:12,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:12,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2023-08-24 11:16:12,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,943 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,943 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 120 flow. Second operand 4 states and 423 transitions. [2023-08-24 11:16:12,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 248 flow [2023-08-24 11:16:12,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:12,946 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 128 flow [2023-08-24 11:16:12,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-08-24 11:16:12,947 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2023-08-24 11:16:12,947 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 128 flow [2023-08-24 11:16:12,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:12,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:12,948 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:12,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 11:16:13,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:13,153 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:13,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:13,154 INFO L85 PathProgramCache]: Analyzing trace with hash 163582672, now seen corresponding path program 2 times [2023-08-24 11:16:13,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:13,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571321328] [2023-08-24 11:16:13,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:13,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:16:13,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:13,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571321328] [2023-08-24 11:16:13,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571321328] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:16:13,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394614237] [2023-08-24 11:16:13,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 11:16:13,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:13,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:16:13,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:16:13,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 11:16:13,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 11:16:13,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 11:16:13,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 11:16:13,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:16:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:16:13,362 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 11:16:13,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394614237] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:13,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 11:16:13,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-24 11:16:13,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833629338] [2023-08-24 11:16:13,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:13,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:13,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:13,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:13,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:16:13,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 238 [2023-08-24 11:16:13,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:13,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:13,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 238 [2023-08-24 11:16:13,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:13,483 INFO L124 PetriNetUnfolderBase]: 319/581 cut-off events. [2023-08-24 11:16:13,483 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2023-08-24 11:16:13,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 581 events. 319/581 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2782 event pairs, 140 based on Foata normal form. 6/544 useless extension candidates. Maximal degree in co-relation 1595. Up to 323 conditions per place. [2023-08-24 11:16:13,485 INFO L140 encePairwiseOnDemand]: 232/238 looper letters, 28 selfloop transitions, 5 changer transitions 13/51 dead transitions. [2023-08-24 11:16:13,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 290 flow [2023-08-24 11:16:13,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:16:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:16:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2023-08-24 11:16:13,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37899159663865545 [2023-08-24 11:16:13,487 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 451 transitions. [2023-08-24 11:16:13,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 451 transitions. [2023-08-24 11:16:13,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:13,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 451 transitions. [2023-08-24 11:16:13,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:13,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:13,490 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:13,490 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 128 flow. Second operand 5 states and 451 transitions. [2023-08-24 11:16:13,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 290 flow [2023-08-24 11:16:13,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 274 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:13,492 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 139 flow [2023-08-24 11:16:13,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-24 11:16:13,493 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2023-08-24 11:16:13,493 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 139 flow [2023-08-24 11:16:13,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:13,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:13,493 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:13,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 11:16:13,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-08-24 11:16:13,698 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:13,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:13,698 INFO L85 PathProgramCache]: Analyzing trace with hash -739491320, now seen corresponding path program 3 times [2023-08-24 11:16:13,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:13,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661416509] [2023-08-24 11:16:13,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:13,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:16:13,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:13,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661416509] [2023-08-24 11:16:13,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661416509] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:16:13,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464606482] [2023-08-24 11:16:13,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 11:16:13,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:13,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:16:13,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:16:13,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 11:16:13,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-24 11:16:13,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 11:16:13,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 11:16:13,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:16:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:16:13,823 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 11:16:13,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464606482] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:13,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 11:16:13,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-24 11:16:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610947217] [2023-08-24 11:16:13,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:13,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:13,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:13,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:13,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:16:13,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 238 [2023-08-24 11:16:13,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:13,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:13,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 238 [2023-08-24 11:16:13,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:13,933 INFO L124 PetriNetUnfolderBase]: 312/576 cut-off events. [2023-08-24 11:16:13,933 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2023-08-24 11:16:13,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 576 events. 312/576 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2796 event pairs, 215 based on Foata normal form. 6/540 useless extension candidates. Maximal degree in co-relation 1603. Up to 466 conditions per place. [2023-08-24 11:16:13,936 INFO L140 encePairwiseOnDemand]: 231/238 looper letters, 31 selfloop transitions, 5 changer transitions 10/51 dead transitions. [2023-08-24 11:16:13,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 305 flow [2023-08-24 11:16:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:16:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:16:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2023-08-24 11:16:13,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3798319327731092 [2023-08-24 11:16:13,937 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 452 transitions. [2023-08-24 11:16:13,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 452 transitions. [2023-08-24 11:16:13,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:13,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 452 transitions. [2023-08-24 11:16:13,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:13,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:13,939 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:13,939 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 139 flow. Second operand 5 states and 452 transitions. [2023-08-24 11:16:13,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 305 flow [2023-08-24 11:16:13,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 296 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:13,942 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 153 flow [2023-08-24 11:16:13,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2023-08-24 11:16:13,943 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2023-08-24 11:16:13,943 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 153 flow [2023-08-24 11:16:13,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:13,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:13,943 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:13,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-24 11:16:14,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:14,148 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:14,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:14,148 INFO L85 PathProgramCache]: Analyzing trace with hash -754301488, now seen corresponding path program 1 times [2023-08-24 11:16:14,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:14,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614135463] [2023-08-24 11:16:14,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:14,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:16:14,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:14,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614135463] [2023-08-24 11:16:14,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614135463] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:16:14,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955762868] [2023-08-24 11:16:14,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:14,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:14,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:16:14,189 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:16:14,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 11:16:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:14,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 11:16:14,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:16:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:16:14,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:16:14,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:16:14,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955762868] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:16:14,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:16:14,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-08-24 11:16:14,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843559298] [2023-08-24 11:16:14,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:16:14,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:16:14,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:14,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:16:14,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:16:14,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 238 [2023-08-24 11:16:14,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:14,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 238 [2023-08-24 11:16:14,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:14,353 INFO L124 PetriNetUnfolderBase]: 147/331 cut-off events. [2023-08-24 11:16:14,353 INFO L125 PetriNetUnfolderBase]: For 208/214 co-relation queries the response was YES. [2023-08-24 11:16:14,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 331 events. 147/331 cut-off events. For 208/214 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1497 event pairs, 79 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 885. Up to 190 conditions per place. [2023-08-24 11:16:14,355 INFO L140 encePairwiseOnDemand]: 235/238 looper letters, 30 selfloop transitions, 3 changer transitions 2/49 dead transitions. [2023-08-24 11:16:14,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 287 flow [2023-08-24 11:16:14,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:16:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:16:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 421 transitions. [2023-08-24 11:16:14,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4422268907563025 [2023-08-24 11:16:14,357 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 421 transitions. [2023-08-24 11:16:14,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 421 transitions. [2023-08-24 11:16:14,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:14,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 421 transitions. [2023-08-24 11:16:14,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,359 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,359 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 153 flow. Second operand 4 states and 421 transitions. [2023-08-24 11:16:14,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 287 flow [2023-08-24 11:16:14,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 264 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-24 11:16:14,362 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 146 flow [2023-08-24 11:16:14,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-08-24 11:16:14,363 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2023-08-24 11:16:14,363 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 146 flow [2023-08-24 11:16:14,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:14,363 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:14,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 11:16:14,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:14,568 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:14,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash 484809876, now seen corresponding path program 2 times [2023-08-24 11:16:14,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:14,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595909867] [2023-08-24 11:16:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:16:14,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:14,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595909867] [2023-08-24 11:16:14,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595909867] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:14,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:14,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:16:14,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590428904] [2023-08-24 11:16:14,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:14,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:14,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:14,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:14,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:16:14,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 238 [2023-08-24 11:16:14,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:14,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 238 [2023-08-24 11:16:14,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:14,690 INFO L124 PetriNetUnfolderBase]: 257/491 cut-off events. [2023-08-24 11:16:14,691 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2023-08-24 11:16:14,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 491 events. 257/491 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2326 event pairs, 113 based on Foata normal form. 6/459 useless extension candidates. Maximal degree in co-relation 1441. Up to 264 conditions per place. [2023-08-24 11:16:14,693 INFO L140 encePairwiseOnDemand]: 232/238 looper letters, 29 selfloop transitions, 5 changer transitions 12/51 dead transitions. [2023-08-24 11:16:14,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 309 flow [2023-08-24 11:16:14,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:16:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:16:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2023-08-24 11:16:14,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3773109243697479 [2023-08-24 11:16:14,694 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 449 transitions. [2023-08-24 11:16:14,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 449 transitions. [2023-08-24 11:16:14,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:14,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 449 transitions. [2023-08-24 11:16:14,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,696 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,696 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 146 flow. Second operand 5 states and 449 transitions. [2023-08-24 11:16:14,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 309 flow [2023-08-24 11:16:14,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 293 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:14,698 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 157 flow [2023-08-24 11:16:14,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-08-24 11:16:14,698 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2023-08-24 11:16:14,699 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 157 flow [2023-08-24 11:16:14,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:14,699 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:14,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 11:16:14,699 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:14,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1621444078, now seen corresponding path program 3 times [2023-08-24 11:16:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:14,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543952168] [2023-08-24 11:16:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:14,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:16:14,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:14,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543952168] [2023-08-24 11:16:14,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543952168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:14,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:14,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:16:14,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060974676] [2023-08-24 11:16:14,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:14,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:14,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:14,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:14,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:16:14,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 238 [2023-08-24 11:16:14,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:14,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 238 [2023-08-24 11:16:14,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:14,826 INFO L124 PetriNetUnfolderBase]: 250/486 cut-off events. [2023-08-24 11:16:14,826 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2023-08-24 11:16:14,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 486 events. 250/486 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2311 event pairs, 166 based on Foata normal form. 6/454 useless extension candidates. Maximal degree in co-relation 1447. Up to 375 conditions per place. [2023-08-24 11:16:14,828 INFO L140 encePairwiseOnDemand]: 231/238 looper letters, 32 selfloop transitions, 5 changer transitions 10/52 dead transitions. [2023-08-24 11:16:14,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 330 flow [2023-08-24 11:16:14,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:16:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:16:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2023-08-24 11:16:14,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37815126050420167 [2023-08-24 11:16:14,829 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 450 transitions. [2023-08-24 11:16:14,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 450 transitions. [2023-08-24 11:16:14,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:14,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 450 transitions. [2023-08-24 11:16:14,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,832 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,832 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 157 flow. Second operand 5 states and 450 transitions. [2023-08-24 11:16:14,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 330 flow [2023-08-24 11:16:14,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 319 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:14,834 INFO L231 Difference]: Finished difference. Result has 55 places, 33 transitions, 170 flow [2023-08-24 11:16:14,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=33} [2023-08-24 11:16:14,834 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 26 predicate places. [2023-08-24 11:16:14,834 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 33 transitions, 170 flow [2023-08-24 11:16:14,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:14,835 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:14,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 11:16:14,835 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:14,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash 10729971, now seen corresponding path program 1 times [2023-08-24 11:16:14,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:14,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534760809] [2023-08-24 11:16:14,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:14,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:16:14,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:14,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534760809] [2023-08-24 11:16:14,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534760809] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:14,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:14,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:14,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474107693] [2023-08-24 11:16:14,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:14,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:14,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:14,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:14,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:14,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2023-08-24 11:16:14,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 33 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:14,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2023-08-24 11:16:14,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:14,951 INFO L124 PetriNetUnfolderBase]: 83/175 cut-off events. [2023-08-24 11:16:14,952 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-08-24 11:16:14,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 175 events. 83/175 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 672 event pairs, 39 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 489. Up to 100 conditions per place. [2023-08-24 11:16:14,952 INFO L140 encePairwiseOnDemand]: 236/238 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2023-08-24 11:16:14,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 168 flow [2023-08-24 11:16:14,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-24 11:16:14,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2023-08-24 11:16:14,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-24 11:16:14,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-24 11:16:14,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:14,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-24 11:16:14,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 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-24 11:16:14,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,956 INFO L175 Difference]: Start difference. First operand has 55 places, 33 transitions, 170 flow. Second operand 3 states and 336 transitions. [2023-08-24 11:16:14,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 168 flow [2023-08-24 11:16:14,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 163 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-24 11:16:14,956 INFO L231 Difference]: Finished difference. Result has 34 places, 0 transitions, 0 flow [2023-08-24 11:16:14,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=34, PETRI_TRANSITIONS=0} [2023-08-24 11:16:14,957 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2023-08-24 11:16:14,957 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 0 transitions, 0 flow [2023-08-24 11:16:14,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:14,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-24 11:16:14,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-24 11:16:14,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-24 11:16:14,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 11:16:14,958 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:14,959 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-24 11:16:14,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 258 flow [2023-08-24 11:16:14,968 INFO L124 PetriNetUnfolderBase]: 17/145 cut-off events. [2023-08-24 11:16:14,968 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:16:14,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 145 events. 17/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 252 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 100. Up to 6 conditions per place. [2023-08-24 11:16:14,969 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 123 transitions, 258 flow [2023-08-24 11:16:14,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 123 transitions, 258 flow [2023-08-24 11:16:14,970 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:16:14,970 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 123 transitions, 258 flow [2023-08-24 11:16:14,970 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 123 transitions, 258 flow [2023-08-24 11:16:14,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 123 transitions, 258 flow [2023-08-24 11:16:14,979 INFO L124 PetriNetUnfolderBase]: 17/145 cut-off events. [2023-08-24 11:16:14,980 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:16:14,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 145 events. 17/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 252 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 100. Up to 6 conditions per place. [2023-08-24 11:16:14,982 INFO L119 LiptonReduction]: Number of co-enabled transitions 6248 [2023-08-24 11:16:16,917 INFO L134 LiptonReduction]: Checked pairs total: 8937 [2023-08-24 11:16:16,917 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-24 11:16:16,918 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-24 11:16:16,918 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;@269f79d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:16:16,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-24 11:16:16,920 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:16:16,920 INFO L124 PetriNetUnfolderBase]: 8/37 cut-off events. [2023-08-24 11:16:16,920 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:16:16,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:16,920 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-24 11:16:16,922 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 11:16:16,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:16,923 INFO L85 PathProgramCache]: Analyzing trace with hash 225006693, now seen corresponding path program 1 times [2023-08-24 11:16:16,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:16,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257595548] [2023-08-24 11:16:16,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:16,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:16:16,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:16:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:16:16,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:16:16,943 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:16:16,943 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-24 11:16:16,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 11:16:16,943 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-24 11:16:16,944 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-24 11:16:16,944 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 11:16:16,944 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-24 11:16:16,958 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:16:16,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 168 transitions, 357 flow [2023-08-24 11:16:16,976 INFO L124 PetriNetUnfolderBase]: 25/202 cut-off events. [2023-08-24 11:16:16,976 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-24 11:16:16,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 202 events. 25/202 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 484 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 149. Up to 8 conditions per place. [2023-08-24 11:16:16,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 168 transitions, 357 flow [2023-08-24 11:16:16,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 168 transitions, 357 flow [2023-08-24 11:16:16,978 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:16:16,978 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 168 transitions, 357 flow [2023-08-24 11:16:16,978 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 168 transitions, 357 flow [2023-08-24 11:16:16,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 168 transitions, 357 flow [2023-08-24 11:16:16,990 INFO L124 PetriNetUnfolderBase]: 25/202 cut-off events. [2023-08-24 11:16:16,990 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-24 11:16:16,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 202 events. 25/202 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 484 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 149. Up to 8 conditions per place. [2023-08-24 11:16:16,996 INFO L119 LiptonReduction]: Number of co-enabled transitions 15312 [2023-08-24 11:16:19,241 INFO L134 LiptonReduction]: Checked pairs total: 23024 [2023-08-24 11:16:19,241 INFO L136 LiptonReduction]: Total number of compositions: 161 [2023-08-24 11:16:19,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:16:19,245 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;@269f79d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:16:19,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 11:16:19,252 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:16:19,252 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2023-08-24 11:16:19,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:16:19,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:19,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 11:16:19,252 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:19,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:19,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2142436163, now seen corresponding path program 1 times [2023-08-24 11:16:19,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:19,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69441199] [2023-08-24 11:16:19,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:19,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:16:19,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:19,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69441199] [2023-08-24 11:16:19,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69441199] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:19,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:19,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:16:19,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011567717] [2023-08-24 11:16:19,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:19,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-24 11:16:19,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:19,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-24 11:16:19,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-24 11:16:19,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 329 [2023-08-24 11:16:19,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 45 transitions, 111 flow. Second operand has 2 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:19,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 329 [2023-08-24 11:16:19,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:19,379 INFO L124 PetriNetUnfolderBase]: 798/1428 cut-off events. [2023-08-24 11:16:19,379 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2023-08-24 11:16:19,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2658 conditions, 1428 events. 798/1428 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7709 event pairs, 564 based on Foata normal form. 166/1329 useless extension candidates. Maximal degree in co-relation 405. Up to 1049 conditions per place. [2023-08-24 11:16:19,385 INFO L140 encePairwiseOnDemand]: 322/329 looper letters, 20 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2023-08-24 11:16:19,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 137 flow [2023-08-24 11:16:19,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-24 11:16:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-24 11:16:19,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 317 transitions. [2023-08-24 11:16:19,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817629179331307 [2023-08-24 11:16:19,386 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 317 transitions. [2023-08-24 11:16:19,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 317 transitions. [2023-08-24 11:16:19,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:19,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 317 transitions. [2023-08-24 11:16:19,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 158.5) internal successors, (317), 2 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,388 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,388 INFO L175 Difference]: Start difference. First operand has 40 places, 45 transitions, 111 flow. Second operand 2 states and 317 transitions. [2023-08-24 11:16:19,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 137 flow [2023-08-24 11:16:19,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 131 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-24 11:16:19,388 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 91 flow [2023-08-24 11:16:19,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2023-08-24 11:16:19,389 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-24 11:16:19,389 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 91 flow [2023-08-24 11:16:19,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:19,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:19,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 11:16:19,389 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:19,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:19,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2034945852, now seen corresponding path program 1 times [2023-08-24 11:16:19,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:19,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166881388] [2023-08-24 11:16:19,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:19,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:16:19,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:19,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166881388] [2023-08-24 11:16:19,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166881388] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:19,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:19,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:19,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805122810] [2023-08-24 11:16:19,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:19,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:19,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:19,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:19,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:19,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 329 [2023-08-24 11:16:19,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:19,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 329 [2023-08-24 11:16:19,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:19,532 INFO L124 PetriNetUnfolderBase]: 953/1621 cut-off events. [2023-08-24 11:16:19,532 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2023-08-24 11:16:19,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3014 conditions, 1621 events. 953/1621 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8780 event pairs, 464 based on Foata normal form. 0/1324 useless extension candidates. Maximal degree in co-relation 3008. Up to 1049 conditions per place. [2023-08-24 11:16:19,538 INFO L140 encePairwiseOnDemand]: 326/329 looper letters, 32 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-24 11:16:19,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 197 flow [2023-08-24 11:16:19,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-08-24 11:16:19,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44883485309017224 [2023-08-24 11:16:19,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-08-24 11:16:19,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-08-24 11:16:19,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:19,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-08-24 11:16:19,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,543 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,543 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 91 flow. Second operand 3 states and 443 transitions. [2023-08-24 11:16:19,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 197 flow [2023-08-24 11:16:19,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 197 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:16:19,545 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 103 flow [2023-08-24 11:16:19,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-08-24 11:16:19,545 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-24 11:16:19,545 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 103 flow [2023-08-24 11:16:19,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:19,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:19,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 11:16:19,546 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:19,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:19,546 INFO L85 PathProgramCache]: Analyzing trace with hash 841924197, now seen corresponding path program 1 times [2023-08-24 11:16:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:19,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353874589] [2023-08-24 11:16:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:16:19,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:19,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353874589] [2023-08-24 11:16:19,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353874589] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:19,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:19,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:19,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723683109] [2023-08-24 11:16:19,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:19,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:19,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:19,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:19,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:19,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 329 [2023-08-24 11:16:19,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:19,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 329 [2023-08-24 11:16:19,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:19,891 INFO L124 PetriNetUnfolderBase]: 4163/6123 cut-off events. [2023-08-24 11:16:19,891 INFO L125 PetriNetUnfolderBase]: For 978/978 co-relation queries the response was YES. [2023-08-24 11:16:19,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12904 conditions, 6123 events. 4163/6123 cut-off events. For 978/978 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 34674 event pairs, 2077 based on Foata normal form. 0/4603 useless extension candidates. Maximal degree in co-relation 12896. Up to 4000 conditions per place. [2023-08-24 11:16:19,916 INFO L140 encePairwiseOnDemand]: 323/329 looper letters, 51 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-08-24 11:16:19,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 271 flow [2023-08-24 11:16:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:19,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-24 11:16:19,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275582573454914 [2023-08-24 11:16:19,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-24 11:16:19,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-24 11:16:19,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:19,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-24 11:16:19,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,921 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 103 flow. Second operand 3 states and 422 transitions. [2023-08-24 11:16:19,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 271 flow [2023-08-24 11:16:19,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 267 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 11:16:19,922 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 133 flow [2023-08-24 11:16:19,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-08-24 11:16:19,922 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-24 11:16:19,922 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 133 flow [2023-08-24 11:16:19,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:19,923 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:19,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-24 11:16:19,923 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:19,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:19,923 INFO L85 PathProgramCache]: Analyzing trace with hash 834108639, now seen corresponding path program 1 times [2023-08-24 11:16:19,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:19,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590808391] [2023-08-24 11:16:19,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:19,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590808391] [2023-08-24 11:16:19,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590808391] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:19,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:19,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48769541] [2023-08-24 11:16:19,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:19,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:19,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 329 [2023-08-24 11:16:19,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:19,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:19,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 329 [2023-08-24 11:16:19,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:20,113 INFO L124 PetriNetUnfolderBase]: 1460/2516 cut-off events. [2023-08-24 11:16:20,114 INFO L125 PetriNetUnfolderBase]: For 558/597 co-relation queries the response was YES. [2023-08-24 11:16:20,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5253 conditions, 2516 events. 1460/2516 cut-off events. For 558/597 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15102 event pairs, 880 based on Foata normal form. 0/2085 useless extension candidates. Maximal degree in co-relation 5244. Up to 1693 conditions per place. [2023-08-24 11:16:20,126 INFO L140 encePairwiseOnDemand]: 326/329 looper letters, 35 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-24 11:16:20,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 254 flow [2023-08-24 11:16:20,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2023-08-24 11:16:20,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44782168186423504 [2023-08-24 11:16:20,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2023-08-24 11:16:20,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2023-08-24 11:16:20,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:20,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2023-08-24 11:16:20,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,130 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 133 flow. Second operand 3 states and 442 transitions. [2023-08-24 11:16:20,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 254 flow [2023-08-24 11:16:20,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:20,131 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 135 flow [2023-08-24 11:16:20,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2023-08-24 11:16:20,131 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-08-24 11:16:20,132 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 135 flow [2023-08-24 11:16:20,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:20,132 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:20,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-24 11:16:20,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:20,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1719529064, now seen corresponding path program 1 times [2023-08-24 11:16:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:20,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008961830] [2023-08-24 11:16:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:20,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 11:16:20,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:20,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008961830] [2023-08-24 11:16:20,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008961830] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:20,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:20,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:20,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612654303] [2023-08-24 11:16:20,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:20,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:20,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:20,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:20,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:20,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 329 [2023-08-24 11:16:20,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:20,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 329 [2023-08-24 11:16:20,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:20,540 INFO L124 PetriNetUnfolderBase]: 5095/7671 cut-off events. [2023-08-24 11:16:20,540 INFO L125 PetriNetUnfolderBase]: For 2297/2297 co-relation queries the response was YES. [2023-08-24 11:16:20,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17740 conditions, 7671 events. 5095/7671 cut-off events. For 2297/2297 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 46409 event pairs, 2469 based on Foata normal form. 0/6201 useless extension candidates. Maximal degree in co-relation 17730. Up to 4706 conditions per place. [2023-08-24 11:16:20,569 INFO L140 encePairwiseOnDemand]: 323/329 looper letters, 55 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2023-08-24 11:16:20,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 334 flow [2023-08-24 11:16:20,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-24 11:16:20,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265450861195542 [2023-08-24 11:16:20,570 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-24 11:16:20,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-24 11:16:20,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:20,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-24 11:16:20,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,573 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 135 flow. Second operand 3 states and 421 transitions. [2023-08-24 11:16:20,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 334 flow [2023-08-24 11:16:20,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 330 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 11:16:20,575 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 183 flow [2023-08-24 11:16:20,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2023-08-24 11:16:20,575 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2023-08-24 11:16:20,575 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 183 flow [2023-08-24 11:16:20,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:20,575 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:20,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-24 11:16:20,576 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:20,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:20,576 INFO L85 PathProgramCache]: Analyzing trace with hash 454990788, now seen corresponding path program 1 times [2023-08-24 11:16:20,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:20,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008437834] [2023-08-24 11:16:20,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:20,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:16:20,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:20,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008437834] [2023-08-24 11:16:20,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008437834] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:20,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:20,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:20,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912565566] [2023-08-24 11:16:20,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:20,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:20,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:20,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:20,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:20,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 329 [2023-08-24 11:16:20,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:20,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 329 [2023-08-24 11:16:20,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:20,824 INFO L124 PetriNetUnfolderBase]: 2167/3900 cut-off events. [2023-08-24 11:16:20,825 INFO L125 PetriNetUnfolderBase]: For 1435/1596 co-relation queries the response was YES. [2023-08-24 11:16:20,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8734 conditions, 3900 events. 2167/3900 cut-off events. For 1435/1596 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 26384 event pairs, 1337 based on Foata normal form. 9/3403 useless extension candidates. Maximal degree in co-relation 8723. Up to 2588 conditions per place. [2023-08-24 11:16:20,839 INFO L140 encePairwiseOnDemand]: 326/329 looper letters, 38 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-24 11:16:20,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 317 flow [2023-08-24 11:16:20,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-08-24 11:16:20,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2023-08-24 11:16:20,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-08-24 11:16:20,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-08-24 11:16:20,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:20,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-08-24 11:16:20,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,843 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 183 flow. Second operand 3 states and 441 transitions. [2023-08-24 11:16:20,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 317 flow [2023-08-24 11:16:20,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:20,847 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 181 flow [2023-08-24 11:16:20,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-08-24 11:16:20,847 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-08-24 11:16:20,847 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 181 flow [2023-08-24 11:16:20,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:20,848 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:20,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-24 11:16:20,848 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:20,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash -421046865, now seen corresponding path program 1 times [2023-08-24 11:16:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:20,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103175536] [2023-08-24 11:16:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-24 11:16:20,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:20,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103175536] [2023-08-24 11:16:20,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103175536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:20,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:20,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:20,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697845113] [2023-08-24 11:16:20,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:20,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:20,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:20,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:20,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:20,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 329 [2023-08-24 11:16:20,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:20,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:20,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 329 [2023-08-24 11:16:20,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:21,335 INFO L124 PetriNetUnfolderBase]: 5809/8699 cut-off events. [2023-08-24 11:16:21,335 INFO L125 PetriNetUnfolderBase]: For 3687/3687 co-relation queries the response was YES. [2023-08-24 11:16:21,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21986 conditions, 8699 events. 5809/8699 cut-off events. For 3687/3687 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 52783 event pairs, 2793 based on Foata normal form. 0/7515 useless extension candidates. Maximal degree in co-relation 21974. Up to 5182 conditions per place. [2023-08-24 11:16:21,365 INFO L140 encePairwiseOnDemand]: 323/329 looper letters, 59 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2023-08-24 11:16:21,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 75 transitions, 417 flow [2023-08-24 11:16:21,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-24 11:16:21,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2023-08-24 11:16:21,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-24 11:16:21,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-24 11:16:21,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:21,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-24 11:16:21,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:21,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:21,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:21,369 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 181 flow. Second operand 3 states and 420 transitions. [2023-08-24 11:16:21,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 75 transitions, 417 flow [2023-08-24 11:16:21,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 413 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 11:16:21,373 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 255 flow [2023-08-24 11:16:21,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2023-08-24 11:16:21,374 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-08-24 11:16:21,374 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 255 flow [2023-08-24 11:16:21,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:21,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:21,374 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:21,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-24 11:16:21,374 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:21,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:21,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1012484161, now seen corresponding path program 1 times [2023-08-24 11:16:21,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:21,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923568494] [2023-08-24 11:16:21,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:21,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:21,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:21,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923568494] [2023-08-24 11:16:21,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923568494] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:16:21,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067359417] [2023-08-24 11:16:21,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:21,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:21,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:16:21,409 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:16:21,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 11:16:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:21,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 11:16:21,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:16:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:21,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:16:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:21,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067359417] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:16:21,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:16:21,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-24 11:16:21,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783486782] [2023-08-24 11:16:21,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:16:21,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:21,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:21,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:21,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:16:21,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 329 [2023-08-24 11:16:21,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:21,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:21,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 329 [2023-08-24 11:16:21,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:21,852 INFO L124 PetriNetUnfolderBase]: 2937/4831 cut-off events. [2023-08-24 11:16:21,853 INFO L125 PetriNetUnfolderBase]: For 3272/3601 co-relation queries the response was YES. [2023-08-24 11:16:21,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12744 conditions, 4831 events. 2937/4831 cut-off events. For 3272/3601 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 31622 event pairs, 1309 based on Foata normal form. 16/4332 useless extension candidates. Maximal degree in co-relation 12731. Up to 3198 conditions per place. [2023-08-24 11:16:21,877 INFO L140 encePairwiseOnDemand]: 326/329 looper letters, 58 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2023-08-24 11:16:21,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 513 flow [2023-08-24 11:16:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:16:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:16:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 593 transitions. [2023-08-24 11:16:21,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4506079027355623 [2023-08-24 11:16:21,880 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 593 transitions. [2023-08-24 11:16:21,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 593 transitions. [2023-08-24 11:16:21,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:21,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 593 transitions. [2023-08-24 11:16:21,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:21,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 329.0) internal successors, (1645), 5 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:21,883 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 329.0) internal successors, (1645), 5 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:21,883 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 255 flow. Second operand 4 states and 593 transitions. [2023-08-24 11:16:21,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 513 flow [2023-08-24 11:16:21,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 88 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:21,896 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 251 flow [2023-08-24 11:16:21,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2023-08-24 11:16:21,896 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2023-08-24 11:16:21,896 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 251 flow [2023-08-24 11:16:21,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:21,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:21,897 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:21,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-24 11:16:22,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-24 11:16:22,101 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:22,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:22,101 INFO L85 PathProgramCache]: Analyzing trace with hash -976937712, now seen corresponding path program 2 times [2023-08-24 11:16:22,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:22,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072602215] [2023-08-24 11:16:22,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:22,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:16:22,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:22,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072602215] [2023-08-24 11:16:22,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072602215] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:16:22,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290216538] [2023-08-24 11:16:22,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 11:16:22,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:22,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:16:22,153 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:16:22,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 11:16:22,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 11:16:22,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 11:16:22,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 11:16:22,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:16:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:16:22,233 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 11:16:22,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290216538] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:22,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 11:16:22,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-24 11:16:22,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347405175] [2023-08-24 11:16:22,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:22,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:22,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:22,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:16:22,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-08-24 11:16:22,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:22,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:22,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-08-24 11:16:22,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:22,894 INFO L124 PetriNetUnfolderBase]: 7252/11016 cut-off events. [2023-08-24 11:16:22,894 INFO L125 PetriNetUnfolderBase]: For 7552/7552 co-relation queries the response was YES. [2023-08-24 11:16:22,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30242 conditions, 11016 events. 7252/11016 cut-off events. For 7552/7552 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 72583 event pairs, 3181 based on Foata normal form. 0/9843 useless extension candidates. Maximal degree in co-relation 30228. Up to 5612 conditions per place. [2023-08-24 11:16:22,942 INFO L140 encePairwiseOnDemand]: 320/329 looper letters, 98 selfloop transitions, 20 changer transitions 2/126 dead transitions. [2023-08-24 11:16:22,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 126 transitions, 767 flow [2023-08-24 11:16:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:16:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:16:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 788 transitions. [2023-08-24 11:16:22,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39918946301925023 [2023-08-24 11:16:22,945 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 788 transitions. [2023-08-24 11:16:22,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 788 transitions. [2023-08-24 11:16:22,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:22,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 788 transitions. [2023-08-24 11:16:22,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 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-24 11:16:22,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:22,948 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:22,948 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 251 flow. Second operand 6 states and 788 transitions. [2023-08-24 11:16:22,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 126 transitions, 767 flow [2023-08-24 11:16:22,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 126 transitions, 759 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:22,954 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 395 flow [2023-08-24 11:16:22,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=395, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-08-24 11:16:22,954 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 23 predicate places. [2023-08-24 11:16:22,954 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 395 flow [2023-08-24 11:16:22,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:22,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:22,954 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:22,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-24 11:16:23,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:23,158 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:23,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:23,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1283723568, now seen corresponding path program 3 times [2023-08-24 11:16:23,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:23,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099091353] [2023-08-24 11:16:23,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:23,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:16:23,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:23,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099091353] [2023-08-24 11:16:23,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099091353] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:16:23,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49011581] [2023-08-24 11:16:23,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 11:16:23,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:23,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:16:23,195 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:16:23,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 11:16:23,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-24 11:16:23,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 11:16:23,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 11:16:23,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:16:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:16:23,272 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 11:16:23,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49011581] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:23,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 11:16:23,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-24 11:16:23,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466813393] [2023-08-24 11:16:23,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:23,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:23,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:23,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:23,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:16:23,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-08-24 11:16:23,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 395 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:23,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:23,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-08-24 11:16:23,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:24,157 INFO L124 PetriNetUnfolderBase]: 8460/13156 cut-off events. [2023-08-24 11:16:24,157 INFO L125 PetriNetUnfolderBase]: For 15407/15407 co-relation queries the response was YES. [2023-08-24 11:16:24,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38164 conditions, 13156 events. 8460/13156 cut-off events. For 15407/15407 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 92065 event pairs, 5228 based on Foata normal form. 84/12302 useless extension candidates. Maximal degree in co-relation 38146. Up to 9521 conditions per place. [2023-08-24 11:16:24,207 INFO L140 encePairwiseOnDemand]: 320/329 looper letters, 110 selfloop transitions, 32 changer transitions 4/152 dead transitions. [2023-08-24 11:16:24,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 152 transitions, 1168 flow [2023-08-24 11:16:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:16:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:16:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 787 transitions. [2023-08-24 11:16:24,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39868287740628167 [2023-08-24 11:16:24,209 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 787 transitions. [2023-08-24 11:16:24,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 787 transitions. [2023-08-24 11:16:24,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:24,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 787 transitions. [2023-08-24 11:16:24,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:24,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:24,212 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:24,212 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 395 flow. Second operand 6 states and 787 transitions. [2023-08-24 11:16:24,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 152 transitions, 1168 flow [2023-08-24 11:16:24,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 152 transitions, 1168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:16:24,264 INFO L231 Difference]: Finished difference. Result has 72 places, 91 transitions, 804 flow [2023-08-24 11:16:24,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=804, PETRI_PLACES=72, PETRI_TRANSITIONS=91} [2023-08-24 11:16:24,265 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2023-08-24 11:16:24,265 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 91 transitions, 804 flow [2023-08-24 11:16:24,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:24,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:24,265 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:24,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 11:16:24,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:24,469 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:24,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:24,469 INFO L85 PathProgramCache]: Analyzing trace with hash -819042120, now seen corresponding path program 1 times [2023-08-24 11:16:24,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:24,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118164135] [2023-08-24 11:16:24,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:24,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:24,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:16:24,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:24,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118164135] [2023-08-24 11:16:24,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118164135] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:16:24,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800747500] [2023-08-24 11:16:24,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:24,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:24,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:16:24,648 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:16:24,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-24 11:16:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:24,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 11:16:24,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:16:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:16:24,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:16:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:16:24,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800747500] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:16:24,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:16:24,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-24 11:16:24,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305772965] [2023-08-24 11:16:24,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:16:24,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:24,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:24,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:24,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:16:24,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 329 [2023-08-24 11:16:24,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 91 transitions, 804 flow. Second operand has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:24,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:24,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 329 [2023-08-24 11:16:24,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:25,475 INFO L124 PetriNetUnfolderBase]: 4652/8054 cut-off events. [2023-08-24 11:16:25,476 INFO L125 PetriNetUnfolderBase]: For 14790/16274 co-relation queries the response was YES. [2023-08-24 11:16:25,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24202 conditions, 8054 events. 4652/8054 cut-off events. For 14790/16274 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 61485 event pairs, 2922 based on Foata normal form. 146/7454 useless extension candidates. Maximal degree in co-relation 24179. Up to 5679 conditions per place. [2023-08-24 11:16:25,523 INFO L140 encePairwiseOnDemand]: 326/329 looper letters, 65 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2023-08-24 11:16:25,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 126 transitions, 1088 flow [2023-08-24 11:16:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:16:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:16:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 591 transitions. [2023-08-24 11:16:25,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4490881458966565 [2023-08-24 11:16:25,540 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 591 transitions. [2023-08-24 11:16:25,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 591 transitions. [2023-08-24 11:16:25,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:25,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 591 transitions. [2023-08-24 11:16:25,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:25,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 329.0) internal successors, (1645), 5 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:25,543 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 329.0) internal successors, (1645), 5 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:25,543 INFO L175 Difference]: Start difference. First operand has 72 places, 91 transitions, 804 flow. Second operand 4 states and 591 transitions. [2023-08-24 11:16:25,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 126 transitions, 1088 flow [2023-08-24 11:16:25,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 126 transitions, 1068 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-24 11:16:25,662 INFO L231 Difference]: Finished difference. Result has 76 places, 92 transitions, 800 flow [2023-08-24 11:16:25,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=800, PETRI_PLACES=76, PETRI_TRANSITIONS=92} [2023-08-24 11:16:25,662 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2023-08-24 11:16:25,662 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 92 transitions, 800 flow [2023-08-24 11:16:25,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:25,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:25,663 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:25,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-24 11:16:25,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-24 11:16:25,867 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:25,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:25,867 INFO L85 PathProgramCache]: Analyzing trace with hash -316172729, now seen corresponding path program 2 times [2023-08-24 11:16:25,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:25,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488139302] [2023-08-24 11:16:25,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:25,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:16:25,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:25,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488139302] [2023-08-24 11:16:25,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488139302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:25,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:25,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:16:25,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111208605] [2023-08-24 11:16:25,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:25,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:25,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:25,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:25,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:16:25,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-08-24 11:16:25,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 92 transitions, 800 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:25,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:25,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-08-24 11:16:25,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:27,105 INFO L124 PetriNetUnfolderBase]: 9916/15548 cut-off events. [2023-08-24 11:16:27,106 INFO L125 PetriNetUnfolderBase]: For 33363/33363 co-relation queries the response was YES. [2023-08-24 11:16:27,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50105 conditions, 15548 events. 9916/15548 cut-off events. For 33363/33363 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 113354 event pairs, 4358 based on Foata normal form. 78/14574 useless extension candidates. Maximal degree in co-relation 50080. Up to 7461 conditions per place. [2023-08-24 11:16:27,166 INFO L140 encePairwiseOnDemand]: 320/329 looper letters, 117 selfloop transitions, 40 changer transitions 3/166 dead transitions. [2023-08-24 11:16:27,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 166 transitions, 1508 flow [2023-08-24 11:16:27,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:16:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:16:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 787 transitions. [2023-08-24 11:16:27,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39868287740628167 [2023-08-24 11:16:27,168 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 787 transitions. [2023-08-24 11:16:27,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 787 transitions. [2023-08-24 11:16:27,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:27,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 787 transitions. [2023-08-24 11:16:27,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:27,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:27,172 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:27,172 INFO L175 Difference]: Start difference. First operand has 76 places, 92 transitions, 800 flow. Second operand 6 states and 787 transitions. [2023-08-24 11:16:27,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 166 transitions, 1508 flow [2023-08-24 11:16:27,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 166 transitions, 1500 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:27,380 INFO L231 Difference]: Finished difference. Result has 83 places, 104 transitions, 1075 flow [2023-08-24 11:16:27,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1075, PETRI_PLACES=83, PETRI_TRANSITIONS=104} [2023-08-24 11:16:27,380 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2023-08-24 11:16:27,381 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 104 transitions, 1075 flow [2023-08-24 11:16:27,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:27,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:27,381 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:27,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-24 11:16:27,381 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:27,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash 195544307, now seen corresponding path program 3 times [2023-08-24 11:16:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967677872] [2023-08-24 11:16:27,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:27,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:16:27,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:27,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967677872] [2023-08-24 11:16:27,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967677872] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:27,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:27,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:16:27,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905052424] [2023-08-24 11:16:27,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:27,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:27,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:27,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:27,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:16:27,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-08-24 11:16:27,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 104 transitions, 1075 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:27,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:27,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-08-24 11:16:27,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:28,948 INFO L124 PetriNetUnfolderBase]: 11112/17638 cut-off events. [2023-08-24 11:16:28,948 INFO L125 PetriNetUnfolderBase]: For 56005/56005 co-relation queries the response was YES. [2023-08-24 11:16:28,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59731 conditions, 17638 events. 11112/17638 cut-off events. For 56005/56005 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 134004 event pairs, 7374 based on Foata normal form. 84/16589 useless extension candidates. Maximal degree in co-relation 59702. Up to 13601 conditions per place. [2023-08-24 11:16:29,017 INFO L140 encePairwiseOnDemand]: 320/329 looper letters, 146 selfloop transitions, 40 changer transitions 4/196 dead transitions. [2023-08-24 11:16:29,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 196 transitions, 2152 flow [2023-08-24 11:16:29,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:16:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:16:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 788 transitions. [2023-08-24 11:16:29,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39918946301925023 [2023-08-24 11:16:29,019 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 788 transitions. [2023-08-24 11:16:29,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 788 transitions. [2023-08-24 11:16:29,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:29,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 788 transitions. [2023-08-24 11:16:29,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 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-24 11:16:29,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:29,022 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:29,022 INFO L175 Difference]: Start difference. First operand has 83 places, 104 transitions, 1075 flow. Second operand 6 states and 788 transitions. [2023-08-24 11:16:29,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 196 transitions, 2152 flow [2023-08-24 11:16:29,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 196 transitions, 2128 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-24 11:16:29,416 INFO L231 Difference]: Finished difference. Result has 92 places, 134 transitions, 1653 flow [2023-08-24 11:16:29,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1653, PETRI_PLACES=92, PETRI_TRANSITIONS=134} [2023-08-24 11:16:29,416 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 52 predicate places. [2023-08-24 11:16:29,416 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 134 transitions, 1653 flow [2023-08-24 11:16:29,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:29,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:29,417 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:29,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-24 11:16:29,417 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:29,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:29,417 INFO L85 PathProgramCache]: Analyzing trace with hash 824640343, now seen corresponding path program 1 times [2023-08-24 11:16:29,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:29,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123066570] [2023-08-24 11:16:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:29,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:16:29,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:29,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123066570] [2023-08-24 11:16:29,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123066570] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:29,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:29,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:29,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411492372] [2023-08-24 11:16:29,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:29,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:29,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:29,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:29,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:29,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 329 [2023-08-24 11:16:29,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 134 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:29,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:29,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 329 [2023-08-24 11:16:29,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:29,918 INFO L124 PetriNetUnfolderBase]: 2859/5413 cut-off events. [2023-08-24 11:16:29,919 INFO L125 PetriNetUnfolderBase]: For 17980/18226 co-relation queries the response was YES. [2023-08-24 11:16:29,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18603 conditions, 5413 events. 2859/5413 cut-off events. For 17980/18226 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 40247 event pairs, 1411 based on Foata normal form. 12/5100 useless extension candidates. Maximal degree in co-relation 18569. Up to 3092 conditions per place. [2023-08-24 11:16:29,941 INFO L140 encePairwiseOnDemand]: 323/329 looper letters, 66 selfloop transitions, 6 changer transitions 0/121 dead transitions. [2023-08-24 11:16:29,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 121 transitions, 1315 flow [2023-08-24 11:16:29,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-24 11:16:29,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47315096251266464 [2023-08-24 11:16:29,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-24 11:16:29,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-24 11:16:29,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:29,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-24 11:16:29,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:29,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:29,944 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:29,944 INFO L175 Difference]: Start difference. First operand has 92 places, 134 transitions, 1653 flow. Second operand 3 states and 467 transitions. [2023-08-24 11:16:29,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 121 transitions, 1315 flow [2023-08-24 11:16:30,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 121 transitions, 1240 flow, removed 31 selfloop flow, removed 1 redundant places. [2023-08-24 11:16:30,063 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 870 flow [2023-08-24 11:16:30,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2023-08-24 11:16:30,064 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 53 predicate places. [2023-08-24 11:16:30,064 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 870 flow [2023-08-24 11:16:30,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:30,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:30,064 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:30,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-24 11:16:30,064 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:30,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:30,064 INFO L85 PathProgramCache]: Analyzing trace with hash 423314739, now seen corresponding path program 1 times [2023-08-24 11:16:30,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:30,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599208895] [2023-08-24 11:16:30,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:30,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-24 11:16:30,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:30,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599208895] [2023-08-24 11:16:30,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599208895] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:16:30,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872232798] [2023-08-24 11:16:30,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:30,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:30,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:16:30,114 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:16:30,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-24 11:16:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:30,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 11:16:30,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:16:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-24 11:16:30,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:16:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-24 11:16:30,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872232798] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:16:30,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:16:30,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-24 11:16:30,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116238643] [2023-08-24 11:16:30,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:16:30,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:30,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:30,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:30,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:16:30,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 329 [2023-08-24 11:16:30,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 870 flow. Second operand has 5 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:30,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:30,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 329 [2023-08-24 11:16:30,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:30,636 INFO L124 PetriNetUnfolderBase]: 3159/5673 cut-off events. [2023-08-24 11:16:30,636 INFO L125 PetriNetUnfolderBase]: For 17258/17538 co-relation queries the response was YES. [2023-08-24 11:16:30,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19543 conditions, 5673 events. 3159/5673 cut-off events. For 17258/17538 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 40530 event pairs, 1809 based on Foata normal form. 104/5716 useless extension candidates. Maximal degree in co-relation 19509. Up to 3820 conditions per place. [2023-08-24 11:16:30,658 INFO L140 encePairwiseOnDemand]: 326/329 looper letters, 76 selfloop transitions, 3 changer transitions 0/128 dead transitions. [2023-08-24 11:16:30,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 128 transitions, 1230 flow [2023-08-24 11:16:30,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:16:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:16:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 589 transitions. [2023-08-24 11:16:30,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44756838905775076 [2023-08-24 11:16:30,660 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 589 transitions. [2023-08-24 11:16:30,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 589 transitions. [2023-08-24 11:16:30,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:30,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 589 transitions. [2023-08-24 11:16:30,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:30,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 329.0) internal successors, (1645), 5 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:30,662 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 329.0) internal successors, (1645), 5 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:30,662 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 870 flow. Second operand 4 states and 589 transitions. [2023-08-24 11:16:30,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 128 transitions, 1230 flow [2023-08-24 11:16:30,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 128 transitions, 1216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:16:30,711 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 880 flow [2023-08-24 11:16:30,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=880, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2023-08-24 11:16:30,711 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 56 predicate places. [2023-08-24 11:16:30,711 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 880 flow [2023-08-24 11:16:30,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:30,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:30,712 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:30,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-24 11:16:30,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:16:30,915 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:30,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1402124064, now seen corresponding path program 2 times [2023-08-24 11:16:30,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:30,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996178234] [2023-08-24 11:16:30,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-24 11:16:30,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:30,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996178234] [2023-08-24 11:16:30,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996178234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:30,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:30,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:16:30,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422646625] [2023-08-24 11:16:30,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:30,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:30,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:30,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:30,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:16:30,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-08-24 11:16:30,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 880 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:30,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:30,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-08-24 11:16:30,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:31,665 INFO L124 PetriNetUnfolderBase]: 5188/8517 cut-off events. [2023-08-24 11:16:31,665 INFO L125 PetriNetUnfolderBase]: For 26480/26480 co-relation queries the response was YES. [2023-08-24 11:16:31,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30299 conditions, 8517 events. 5188/8517 cut-off events. For 26480/26480 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 59381 event pairs, 2417 based on Foata normal form. 94/8368 useless extension candidates. Maximal degree in co-relation 30263. Up to 4028 conditions per place. [2023-08-24 11:16:31,710 INFO L140 encePairwiseOnDemand]: 320/329 looper letters, 112 selfloop transitions, 32 changer transitions 8/158 dead transitions. [2023-08-24 11:16:31,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 158 transitions, 1646 flow [2023-08-24 11:16:31,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:16:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:16:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2023-08-24 11:16:31,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951367781155015 [2023-08-24 11:16:31,712 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 780 transitions. [2023-08-24 11:16:31,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 780 transitions. [2023-08-24 11:16:31,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:31,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 780 transitions. [2023-08-24 11:16:31,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:31,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:31,715 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:31,715 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 880 flow. Second operand 6 states and 780 transitions. [2023-08-24 11:16:31,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 158 transitions, 1646 flow [2023-08-24 11:16:31,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 158 transitions, 1612 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:31,854 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 1022 flow [2023-08-24 11:16:31,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1022, PETRI_PLACES=103, PETRI_TRANSITIONS=93} [2023-08-24 11:16:31,855 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 63 predicate places. [2023-08-24 11:16:31,855 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 1022 flow [2023-08-24 11:16:31,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:31,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:31,855 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:31,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-24 11:16:31,855 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:31,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2102118292, now seen corresponding path program 1 times [2023-08-24 11:16:31,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:31,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210777958] [2023-08-24 11:16:31,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:31,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-24 11:16:31,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:31,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210777958] [2023-08-24 11:16:31,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210777958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:31,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:31,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:16:31,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107561176] [2023-08-24 11:16:31,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:31,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:31,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:31,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:31,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:16:31,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-08-24 11:16:31,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 93 transitions, 1022 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:31,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:31,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-08-24 11:16:31,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:32,754 INFO L124 PetriNetUnfolderBase]: 5245/8711 cut-off events. [2023-08-24 11:16:32,755 INFO L125 PetriNetUnfolderBase]: For 31328/31328 co-relation queries the response was YES. [2023-08-24 11:16:32,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31555 conditions, 8711 events. 5245/8711 cut-off events. For 31328/31328 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 61566 event pairs, 2864 based on Foata normal form. 110/8772 useless extension candidates. Maximal degree in co-relation 31515. Up to 4663 conditions per place. [2023-08-24 11:16:32,800 INFO L140 encePairwiseOnDemand]: 320/329 looper letters, 103 selfloop transitions, 24 changer transitions 23/156 dead transitions. [2023-08-24 11:16:32,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 156 transitions, 1754 flow [2023-08-24 11:16:32,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:16:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:16:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2023-08-24 11:16:32,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3905775075987842 [2023-08-24 11:16:32,801 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 771 transitions. [2023-08-24 11:16:32,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 771 transitions. [2023-08-24 11:16:32,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:32,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 771 transitions. [2023-08-24 11:16:32,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:32,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:32,805 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:32,805 INFO L175 Difference]: Start difference. First operand has 103 places, 93 transitions, 1022 flow. Second operand 6 states and 771 transitions. [2023-08-24 11:16:32,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 156 transitions, 1754 flow [2023-08-24 11:16:32,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 156 transitions, 1725 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:32,979 INFO L231 Difference]: Finished difference. Result has 110 places, 89 transitions, 1031 flow [2023-08-24 11:16:32,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1031, PETRI_PLACES=110, PETRI_TRANSITIONS=89} [2023-08-24 11:16:32,980 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 70 predicate places. [2023-08-24 11:16:32,980 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 1031 flow [2023-08-24 11:16:32,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:32,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:32,980 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:32,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-24 11:16:32,981 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:32,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:32,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1615814549, now seen corresponding path program 1 times [2023-08-24 11:16:32,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:32,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440100289] [2023-08-24 11:16:32,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:32,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-24 11:16:33,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:33,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440100289] [2023-08-24 11:16:33,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440100289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:33,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:33,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:16:33,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264746821] [2023-08-24 11:16:33,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:33,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:33,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:33,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:33,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:16:33,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-08-24 11:16:33,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 89 transitions, 1031 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:33,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:33,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-08-24 11:16:33,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:33,821 INFO L124 PetriNetUnfolderBase]: 4719/7811 cut-off events. [2023-08-24 11:16:33,821 INFO L125 PetriNetUnfolderBase]: For 29294/29294 co-relation queries the response was YES. [2023-08-24 11:16:33,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28494 conditions, 7811 events. 4719/7811 cut-off events. For 29294/29294 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 53959 event pairs, 2292 based on Foata normal form. 104/7866 useless extension candidates. Maximal degree in co-relation 28451. Up to 3857 conditions per place. [2023-08-24 11:16:33,861 INFO L140 encePairwiseOnDemand]: 320/329 looper letters, 101 selfloop transitions, 24 changer transitions 17/148 dead transitions. [2023-08-24 11:16:33,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 148 transitions, 1706 flow [2023-08-24 11:16:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:16:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:16:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 774 transitions. [2023-08-24 11:16:33,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39209726443769 [2023-08-24 11:16:33,863 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 774 transitions. [2023-08-24 11:16:33,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 774 transitions. [2023-08-24 11:16:33,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:33,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 774 transitions. [2023-08-24 11:16:33,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:33,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:33,866 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:33,866 INFO L175 Difference]: Start difference. First operand has 110 places, 89 transitions, 1031 flow. Second operand 6 states and 774 transitions. [2023-08-24 11:16:33,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 148 transitions, 1706 flow [2023-08-24 11:16:34,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 148 transitions, 1611 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-08-24 11:16:34,040 INFO L231 Difference]: Finished difference. Result has 111 places, 85 transitions, 954 flow [2023-08-24 11:16:34,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=954, PETRI_PLACES=111, PETRI_TRANSITIONS=85} [2023-08-24 11:16:34,040 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 71 predicate places. [2023-08-24 11:16:34,040 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 954 flow [2023-08-24 11:16:34,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:34,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:34,040 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:34,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-24 11:16:34,041 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:34,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:34,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1537568021, now seen corresponding path program 1 times [2023-08-24 11:16:34,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:34,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573649160] [2023-08-24 11:16:34,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:34,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-24 11:16:34,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:34,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573649160] [2023-08-24 11:16:34,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573649160] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:34,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:34,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:16:34,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167501193] [2023-08-24 11:16:34,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:34,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:16:34,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:34,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:16:34,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:16:34,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 329 [2023-08-24 11:16:34,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 954 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:34,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:34,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 329 [2023-08-24 11:16:34,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:34,717 INFO L124 PetriNetUnfolderBase]: 4276/6932 cut-off events. [2023-08-24 11:16:34,717 INFO L125 PetriNetUnfolderBase]: For 24559/24559 co-relation queries the response was YES. [2023-08-24 11:16:34,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25356 conditions, 6932 events. 4276/6932 cut-off events. For 24559/24559 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 45124 event pairs, 2371 based on Foata normal form. 114/6997 useless extension candidates. Maximal degree in co-relation 25316. Up to 4036 conditions per place. [2023-08-24 11:16:34,749 INFO L140 encePairwiseOnDemand]: 320/329 looper letters, 87 selfloop transitions, 16 changer transitions 23/132 dead transitions. [2023-08-24 11:16:34,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 132 transitions, 1464 flow [2023-08-24 11:16:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:16:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:16:34,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2023-08-24 11:16:34,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3880445795339412 [2023-08-24 11:16:34,750 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 766 transitions. [2023-08-24 11:16:34,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions. [2023-08-24 11:16:34,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:34,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions. [2023-08-24 11:16:34,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:34,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:34,753 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:34,753 INFO L175 Difference]: Start difference. First operand has 111 places, 85 transitions, 954 flow. Second operand 6 states and 766 transitions. [2023-08-24 11:16:34,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 132 transitions, 1464 flow [2023-08-24 11:16:34,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 132 transitions, 1436 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:34,877 INFO L231 Difference]: Finished difference. Result has 115 places, 75 transitions, 798 flow [2023-08-24 11:16:34,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=798, PETRI_PLACES=115, PETRI_TRANSITIONS=75} [2023-08-24 11:16:34,877 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 75 predicate places. [2023-08-24 11:16:34,877 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 75 transitions, 798 flow [2023-08-24 11:16:34,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:34,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:34,877 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:34,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-24 11:16:34,877 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:34,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash -380507573, now seen corresponding path program 1 times [2023-08-24 11:16:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:34,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601751534] [2023-08-24 11:16:34,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:34,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:34,947 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-24 11:16:34,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:34,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601751534] [2023-08-24 11:16:34,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601751534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:34,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:34,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 11:16:34,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074777776] [2023-08-24 11:16:34,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:34,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:16:34,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:34,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:16:34,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:16:34,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 329 [2023-08-24 11:16:34,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 75 transitions, 798 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:34,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:34,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 329 [2023-08-24 11:16:34,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:35,639 INFO L124 PetriNetUnfolderBase]: 3814/6098 cut-off events. [2023-08-24 11:16:35,639 INFO L125 PetriNetUnfolderBase]: For 21716/21716 co-relation queries the response was YES. [2023-08-24 11:16:35,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22085 conditions, 6098 events. 3814/6098 cut-off events. For 21716/21716 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 38410 event pairs, 2003 based on Foata normal form. 12/6075 useless extension candidates. Maximal degree in co-relation 22043. Up to 3476 conditions per place. [2023-08-24 11:16:35,667 INFO L140 encePairwiseOnDemand]: 319/329 looper letters, 73 selfloop transitions, 15 changer transitions 26/120 dead transitions. [2023-08-24 11:16:35,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 1229 flow [2023-08-24 11:16:35,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:16:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:16:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 838 transitions. [2023-08-24 11:16:35,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3638732088580113 [2023-08-24 11:16:35,669 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 838 transitions. [2023-08-24 11:16:35,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 838 transitions. [2023-08-24 11:16:35,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:35,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 838 transitions. [2023-08-24 11:16:35,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:35,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:35,672 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:35,672 INFO L175 Difference]: Start difference. First operand has 115 places, 75 transitions, 798 flow. Second operand 7 states and 838 transitions. [2023-08-24 11:16:35,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 120 transitions, 1229 flow [2023-08-24 11:16:35,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 120 transitions, 1145 flow, removed 8 selfloop flow, removed 11 redundant places. [2023-08-24 11:16:35,810 INFO L231 Difference]: Finished difference. Result has 111 places, 71 transitions, 687 flow [2023-08-24 11:16:35,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=687, PETRI_PLACES=111, PETRI_TRANSITIONS=71} [2023-08-24 11:16:35,811 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 71 predicate places. [2023-08-24 11:16:35,811 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 71 transitions, 687 flow [2023-08-24 11:16:35,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:35,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:35,811 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:35,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-24 11:16:35,811 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:35,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash -207543005, now seen corresponding path program 1 times [2023-08-24 11:16:35,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:35,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172173628] [2023-08-24 11:16:35,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:35,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-24 11:16:35,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:35,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172173628] [2023-08-24 11:16:35,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172173628] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:35,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:35,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 11:16:35,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404843667] [2023-08-24 11:16:35,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:35,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:16:35,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:35,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:16:35,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:16:35,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 329 [2023-08-24 11:16:35,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 71 transitions, 687 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:35,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:35,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 329 [2023-08-24 11:16:35,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:36,517 INFO L124 PetriNetUnfolderBase]: 3658/5782 cut-off events. [2023-08-24 11:16:36,517 INFO L125 PetriNetUnfolderBase]: For 16052/16052 co-relation queries the response was YES. [2023-08-24 11:16:36,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20778 conditions, 5782 events. 3658/5782 cut-off events. For 16052/16052 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 35539 event pairs, 1848 based on Foata normal form. 12/5759 useless extension candidates. Maximal degree in co-relation 20745. Up to 3201 conditions per place. [2023-08-24 11:16:36,542 INFO L140 encePairwiseOnDemand]: 319/329 looper letters, 69 selfloop transitions, 12 changer transitions 28/114 dead transitions. [2023-08-24 11:16:36,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 114 transitions, 1099 flow [2023-08-24 11:16:36,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:16:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:16:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 835 transitions. [2023-08-24 11:16:36,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36257056013894917 [2023-08-24 11:16:36,544 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 835 transitions. [2023-08-24 11:16:36,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 835 transitions. [2023-08-24 11:16:36,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:36,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 835 transitions. [2023-08-24 11:16:36,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:36,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:36,547 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:36,547 INFO L175 Difference]: Start difference. First operand has 111 places, 71 transitions, 687 flow. Second operand 7 states and 835 transitions. [2023-08-24 11:16:36,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 114 transitions, 1099 flow [2023-08-24 11:16:36,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 114 transitions, 1045 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-08-24 11:16:36,643 INFO L231 Difference]: Finished difference. Result has 108 places, 63 transitions, 567 flow [2023-08-24 11:16:36,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=108, PETRI_TRANSITIONS=63} [2023-08-24 11:16:36,643 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 68 predicate places. [2023-08-24 11:16:36,644 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 63 transitions, 567 flow [2023-08-24 11:16:36,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:36,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:36,644 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:36,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-24 11:16:36,644 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:36,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:36,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1486769261, now seen corresponding path program 1 times [2023-08-24 11:16:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:36,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123287417] [2023-08-24 11:16:36,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:36,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-24 11:16:36,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:36,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123287417] [2023-08-24 11:16:36,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123287417] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:36,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:36,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 11:16:36,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079671015] [2023-08-24 11:16:36,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:36,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:16:36,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:36,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:16:36,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:16:36,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 329 [2023-08-24 11:16:36,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 63 transitions, 567 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:36,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:36,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 329 [2023-08-24 11:16:36,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:37,157 INFO L124 PetriNetUnfolderBase]: 2457/3917 cut-off events. [2023-08-24 11:16:37,157 INFO L125 PetriNetUnfolderBase]: For 10249/10249 co-relation queries the response was YES. [2023-08-24 11:16:37,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13818 conditions, 3917 events. 2457/3917 cut-off events. For 10249/10249 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 22182 event pairs, 1233 based on Foata normal form. 12/3898 useless extension candidates. Maximal degree in co-relation 13786. Up to 2172 conditions per place. [2023-08-24 11:16:37,174 INFO L140 encePairwiseOnDemand]: 321/329 looper letters, 62 selfloop transitions, 10 changer transitions 25/102 dead transitions. [2023-08-24 11:16:37,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 918 flow [2023-08-24 11:16:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:16:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:16:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2023-08-24 11:16:37,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359965262700825 [2023-08-24 11:16:37,176 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 829 transitions. [2023-08-24 11:16:37,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 829 transitions. [2023-08-24 11:16:37,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:37,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 829 transitions. [2023-08-24 11:16:37,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:37,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:37,178 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:37,179 INFO L175 Difference]: Start difference. First operand has 108 places, 63 transitions, 567 flow. Second operand 7 states and 829 transitions. [2023-08-24 11:16:37,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 102 transitions, 918 flow [2023-08-24 11:16:37,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 102 transitions, 873 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-08-24 11:16:37,215 INFO L231 Difference]: Finished difference. Result has 103 places, 58 transitions, 470 flow [2023-08-24 11:16:37,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=470, PETRI_PLACES=103, PETRI_TRANSITIONS=58} [2023-08-24 11:16:37,215 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 63 predicate places. [2023-08-24 11:16:37,215 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 58 transitions, 470 flow [2023-08-24 11:16:37,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:37,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:37,216 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:37,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-08-24 11:16:37,216 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:37,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:37,216 INFO L85 PathProgramCache]: Analyzing trace with hash -687091357, now seen corresponding path program 1 times [2023-08-24 11:16:37,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:37,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948302739] [2023-08-24 11:16:37,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:37,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-24 11:16:37,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:37,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948302739] [2023-08-24 11:16:37,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948302739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:37,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:37,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 11:16:37,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965576760] [2023-08-24 11:16:37,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:37,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:16:37,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:16:37,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:16:37,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 329 [2023-08-24 11:16:37,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 58 transitions, 470 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:37,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:37,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 329 [2023-08-24 11:16:37,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:37,686 INFO L124 PetriNetUnfolderBase]: 2301/3601 cut-off events. [2023-08-24 11:16:37,687 INFO L125 PetriNetUnfolderBase]: For 8645/8645 co-relation queries the response was YES. [2023-08-24 11:16:37,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12501 conditions, 3601 events. 2301/3601 cut-off events. For 8645/8645 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 19364 event pairs, 1114 based on Foata normal form. 12/3582 useless extension candidates. Maximal degree in co-relation 12472. Up to 2007 conditions per place. [2023-08-24 11:16:37,704 INFO L140 encePairwiseOnDemand]: 320/329 looper letters, 48 selfloop transitions, 7 changer transitions 36/95 dead transitions. [2023-08-24 11:16:37,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 95 transitions, 808 flow [2023-08-24 11:16:37,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:16:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:16:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 825 transitions. [2023-08-24 11:16:37,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35822839774207554 [2023-08-24 11:16:37,719 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 825 transitions. [2023-08-24 11:16:37,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 825 transitions. [2023-08-24 11:16:37,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:37,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 825 transitions. [2023-08-24 11:16:37,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:37,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:37,736 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:37,737 INFO L175 Difference]: Start difference. First operand has 103 places, 58 transitions, 470 flow. Second operand 7 states and 825 transitions. [2023-08-24 11:16:37,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 95 transitions, 808 flow [2023-08-24 11:16:37,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 95 transitions, 746 flow, removed 9 selfloop flow, removed 8 redundant places. [2023-08-24 11:16:37,774 INFO L231 Difference]: Finished difference. Result has 96 places, 48 transitions, 334 flow [2023-08-24 11:16:37,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=334, PETRI_PLACES=96, PETRI_TRANSITIONS=48} [2023-08-24 11:16:37,774 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 56 predicate places. [2023-08-24 11:16:37,774 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 48 transitions, 334 flow [2023-08-24 11:16:37,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:37,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:37,775 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:37,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-08-24 11:16:37,775 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:37,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:37,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1657476839, now seen corresponding path program 1 times [2023-08-24 11:16:37,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:37,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56527271] [2023-08-24 11:16:37,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:37,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-24 11:16:37,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:37,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56527271] [2023-08-24 11:16:37,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56527271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:37,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:37,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 11:16:37,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908173839] [2023-08-24 11:16:37,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:37,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:16:37,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:37,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:16:37,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:16:37,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 329 [2023-08-24 11:16:37,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 48 transitions, 334 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:37,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:37,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 329 [2023-08-24 11:16:37,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:38,098 INFO L124 PetriNetUnfolderBase]: 1133/1767 cut-off events. [2023-08-24 11:16:38,098 INFO L125 PetriNetUnfolderBase]: For 2966/2966 co-relation queries the response was YES. [2023-08-24 11:16:38,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5686 conditions, 1767 events. 1133/1767 cut-off events. For 2966/2966 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7978 event pairs, 652 based on Foata normal form. 18/1754 useless extension candidates. Maximal degree in co-relation 5659. Up to 1233 conditions per place. [2023-08-24 11:16:38,107 INFO L140 encePairwiseOnDemand]: 322/329 looper letters, 42 selfloop transitions, 3 changer transitions 26/75 dead transitions. [2023-08-24 11:16:38,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 75 transitions, 578 flow [2023-08-24 11:16:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:16:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:16:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 810 transitions. [2023-08-24 11:16:38,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3517151541467651 [2023-08-24 11:16:38,109 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 810 transitions. [2023-08-24 11:16:38,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 810 transitions. [2023-08-24 11:16:38,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:38,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 810 transitions. [2023-08-24 11:16:38,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:38,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:38,113 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:38,113 INFO L175 Difference]: Start difference. First operand has 96 places, 48 transitions, 334 flow. Second operand 7 states and 810 transitions. [2023-08-24 11:16:38,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 75 transitions, 578 flow [2023-08-24 11:16:38,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 493 flow, removed 9 selfloop flow, removed 16 redundant places. [2023-08-24 11:16:38,122 INFO L231 Difference]: Finished difference. Result has 77 places, 40 transitions, 194 flow [2023-08-24 11:16:38,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=194, PETRI_PLACES=77, PETRI_TRANSITIONS=40} [2023-08-24 11:16:38,123 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2023-08-24 11:16:38,123 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 40 transitions, 194 flow [2023-08-24 11:16:38,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:38,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:38,124 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:38,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-08-24 11:16:38,124 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 11:16:38,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:38,124 INFO L85 PathProgramCache]: Analyzing trace with hash -931249861, now seen corresponding path program 1 times [2023-08-24 11:16:38,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:38,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937620901] [2023-08-24 11:16:38,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:38,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-24 11:16:38,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:38,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937620901] [2023-08-24 11:16:38,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937620901] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:38,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:38,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 11:16:38,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725831122] [2023-08-24 11:16:38,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:38,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:16:38,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:38,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:16:38,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:16:38,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 329 [2023-08-24 11:16:38,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 40 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:38,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:38,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 329 [2023-08-24 11:16:38,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:38,392 INFO L124 PetriNetUnfolderBase]: 1034/1566 cut-off events. [2023-08-24 11:16:38,392 INFO L125 PetriNetUnfolderBase]: For 1710/1710 co-relation queries the response was YES. [2023-08-24 11:16:38,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4696 conditions, 1566 events. 1034/1566 cut-off events. For 1710/1710 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6798 event pairs, 571 based on Foata normal form. 18/1553 useless extension candidates. Maximal degree in co-relation 4679. Up to 1064 conditions per place. [2023-08-24 11:16:38,396 INFO L140 encePairwiseOnDemand]: 322/329 looper letters, 0 selfloop transitions, 0 changer transitions 62/62 dead transitions. [2023-08-24 11:16:38,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 62 transitions, 399 flow [2023-08-24 11:16:38,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:16:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:16:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 801 transitions. [2023-08-24 11:16:38,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3478072079895788 [2023-08-24 11:16:38,398 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 801 transitions. [2023-08-24 11:16:38,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 801 transitions. [2023-08-24 11:16:38,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:38,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 801 transitions. [2023-08-24 11:16:38,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:38,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:38,401 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 329.0) internal successors, (2632), 8 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:38,401 INFO L175 Difference]: Start difference. First operand has 77 places, 40 transitions, 194 flow. Second operand 7 states and 801 transitions. [2023-08-24 11:16:38,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 62 transitions, 399 flow [2023-08-24 11:16:38,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 371 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-08-24 11:16:38,404 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2023-08-24 11:16:38,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2023-08-24 11:16:38,405 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-08-24 11:16:38,405 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2023-08-24 11:16:38,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:38,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 11:16:38,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-24 11:16:38,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-24 11:16:38,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-24 11:16:38,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-08-24 11:16:38,406 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:38,406 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-24 11:16:38,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 168 transitions, 357 flow [2023-08-24 11:16:38,419 INFO L124 PetriNetUnfolderBase]: 25/202 cut-off events. [2023-08-24 11:16:38,419 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-24 11:16:38,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 202 events. 25/202 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 484 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 149. Up to 8 conditions per place. [2023-08-24 11:16:38,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 168 transitions, 357 flow [2023-08-24 11:16:38,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 168 transitions, 357 flow [2023-08-24 11:16:38,421 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:16:38,421 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 168 transitions, 357 flow [2023-08-24 11:16:38,421 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 168 transitions, 357 flow [2023-08-24 11:16:38,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 168 transitions, 357 flow [2023-08-24 11:16:38,433 INFO L124 PetriNetUnfolderBase]: 25/202 cut-off events. [2023-08-24 11:16:38,433 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-24 11:16:38,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 202 events. 25/202 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 484 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 149. Up to 8 conditions per place. [2023-08-24 11:16:38,440 INFO L119 LiptonReduction]: Number of co-enabled transitions 15312 [2023-08-24 11:16:41,005 INFO L134 LiptonReduction]: Checked pairs total: 23205 [2023-08-24 11:16:41,005 INFO L136 LiptonReduction]: Total number of compositions: 158 [2023-08-24 11:16:41,006 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-24 11:16:41,007 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;@269f79d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:16:41,007 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-24 11:16:41,010 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:16:41,010 INFO L124 PetriNetUnfolderBase]: 12/54 cut-off events. [2023-08-24 11:16:41,010 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-24 11:16:41,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:41,010 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-08-24 11:16:41,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 11:16:41,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:41,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1065229616, now seen corresponding path program 1 times [2023-08-24 11:16:41,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:41,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59800831] [2023-08-24 11:16:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:41,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:16:41,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:16:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:16:41,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:16:41,039 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:16:41,039 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-24 11:16:41,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-08-24 11:16:41,039 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-24 11:16:41,041 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-24 11:16:41,041 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 11:16:41,041 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-08-24 11:16:41,064 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:16:41,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 213 transitions, 458 flow [2023-08-24 11:16:41,083 INFO L124 PetriNetUnfolderBase]: 33/259 cut-off events. [2023-08-24 11:16:41,083 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-24 11:16:41,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 259 events. 33/259 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 716 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 210. Up to 10 conditions per place. [2023-08-24 11:16:41,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 213 transitions, 458 flow [2023-08-24 11:16:41,086 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 213 transitions, 458 flow [2023-08-24 11:16:41,086 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:16:41,086 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 213 transitions, 458 flow [2023-08-24 11:16:41,087 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 213 transitions, 458 flow [2023-08-24 11:16:41,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 213 transitions, 458 flow [2023-08-24 11:16:41,104 INFO L124 PetriNetUnfolderBase]: 33/259 cut-off events. [2023-08-24 11:16:41,104 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-24 11:16:41,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 259 events. 33/259 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 716 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 210. Up to 10 conditions per place. [2023-08-24 11:16:41,112 INFO L119 LiptonReduction]: Number of co-enabled transitions 28336 [2023-08-24 11:16:43,890 INFO L134 LiptonReduction]: Checked pairs total: 42708 [2023-08-24 11:16:43,890 INFO L136 LiptonReduction]: Total number of compositions: 199 [2023-08-24 11:16:43,894 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:16:43,894 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;@269f79d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:16:43,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 11:16:43,895 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:16:43,895 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2023-08-24 11:16:43,895 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:16:43,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:43,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 11:16:43,895 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:16:43,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:43,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1374319252, now seen corresponding path program 1 times [2023-08-24 11:16:43,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:43,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92715043] [2023-08-24 11:16:43,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:43,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:16:43,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:43,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92715043] [2023-08-24 11:16:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92715043] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:43,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:16:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210519375] [2023-08-24 11:16:43,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:43,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-24 11:16:43,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:43,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-24 11:16:43,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-24 11:16:43,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 412 [2023-08-24 11:16:43,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 58 transitions, 148 flow. Second operand has 2 states, 2 states have (on average 185.5) internal successors, (371), 2 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:43,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:43,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 412 [2023-08-24 11:16:43,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:44,321 INFO L124 PetriNetUnfolderBase]: 5548/8708 cut-off events. [2023-08-24 11:16:44,321 INFO L125 PetriNetUnfolderBase]: For 1921/1921 co-relation queries the response was YES. [2023-08-24 11:16:44,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16654 conditions, 8708 events. 5548/8708 cut-off events. For 1921/1921 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 54973 event pairs, 4064 based on Foata normal form. 1141/8209 useless extension candidates. Maximal degree in co-relation 2704. Up to 6799 conditions per place. [2023-08-24 11:16:44,359 INFO L140 encePairwiseOnDemand]: 403/412 looper letters, 26 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-24 11:16:44,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 182 flow [2023-08-24 11:16:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-24 11:16:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-24 11:16:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 401 transitions. [2023-08-24 11:16:44,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4866504854368932 [2023-08-24 11:16:44,360 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 401 transitions. [2023-08-24 11:16:44,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 401 transitions. [2023-08-24 11:16:44,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:44,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 401 transitions. [2023-08-24 11:16:44,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 200.5) internal successors, (401), 2 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:44,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:44,361 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:44,361 INFO L175 Difference]: Start difference. First operand has 51 places, 58 transitions, 148 flow. Second operand 2 states and 401 transitions. [2023-08-24 11:16:44,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 182 flow [2023-08-24 11:16:44,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 170 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-24 11:16:44,363 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 118 flow [2023-08-24 11:16:44,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2023-08-24 11:16:44,363 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-08-24 11:16:44,363 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 118 flow [2023-08-24 11:16:44,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 185.5) internal successors, (371), 2 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:44,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:44,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:44,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-08-24 11:16:44,363 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:16:44,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1480801169, now seen corresponding path program 1 times [2023-08-24 11:16:44,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:44,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772464204] [2023-08-24 11:16:44,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:44,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:16:44,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772464204] [2023-08-24 11:16:44,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772464204] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:44,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:44,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646963556] [2023-08-24 11:16:44,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:44,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:44,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:44,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:44,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:44,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 412 [2023-08-24 11:16:44,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:44,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:44,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 412 [2023-08-24 11:16:44,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:44,844 INFO L124 PetriNetUnfolderBase]: 6635/10007 cut-off events. [2023-08-24 11:16:44,845 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2023-08-24 11:16:44,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18831 conditions, 10007 events. 6635/10007 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 61881 event pairs, 3346 based on Foata normal form. 0/8153 useless extension candidates. Maximal degree in co-relation 18824. Up to 6799 conditions per place. [2023-08-24 11:16:44,889 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 44 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-08-24 11:16:44,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 69 transitions, 265 flow [2023-08-24 11:16:44,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:44,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2023-08-24 11:16:44,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603559870550162 [2023-08-24 11:16:44,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 569 transitions. [2023-08-24 11:16:44,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 569 transitions. [2023-08-24 11:16:44,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:44,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 569 transitions. [2023-08-24 11:16:44,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:44,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:44,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:44,892 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 118 flow. Second operand 3 states and 569 transitions. [2023-08-24 11:16:44,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 69 transitions, 265 flow [2023-08-24 11:16:44,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:16:44,893 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 130 flow [2023-08-24 11:16:44,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2023-08-24 11:16:44,893 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-24 11:16:44,893 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 130 flow [2023-08-24 11:16:44,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:44,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:44,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:44,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-08-24 11:16:44,894 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:16:44,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1836093859, now seen corresponding path program 1 times [2023-08-24 11:16:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166036925] [2023-08-24 11:16:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 11:16:44,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:44,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166036925] [2023-08-24 11:16:44,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166036925] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:44,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:44,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:44,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815667897] [2023-08-24 11:16:44,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:44,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:44,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:44,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:44,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:44,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 412 [2023-08-24 11:16:44,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:44,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:44,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 412 [2023-08-24 11:16:44,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:47,560 INFO L124 PetriNetUnfolderBase]: 50051/66335 cut-off events. [2023-08-24 11:16:47,560 INFO L125 PetriNetUnfolderBase]: For 8154/8154 co-relation queries the response was YES. [2023-08-24 11:16:47,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138257 conditions, 66335 events. 50051/66335 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 2595. Compared 402158 event pairs, 26045 based on Foata normal form. 0/48456 useless extension candidates. Maximal degree in co-relation 138248. Up to 45728 conditions per place. [2023-08-24 11:16:47,920 INFO L140 encePairwiseOnDemand]: 405/412 looper letters, 70 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2023-08-24 11:16:47,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 83 transitions, 363 flow [2023-08-24 11:16:47,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:47,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2023-08-24 11:16:47,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377022653721683 [2023-08-24 11:16:47,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2023-08-24 11:16:47,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2023-08-24 11:16:47,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:47,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2023-08-24 11:16:47,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:47,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:47,923 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:47,923 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 130 flow. Second operand 3 states and 541 transitions. [2023-08-24 11:16:47,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 83 transitions, 363 flow [2023-08-24 11:16:47,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 359 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 11:16:47,927 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 168 flow [2023-08-24 11:16:47,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2023-08-24 11:16:47,927 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-08-24 11:16:47,927 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 168 flow [2023-08-24 11:16:47,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:47,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:47,928 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:47,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-08-24 11:16:47,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:16:47,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:47,928 INFO L85 PathProgramCache]: Analyzing trace with hash 624867628, now seen corresponding path program 1 times [2023-08-24 11:16:47,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:47,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245342151] [2023-08-24 11:16:47,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:47,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:16:47,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:47,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245342151] [2023-08-24 11:16:47,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245342151] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:47,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:47,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:47,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094490113] [2023-08-24 11:16:47,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:47,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:47,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:47,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:47,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:47,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 412 [2023-08-24 11:16:47,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:47,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:47,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 412 [2023-08-24 11:16:47,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:48,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 39#L705-6true, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,676 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-24 11:16:48,676 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:16:48,676 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:16:48,676 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-24 11:16:48,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 39#L705-6true, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,723 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-24 11:16:48,723 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:16:48,723 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:16:48,723 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:16:48,724 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, 146#L712true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,724 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-24 11:16:48,724 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:16:48,724 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:16:48,724 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:16:48,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 8#L718true, 157#L718true, 210#true, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:48,730 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-24 11:16:48,730 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:16:48,730 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:16:48,730 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-24 11:16:48,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 146#L712true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,760 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,760 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,760 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:16:48,760 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:16:48,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:48,761 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,761 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:16:48,761 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,761 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:16:48,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:48,765 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,765 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:16:48,765 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:16:48,765 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,765 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,765 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:16:48,765 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,765 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-24 11:16:48,774 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, 151#L718true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 39#L705-6true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,774 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,774 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,774 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,774 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,787 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,787 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,787 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,787 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:48,792 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,792 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,792 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,792 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:48,793 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,793 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,793 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,793 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, 133#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:48,795 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,795 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,795 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,795 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:48,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 39#L705-6true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,802 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,803 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,803 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,803 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, 109#L729-4true, 146#L712true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,803 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,803 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,803 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,803 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 151#L718true, 109#L729-4true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,809 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,809 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,809 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,809 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 8#L718true, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,811 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,811 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,811 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,811 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,811 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,811 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,812 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,812 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, 133#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:48,814 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,814 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,814 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,814 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:48,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, 146#L712true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,823 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,823 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,823 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,823 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:48,824 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,824 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,824 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,824 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 8#L718true, 157#L718true, 210#true, 166#thr1EXITtrue, 109#L729-4true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,828 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,828 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,828 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,828 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 151#L718true, 109#L729-4true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,828 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,828 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,828 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,828 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 135#L729-5true, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,829 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,830 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,830 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,830 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:48,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 8#L718true, 157#L718true, 210#true, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,832 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-24 11:16:48,832 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,832 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:48,832 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:48,836 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-24 11:16:48,836 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,836 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:48,836 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:48,836 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-24 11:16:48,836 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,836 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:48,836 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, 133#thr1EXITtrue, 109#L729-4true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,839 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-24 11:16:48,839 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,839 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:48,839 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:48,840 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 8#L718true, 157#L718true, 210#true, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,840 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-24 11:16:48,840 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-24 11:16:48,840 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:48,841 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:48,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,841 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-24 11:16:48,841 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-24 11:16:48,841 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:48,841 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:48,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 166#thr1EXITtrue, 133#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 179#L718true, thr1Thread1of4ForFork0InUse, 196#true, 204#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:48,843 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-24 11:16:48,843 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:48,843 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:48,843 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-24 11:16:48,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][31], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 210#true, 133#thr1EXITtrue, 166#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, thr1Thread1of4ForFork0InUse, 196#true, thr1Thread2of4ForFork0InUse, 204#true]) [2023-08-24 11:16:48,845 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-24 11:16:48,845 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-24 11:16:48,845 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 11:16:48,845 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-24 11:16:48,847 INFO L124 PetriNetUnfolderBase]: 12187/18671 cut-off events. [2023-08-24 11:16:48,847 INFO L125 PetriNetUnfolderBase]: For 3987/4454 co-relation queries the response was YES. [2023-08-24 11:16:48,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38323 conditions, 18671 events. 12187/18671 cut-off events. For 3987/4454 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 129636 event pairs, 7107 based on Foata normal form. 0/15238 useless extension candidates. Maximal degree in co-relation 38313. Up to 12735 conditions per place. [2023-08-24 11:16:48,945 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 47 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-08-24 11:16:48,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 330 flow [2023-08-24 11:16:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2023-08-24 11:16:48,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.459546925566343 [2023-08-24 11:16:48,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2023-08-24 11:16:48,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2023-08-24 11:16:48,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:48,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2023-08-24 11:16:48,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:48,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:48,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:48,948 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 168 flow. Second operand 3 states and 568 transitions. [2023-08-24 11:16:48,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 330 flow [2023-08-24 11:16:48,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:48,952 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 168 flow [2023-08-24 11:16:48,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2023-08-24 11:16:48,953 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-24 11:16:48,953 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 168 flow [2023-08-24 11:16:48,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:48,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:48,953 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:48,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-08-24 11:16:48,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:16:48,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:48,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1200327327, now seen corresponding path program 1 times [2023-08-24 11:16:48,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:48,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698140577] [2023-08-24 11:16:48,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:48,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 11:16:48,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:48,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698140577] [2023-08-24 11:16:48,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698140577] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:48,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:48,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:48,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897449910] [2023-08-24 11:16:48,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:48,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:48,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:48,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:48,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 412 [2023-08-24 11:16:48,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:48,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:48,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 412 [2023-08-24 11:16:48,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:54,285 INFO L124 PetriNetUnfolderBase]: 67143/91062 cut-off events. [2023-08-24 11:16:54,285 INFO L125 PetriNetUnfolderBase]: For 23681/23681 co-relation queries the response was YES. [2023-08-24 11:16:54,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206073 conditions, 91062 events. 67143/91062 cut-off events. For 23681/23681 co-relation queries the response was YES. Maximal size of possible extension queue 3655. Compared 606689 event pairs, 34289 based on Foata normal form. 0/70457 useless extension candidates. Maximal degree in co-relation 206062. Up to 60226 conditions per place. [2023-08-24 11:16:54,713 INFO L140 encePairwiseOnDemand]: 405/412 looper letters, 75 selfloop transitions, 9 changer transitions 0/91 dead transitions. [2023-08-24 11:16:54,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 91 transitions, 442 flow [2023-08-24 11:16:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2023-08-24 11:16:54,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4368932038834951 [2023-08-24 11:16:54,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 540 transitions. [2023-08-24 11:16:54,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 540 transitions. [2023-08-24 11:16:54,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:54,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 540 transitions. [2023-08-24 11:16:54,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:54,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:54,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:54,716 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 168 flow. Second operand 3 states and 540 transitions. [2023-08-24 11:16:54,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 91 transitions, 442 flow [2023-08-24 11:16:54,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 91 transitions, 438 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 11:16:54,729 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 236 flow [2023-08-24 11:16:54,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2023-08-24 11:16:54,729 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-08-24 11:16:54,729 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 236 flow [2023-08-24 11:16:54,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:54,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:54,729 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:54,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-08-24 11:16:54,730 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:16:54,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:54,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1313240605, now seen corresponding path program 1 times [2023-08-24 11:16:54,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:54,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091433675] [2023-08-24 11:16:54,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:54,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:16:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:54,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091433675] [2023-08-24 11:16:54,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091433675] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:54,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:54,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:54,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146116909] [2023-08-24 11:16:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:54,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:54,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:54,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:54,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:54,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 412 [2023-08-24 11:16:54,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:54,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:54,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 412 [2023-08-24 11:16:54,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:16:56,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 29#L714-1true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, 215#true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, 135#L729-5true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:56,469 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-24 11:16:56,469 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:56,469 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:56,469 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:56,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 29#L714-1true, 133#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, 215#true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, 135#L729-5true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:56,470 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-24 11:16:56,470 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:56,470 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:56,470 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:56,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, 30#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 133#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, 215#true, 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, 135#L729-5true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:56,476 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-24 11:16:56,476 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:56,476 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:16:56,476 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:56,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, 30#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 8#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, 215#true, 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, 135#L729-5true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:56,476 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-24 11:16:56,476 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:56,476 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-24 11:16:56,476 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-24 11:16:56,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 29#L714-1true, 133#thr1EXITtrue, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 109#L729-4true, 215#true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:56,594 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-24 11:16:56,594 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-24 11:16:56,594 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:56,594 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:56,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, 8#L718true, thr1Thread4of4ForFork0InUse, 29#L714-1true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 151#L718true, 109#L729-4true, 215#true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:56,594 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-24 11:16:56,594 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:56,595 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:56,595 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:56,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, 30#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 133#thr1EXITtrue, 151#L718true, 109#L729-4true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 215#true, 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:56,600 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-24 11:16:56,600 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:56,601 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-24 11:16:56,601 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:56,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1472] L714-1-->L718: Formula: (and (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (= v_~m~0_27 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_26 0)) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][48], [thr1Thread3of4ForFork0InUse, 30#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 8#L718true, 109#L729-4true, 151#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), 215#true, 118#L714-1true, Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), 221#true, thr1Thread1of4ForFork0InUse, Black: 217#(< |thr1Thread2of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 196#true, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:16:56,601 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-24 11:16:56,601 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:56,601 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:16:56,601 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:16:56,774 INFO L124 PetriNetUnfolderBase]: 20002/30478 cut-off events. [2023-08-24 11:16:56,774 INFO L125 PetriNetUnfolderBase]: For 10630/12773 co-relation queries the response was YES. [2023-08-24 11:16:56,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67665 conditions, 30478 events. 20002/30478 cut-off events. For 10630/12773 co-relation queries the response was YES. Maximal size of possible extension queue 1493. Compared 227808 event pairs, 11800 based on Foata normal form. 51/25180 useless extension candidates. Maximal degree in co-relation 67653. Up to 21369 conditions per place. [2023-08-24 11:16:56,937 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 50 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-24 11:16:56,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 411 flow [2023-08-24 11:16:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:16:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:16:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2023-08-24 11:16:56,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4587378640776699 [2023-08-24 11:16:56,938 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2023-08-24 11:16:56,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2023-08-24 11:16:56,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:16:56,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2023-08-24 11:16:56,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:56,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:56,940 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:56,940 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 236 flow. Second operand 3 states and 567 transitions. [2023-08-24 11:16:56,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 411 flow [2023-08-24 11:16:56,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 391 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:16:56,948 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 230 flow [2023-08-24 11:16:56,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2023-08-24 11:16:56,951 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-24 11:16:56,951 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 230 flow [2023-08-24 11:16:56,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:56,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:16:56,952 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:16:56,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-08-24 11:16:56,952 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:16:56,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:16:56,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1025945555, now seen corresponding path program 1 times [2023-08-24 11:16:56,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:16:56,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367647053] [2023-08-24 11:16:56,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:16:56,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:16:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:16:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-24 11:16:56,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:16:56,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367647053] [2023-08-24 11:16:56,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367647053] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:16:56,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:16:56,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:16:56,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484094759] [2023-08-24 11:16:56,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:16:56,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:16:56,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:16:56,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:16:56,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:16:56,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 412 [2023-08-24 11:16:56,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:16:56,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:16:56,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 412 [2023-08-24 11:16:56,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:03,895 INFO L124 PetriNetUnfolderBase]: 87085/119079 cut-off events. [2023-08-24 11:17:03,895 INFO L125 PetriNetUnfolderBase]: For 52521/52521 co-relation queries the response was YES. [2023-08-24 11:17:04,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291047 conditions, 119079 events. 87085/119079 cut-off events. For 52521/52521 co-relation queries the response was YES. Maximal size of possible extension queue 4977. Compared 830885 event pairs, 43332 based on Foata normal form. 0/97207 useless extension candidates. Maximal degree in co-relation 291034. Up to 75826 conditions per place. [2023-08-24 11:17:04,510 INFO L140 encePairwiseOnDemand]: 405/412 looper letters, 81 selfloop transitions, 14 changer transitions 0/102 dead transitions. [2023-08-24 11:17:04,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 102 transitions, 565 flow [2023-08-24 11:17:04,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:17:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:17:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2023-08-24 11:17:04,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436084142394822 [2023-08-24 11:17:04,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 539 transitions. [2023-08-24 11:17:04,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 539 transitions. [2023-08-24 11:17:04,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:04,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 539 transitions. [2023-08-24 11:17:04,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:04,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:04,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:04,512 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 230 flow. Second operand 3 states and 539 transitions. [2023-08-24 11:17:04,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 102 transitions, 565 flow [2023-08-24 11:17:04,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 561 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 11:17:04,557 INFO L231 Difference]: Finished difference. Result has 65 places, 71 transitions, 352 flow [2023-08-24 11:17:04,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=65, PETRI_TRANSITIONS=71} [2023-08-24 11:17:04,558 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2023-08-24 11:17:04,558 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 71 transitions, 352 flow [2023-08-24 11:17:04,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:04,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:04,558 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:04,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-08-24 11:17:04,558 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:17:04,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:04,558 INFO L85 PathProgramCache]: Analyzing trace with hash -632120706, now seen corresponding path program 1 times [2023-08-24 11:17:04,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:04,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228786053] [2023-08-24 11:17:04,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:04,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:17:04,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:04,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228786053] [2023-08-24 11:17:04,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228786053] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:17:04,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480555670] [2023-08-24 11:17:04,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:04,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:17:04,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:17:04,598 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:17:04,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-24 11:17:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:04,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 11:17:04,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:17:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:17:04,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:17:04,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:17:04,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480555670] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:17:04,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:17:04,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-24 11:17:04,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737804819] [2023-08-24 11:17:04,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:17:04,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:17:04,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:04,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:17:04,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:17:04,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 412 [2023-08-24 11:17:04,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 71 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 176.6) internal successors, (883), 5 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:04,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:04,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 412 [2023-08-24 11:17:04,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:08,120 INFO L124 PetriNetUnfolderBase]: 30977/46901 cut-off events. [2023-08-24 11:17:08,121 INFO L125 PetriNetUnfolderBase]: For 27668/33621 co-relation queries the response was YES. [2023-08-24 11:17:08,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115280 conditions, 46901 events. 30977/46901 cut-off events. For 27668/33621 co-relation queries the response was YES. Maximal size of possible extension queue 2209. Compared 368566 event pairs, 13766 based on Foata normal form. 210/40112 useless extension candidates. Maximal degree in co-relation 115266. Up to 30913 conditions per place. [2023-08-24 11:17:08,459 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 76 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2023-08-24 11:17:08,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 118 transitions, 680 flow [2023-08-24 11:17:08,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:17:08,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:17:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 763 transitions. [2023-08-24 11:17:08,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46298543689320387 [2023-08-24 11:17:08,461 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 763 transitions. [2023-08-24 11:17:08,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 763 transitions. [2023-08-24 11:17:08,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:08,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 763 transitions. [2023-08-24 11:17:08,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:08,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 412.0) internal successors, (2060), 5 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:08,463 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 412.0) internal successors, (2060), 5 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:08,463 INFO L175 Difference]: Start difference. First operand has 65 places, 71 transitions, 352 flow. Second operand 4 states and 763 transitions. [2023-08-24 11:17:08,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 118 transitions, 680 flow [2023-08-24 11:17:08,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 118 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:17:08,522 INFO L231 Difference]: Finished difference. Result has 67 places, 72 transitions, 340 flow [2023-08-24 11:17:08,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=67, PETRI_TRANSITIONS=72} [2023-08-24 11:17:08,523 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-08-24 11:17:08,523 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 72 transitions, 340 flow [2023-08-24 11:17:08,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.6) internal successors, (883), 5 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:08,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:08,523 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:08,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-24 11:17:08,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-08-24 11:17:08,727 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:17:08,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:08,728 INFO L85 PathProgramCache]: Analyzing trace with hash 602199332, now seen corresponding path program 2 times [2023-08-24 11:17:08,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:08,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622208312] [2023-08-24 11:17:08,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:08,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:17:08,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:08,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622208312] [2023-08-24 11:17:08,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622208312] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:17:08,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675537305] [2023-08-24 11:17:08,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 11:17:08,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:17:08,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:17:08,773 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:17:08,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-24 11:17:08,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 11:17:08,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 11:17:08,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 11:17:08,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:17:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:17:08,884 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 11:17:08,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675537305] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:17:08,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 11:17:08,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-24 11:17:08,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716168234] [2023-08-24 11:17:08,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:17:08,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:17:08,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:08,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:17:08,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:17:08,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-08-24 11:17:08,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 72 transitions, 340 flow. Second operand has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:08,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:08,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-08-24 11:17:08,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:18,734 INFO L124 PetriNetUnfolderBase]: 113375/156451 cut-off events. [2023-08-24 11:17:18,734 INFO L125 PetriNetUnfolderBase]: For 104399/104399 co-relation queries the response was YES. [2023-08-24 11:17:19,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411032 conditions, 156451 events. 113375/156451 cut-off events. For 104399/104399 co-relation queries the response was YES. Maximal size of possible extension queue 6431. Compared 1157414 event pairs, 50552 based on Foata normal form. 0/130849 useless extension candidates. Maximal degree in co-relation 411017. Up to 84722 conditions per place. [2023-08-24 11:17:19,618 INFO L140 encePairwiseOnDemand]: 402/412 looper letters, 158 selfloop transitions, 32 changer transitions 0/197 dead transitions. [2023-08-24 11:17:19,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 197 transitions, 1188 flow [2023-08-24 11:17:19,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:17:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:17:19,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1043 transitions. [2023-08-24 11:17:19,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42192556634304207 [2023-08-24 11:17:19,779 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1043 transitions. [2023-08-24 11:17:19,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1043 transitions. [2023-08-24 11:17:19,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:19,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1043 transitions. [2023-08-24 11:17:19,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:19,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:19,781 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:19,781 INFO L175 Difference]: Start difference. First operand has 67 places, 72 transitions, 340 flow. Second operand 6 states and 1043 transitions. [2023-08-24 11:17:19,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 197 transitions, 1188 flow [2023-08-24 11:17:19,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 197 transitions, 1180 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 11:17:19,830 INFO L231 Difference]: Finished difference. Result has 74 places, 91 transitions, 594 flow [2023-08-24 11:17:19,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=594, PETRI_PLACES=74, PETRI_TRANSITIONS=91} [2023-08-24 11:17:19,830 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2023-08-24 11:17:19,830 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 91 transitions, 594 flow [2023-08-24 11:17:19,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:19,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:19,830 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:19,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-24 11:17:20,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2023-08-24 11:17:20,034 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:17:20,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash -628959772, now seen corresponding path program 3 times [2023-08-24 11:17:20,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:20,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601670519] [2023-08-24 11:17:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:20,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:17:20,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601670519] [2023-08-24 11:17:20,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601670519] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:17:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881049266] [2023-08-24 11:17:20,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 11:17:20,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:17:20,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:17:20,065 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:17:20,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-24 11:17:20,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-24 11:17:20,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 11:17:20,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 11:17:20,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:17:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 11:17:20,160 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 11:17:20,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881049266] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:17:20,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 11:17:20,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-24 11:17:20,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937388630] [2023-08-24 11:17:20,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:17:20,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:17:20,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:20,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:17:20,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:17:20,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-08-24 11:17:20,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 91 transitions, 594 flow. Second operand has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:20,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:20,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-08-24 11:17:20,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:33,477 INFO L124 PetriNetUnfolderBase]: 143479/202081 cut-off events. [2023-08-24 11:17:33,477 INFO L125 PetriNetUnfolderBase]: For 236524/236524 co-relation queries the response was YES. [2023-08-24 11:17:34,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562500 conditions, 202081 events. 143479/202081 cut-off events. For 236524/236524 co-relation queries the response was YES. Maximal size of possible extension queue 8899. Compared 1603197 event pairs, 80452 based on Foata normal form. 780/176724 useless extension candidates. Maximal degree in co-relation 562481. Up to 137654 conditions per place. [2023-08-24 11:17:34,954 INFO L140 encePairwiseOnDemand]: 402/412 looper letters, 187 selfloop transitions, 54 changer transitions 0/248 dead transitions. [2023-08-24 11:17:34,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 248 transitions, 1948 flow [2023-08-24 11:17:34,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:17:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:17:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1042 transitions. [2023-08-24 11:17:34,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4215210355987055 [2023-08-24 11:17:34,955 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1042 transitions. [2023-08-24 11:17:34,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1042 transitions. [2023-08-24 11:17:34,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:34,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1042 transitions. [2023-08-24 11:17:34,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.66666666666666) internal successors, (1042), 6 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:34,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:34,958 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:34,958 INFO L175 Difference]: Start difference. First operand has 74 places, 91 transitions, 594 flow. Second operand 6 states and 1042 transitions. [2023-08-24 11:17:34,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 248 transitions, 1948 flow [2023-08-24 11:17:38,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 248 transitions, 1948 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:17:38,872 INFO L231 Difference]: Finished difference. Result has 83 places, 141 transitions, 1370 flow [2023-08-24 11:17:38,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1370, PETRI_PLACES=83, PETRI_TRANSITIONS=141} [2023-08-24 11:17:38,873 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-08-24 11:17:38,873 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 141 transitions, 1370 flow [2023-08-24 11:17:38,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:38,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:38,873 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:38,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-24 11:17:39,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:17:39,077 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:17:39,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:39,077 INFO L85 PathProgramCache]: Analyzing trace with hash -156028, now seen corresponding path program 1 times [2023-08-24 11:17:39,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:39,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730269417] [2023-08-24 11:17:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:39,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:17:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730269417] [2023-08-24 11:17:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730269417] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:17:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938996001] [2023-08-24 11:17:39,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:39,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:17:39,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:17:39,111 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:17:39,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-24 11:17:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:39,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 11:17:39,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:17:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:17:39,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:17:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 11:17:39,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938996001] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:17:39,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:17:39,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-24 11:17:39,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436491171] [2023-08-24 11:17:39,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:17:39,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:17:39,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:39,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:17:39,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:17:39,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 412 [2023-08-24 11:17:39,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 141 transitions, 1370 flow. Second operand has 5 states, 5 states have (on average 176.6) internal successors, (883), 5 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:39,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:39,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 412 [2023-08-24 11:17:39,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:17:44,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][42], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), Black: 235#(<= |thr1Thread1of4ForFork0_findMax_~i~0#1| (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1)), Black: 215#true, 415#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 196#true, 120#L714-1true, Black: 223#(= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|), Black: 403#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 8#L718true, Black: 412#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 387#(<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 228#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 422#true, Black: 487#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 489#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 475#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 497#true, Black: 471#(< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 135#L729-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:17:44,229 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-24 11:17:44,229 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:17:44,229 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:17:44,229 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:17:44,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][42], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 133#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 489#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), Black: 235#(<= |thr1Thread1of4ForFork0_findMax_~i~0#1| (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1)), Black: 215#true, 196#true, 120#L714-1true, Black: 223#(= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|), Black: 403#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), Black: 412#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 387#(<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 415#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 228#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 487#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 475#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), Black: 471#(< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 497#true, 347#true, 135#L729-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:17:44,295 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-24 11:17:44,295 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:17:44,295 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:17:44,295 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:17:44,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][42], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, 489#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), Black: 235#(<= |thr1Thread1of4ForFork0_findMax_~i~0#1| (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1)), Black: 215#true, 196#true, 120#L714-1true, Black: 223#(= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|), Black: 403#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 8#L718true, Black: 412#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 387#(<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 415#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 228#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), Black: 487#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 475#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), Black: 471#(< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 497#true, 347#true, 135#L729-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:17:44,295 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-24 11:17:44,295 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:17:44,295 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:17:44,295 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-24 11:17:44,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][42], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 133#thr1EXITtrue, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), Black: 235#(<= |thr1Thread1of4ForFork0_findMax_~i~0#1| (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1)), 415#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 215#true, 196#true, 120#L714-1true, Black: 223#(= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|), Black: 403#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), Black: 412#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 387#(<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 228#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 422#true, Black: 487#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 489#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 475#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), Black: 471#(< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 497#true, 135#L729-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:17:44,619 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-24 11:17:44,619 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:17:44,619 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 11:17:44,619 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 11:17:45,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1604] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= v_~m~0_26 0) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_27 1) 1 0))) InVars {~m~0=v_~m~0_27} OutVars{~m~0=v_~m~0_26, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][42], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 157#L718true, 133#thr1EXITtrue, 109#L729-4true, Black: 201#(= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|), Black: 206#(< |thr1Thread1of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 147#thr1EXITtrue, Black: 212#(= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|), Black: 235#(<= |thr1Thread1of4ForFork0_findMax_~i~0#1| (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1)), Black: 215#true, 415#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), 196#true, 120#L714-1true, Black: 223#(= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|), Black: 403#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), Black: 412#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0)), Black: 387#(<= |thr1Thread1of4ForFork0_findMax_~my_max~0#1| ~max~0), Black: 228#(< |thr1Thread3of4ForFork0_findMax_~my_max~0#1| (+ ~max~0 1)), 422#true, Black: 487#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 489#(and (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|) (<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) ~max~0)), Black: 475#(<= (+ |thr1Thread1of4ForFork0_findMax_~my_max~0#1| 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), 497#true, Black: 471#(< ~max~0 |thr1Thread2of4ForFork0_findMax_~my_max~0#1|), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-08-24 11:17:45,580 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-24 11:17:45,580 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-24 11:17:45,580 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 11:17:45,580 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-24 11:17:46,101 INFO L124 PetriNetUnfolderBase]: 54953/87625 cut-off events. [2023-08-24 11:17:46,101 INFO L125 PetriNetUnfolderBase]: For 162523/192271 co-relation queries the response was YES. [2023-08-24 11:17:46,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242663 conditions, 87625 events. 54953/87625 cut-off events. For 162523/192271 co-relation queries the response was YES. Maximal size of possible extension queue 4544. Compared 809273 event pairs, 32870 based on Foata normal form. 1767/77177 useless extension candidates. Maximal degree in co-relation 242639. Up to 60836 conditions per place. [2023-08-24 11:17:46,727 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 86 selfloop transitions, 3 changer transitions 0/188 dead transitions. [2023-08-24 11:17:46,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 188 transitions, 1730 flow [2023-08-24 11:17:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:17:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:17:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 761 transitions. [2023-08-24 11:17:46,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46177184466019416 [2023-08-24 11:17:46,729 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 761 transitions. [2023-08-24 11:17:46,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 761 transitions. [2023-08-24 11:17:46,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:17:46,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 761 transitions. [2023-08-24 11:17:46,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 190.25) internal successors, (761), 4 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:46,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 412.0) internal successors, (2060), 5 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:46,730 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 412.0) internal successors, (2060), 5 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:46,730 INFO L175 Difference]: Start difference. First operand has 83 places, 141 transitions, 1370 flow. Second operand 4 states and 761 transitions. [2023-08-24 11:17:46,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 188 transitions, 1730 flow [2023-08-24 11:17:47,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 188 transitions, 1692 flow, removed 19 selfloop flow, removed 0 redundant places. [2023-08-24 11:17:47,691 INFO L231 Difference]: Finished difference. Result has 87 places, 142 transitions, 1348 flow [2023-08-24 11:17:47,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1348, PETRI_PLACES=87, PETRI_TRANSITIONS=142} [2023-08-24 11:17:47,706 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2023-08-24 11:17:47,706 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 142 transitions, 1348 flow [2023-08-24 11:17:47,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.6) internal successors, (883), 5 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:47,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:17:47,706 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:17:47,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-24 11:17:47,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2023-08-24 11:17:47,909 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:17:47,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:17:47,909 INFO L85 PathProgramCache]: Analyzing trace with hash -753939769, now seen corresponding path program 1 times [2023-08-24 11:17:47,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:17:47,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662372596] [2023-08-24 11:17:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:17:47,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:17:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:17:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-24 11:17:47,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:17:47,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662372596] [2023-08-24 11:17:47,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662372596] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:17:47,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:17:47,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:17:47,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388204630] [2023-08-24 11:17:47,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:17:47,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:17:47,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:17:47,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:17:47,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:17:47,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 412 [2023-08-24 11:17:47,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 142 transitions, 1348 flow. Second operand has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:17:47,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:17:47,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 412 [2023-08-24 11:17:47,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:18:11,538 INFO L124 PetriNetUnfolderBase]: 213630/292988 cut-off events. [2023-08-24 11:18:11,538 INFO L125 PetriNetUnfolderBase]: For 612145/612145 co-relation queries the response was YES. [2023-08-24 11:18:12,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908410 conditions, 292988 events. 213630/292988 cut-off events. For 612145/612145 co-relation queries the response was YES. Maximal size of possible extension queue 11430. Compared 2263025 event pairs, 42377 based on Foata normal form. 0/261306 useless extension candidates. Maximal degree in co-relation 908384. Up to 133327 conditions per place. [2023-08-24 11:18:14,026 INFO L140 encePairwiseOnDemand]: 401/412 looper letters, 209 selfloop transitions, 136 changer transitions 0/352 dead transitions. [2023-08-24 11:18:14,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 352 transitions, 3829 flow [2023-08-24 11:18:14,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:18:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:18:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 914 transitions. [2023-08-24 11:18:14,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4436893203883495 [2023-08-24 11:18:14,049 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 914 transitions. [2023-08-24 11:18:14,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 914 transitions. [2023-08-24 11:18:14,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:18:14,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 914 transitions. [2023-08-24 11:18:14,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.8) internal successors, (914), 5 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:18:14,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 412.0) internal successors, (2472), 6 states have internal predecessors, (2472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:18:14,051 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 412.0) internal successors, (2472), 6 states have internal predecessors, (2472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:18:14,051 INFO L175 Difference]: Start difference. First operand has 87 places, 142 transitions, 1348 flow. Second operand 5 states and 914 transitions. [2023-08-24 11:18:14,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 352 transitions, 3829 flow [2023-08-24 11:18:35,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 352 transitions, 3797 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-24 11:18:35,618 INFO L231 Difference]: Finished difference. Result has 93 places, 233 transitions, 3106 flow [2023-08-24 11:18:35,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3106, PETRI_PLACES=93, PETRI_TRANSITIONS=233} [2023-08-24 11:18:35,618 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 42 predicate places. [2023-08-24 11:18:35,618 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 233 transitions, 3106 flow [2023-08-24 11:18:35,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:18:35,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:18:35,619 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:18:35,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-08-24 11:18:35,619 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:18:35,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:18:35,619 INFO L85 PathProgramCache]: Analyzing trace with hash -650424333, now seen corresponding path program 2 times [2023-08-24 11:18:35,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:18:35,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217703784] [2023-08-24 11:18:35,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:18:35,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:18:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:18:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:18:35,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:18:35,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217703784] [2023-08-24 11:18:35,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217703784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:18:35,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:18:35,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:18:35,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759772763] [2023-08-24 11:18:35,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:18:35,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:18:35,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:18:35,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:18:35,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:18:35,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-08-24 11:18:35,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 233 transitions, 3106 flow. Second operand has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:18:35,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:18:35,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-08-24 11:18:35,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:19:06,100 INFO L124 PetriNetUnfolderBase]: 247842/345304 cut-off events. [2023-08-24 11:19:06,101 INFO L125 PetriNetUnfolderBase]: For 1019772/1019772 co-relation queries the response was YES. [2023-08-24 11:19:07,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165152 conditions, 345304 events. 247842/345304 cut-off events. For 1019772/1019772 co-relation queries the response was YES. Maximal size of possible extension queue 14369. Compared 2825282 event pairs, 149114 based on Foata normal form. 996/327168 useless extension candidates. Maximal degree in co-relation 1165123. Up to 266851 conditions per place. [2023-08-24 11:19:09,060 INFO L140 encePairwiseOnDemand]: 402/412 looper letters, 329 selfloop transitions, 109 changer transitions 0/445 dead transitions. [2023-08-24 11:19:09,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 445 transitions, 5915 flow [2023-08-24 11:19:09,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:19:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:19:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1043 transitions. [2023-08-24 11:19:09,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42192556634304207 [2023-08-24 11:19:09,061 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1043 transitions. [2023-08-24 11:19:09,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1043 transitions. [2023-08-24 11:19:09,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:19:09,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1043 transitions. [2023-08-24 11:19:09,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:19:09,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:19:09,064 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:19:09,064 INFO L175 Difference]: Start difference. First operand has 93 places, 233 transitions, 3106 flow. Second operand 6 states and 1043 transitions. [2023-08-24 11:19:09,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 445 transitions, 5915 flow [2023-08-24 11:20:15,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 445 transitions, 5843 flow, removed 36 selfloop flow, removed 0 redundant places. [2023-08-24 11:20:15,679 INFO L231 Difference]: Finished difference. Result has 102 places, 325 transitions, 4909 flow [2023-08-24 11:20:15,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=3074, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4909, PETRI_PLACES=102, PETRI_TRANSITIONS=325} [2023-08-24 11:20:15,679 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 51 predicate places. [2023-08-24 11:20:15,679 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 325 transitions, 4909 flow [2023-08-24 11:20:15,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:20:15,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:20:15,680 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:20:15,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-08-24 11:20:15,680 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:20:15,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:20:15,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1331678785, now seen corresponding path program 3 times [2023-08-24 11:20:15,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:20:15,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668568587] [2023-08-24 11:20:15,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:20:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:20:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:20:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:20:15,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:20:15,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668568587] [2023-08-24 11:20:15,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668568587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:20:15,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:20:15,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:20:15,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859573859] [2023-08-24 11:20:15,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:20:15,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:20:15,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:20:15,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:20:15,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:20:15,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-08-24 11:20:15,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 325 transitions, 4909 flow. Second operand has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:20:15,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:20:15,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-08-24 11:20:15,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:20:55,841 INFO L124 PetriNetUnfolderBase]: 271154/379300 cut-off events. [2023-08-24 11:20:55,841 INFO L125 PetriNetUnfolderBase]: For 1433484/1433484 co-relation queries the response was YES. [2023-08-24 11:20:57,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353261 conditions, 379300 events. 271154/379300 cut-off events. For 1433484/1433484 co-relation queries the response was YES. Maximal size of possible extension queue 16577. Compared 3182351 event pairs, 121372 based on Foata normal form. 870/359990 useless extension candidates. Maximal degree in co-relation 1353227. Up to 203677 conditions per place. [2023-08-24 11:20:59,225 INFO L140 encePairwiseOnDemand]: 402/412 looper letters, 288 selfloop transitions, 208 changer transitions 0/503 dead transitions. [2023-08-24 11:20:59,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 503 transitions, 7484 flow [2023-08-24 11:20:59,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:20:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:20:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1042 transitions. [2023-08-24 11:20:59,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4215210355987055 [2023-08-24 11:20:59,226 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1042 transitions. [2023-08-24 11:20:59,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1042 transitions. [2023-08-24 11:20:59,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:20:59,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1042 transitions. [2023-08-24 11:20:59,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.66666666666666) internal successors, (1042), 6 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:20:59,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:20:59,229 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:20:59,229 INFO L175 Difference]: Start difference. First operand has 102 places, 325 transitions, 4909 flow. Second operand 6 states and 1042 transitions. [2023-08-24 11:20:59,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 503 transitions, 7484 flow [2023-08-24 11:22:47,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 503 transitions, 7294 flow, removed 95 selfloop flow, removed 0 redundant places. [2023-08-24 11:22:47,631 INFO L231 Difference]: Finished difference. Result has 111 places, 376 transitions, 6360 flow [2023-08-24 11:22:47,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=4751, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6360, PETRI_PLACES=111, PETRI_TRANSITIONS=376} [2023-08-24 11:22:47,632 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 60 predicate places. [2023-08-24 11:22:47,632 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 376 transitions, 6360 flow [2023-08-24 11:22:47,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:22:47,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:22:47,632 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:22:47,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2023-08-24 11:22:47,632 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:22:47,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:22:47,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1241520557, now seen corresponding path program 1 times [2023-08-24 11:22:47,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:22:47,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432662625] [2023-08-24 11:22:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:22:47,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:22:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:22:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 11:22:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:22:47,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432662625] [2023-08-24 11:22:47,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432662625] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:22:47,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:22:47,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:22:47,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562219770] [2023-08-24 11:22:47,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:22:47,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:22:47,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:22:47,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:22:47,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:22:47,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 412 [2023-08-24 11:22:47,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 376 transitions, 6360 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:22:47,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:22:47,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 412 [2023-08-24 11:22:47,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:22:56,870 INFO L124 PetriNetUnfolderBase]: 48295/79703 cut-off events. [2023-08-24 11:22:56,871 INFO L125 PetriNetUnfolderBase]: For 349776/356326 co-relation queries the response was YES. [2023-08-24 11:22:57,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285060 conditions, 79703 events. 48295/79703 cut-off events. For 349776/356326 co-relation queries the response was YES. Maximal size of possible extension queue 2886. Compared 731638 event pairs, 17868 based on Foata normal form. 1262/77196 useless extension candidates. Maximal degree in co-relation 285021. Up to 39973 conditions per place. [2023-08-24 11:22:57,545 INFO L140 encePairwiseOnDemand]: 404/412 looper letters, 96 selfloop transitions, 8 changer transitions 0/293 dead transitions. [2023-08-24 11:22:57,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 293 transitions, 4499 flow [2023-08-24 11:22:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:22:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:22:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2023-08-24 11:22:57,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47896440129449835 [2023-08-24 11:22:57,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 592 transitions. [2023-08-24 11:22:57,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 592 transitions. [2023-08-24 11:22:57,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:22:57,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 592 transitions. [2023-08-24 11:22:57,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:22:57,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:22:57,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 412.0) internal successors, (1648), 4 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:22:57,548 INFO L175 Difference]: Start difference. First operand has 111 places, 376 transitions, 6360 flow. Second operand 3 states and 592 transitions. [2023-08-24 11:22:57,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 293 transitions, 4499 flow [2023-08-24 11:23:09,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 293 transitions, 4361 flow, removed 69 selfloop flow, removed 0 redundant places. [2023-08-24 11:23:09,938 INFO L231 Difference]: Finished difference. Result has 113 places, 246 transitions, 3768 flow [2023-08-24 11:23:09,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=3752, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3768, PETRI_PLACES=113, PETRI_TRANSITIONS=246} [2023-08-24 11:23:09,938 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 62 predicate places. [2023-08-24 11:23:09,939 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 246 transitions, 3768 flow [2023-08-24 11:23:09,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:23:09,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:23:09,939 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:23:09,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-08-24 11:23:09,939 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:23:09,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:23:09,939 INFO L85 PathProgramCache]: Analyzing trace with hash -251650996, now seen corresponding path program 1 times [2023-08-24 11:23:09,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:23:09,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404823163] [2023-08-24 11:23:09,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:23:09,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:23:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:23:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-24 11:23:09,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:23:09,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404823163] [2023-08-24 11:23:09,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404823163] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:23:09,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881612647] [2023-08-24 11:23:09,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:23:09,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:23:09,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:23:09,965 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 11:23:09,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-24 11:23:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:23:10,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 11:23:10,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:23:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-24 11:23:10,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:23:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-24 11:23:10,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881612647] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:23:10,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:23:10,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-24 11:23:10,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233005370] [2023-08-24 11:23:10,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:23:10,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:23:10,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:23:10,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:23:10,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:23:10,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 412 [2023-08-24 11:23:10,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 246 transitions, 3768 flow. Second operand has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:23:10,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:23:10,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 412 [2023-08-24 11:23:10,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:23:18,674 INFO L124 PetriNetUnfolderBase]: 54615/83725 cut-off events. [2023-08-24 11:23:18,674 INFO L125 PetriNetUnfolderBase]: For 352257/360104 co-relation queries the response was YES. [2023-08-24 11:23:19,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305851 conditions, 83725 events. 54615/83725 cut-off events. For 352257/360104 co-relation queries the response was YES. Maximal size of possible extension queue 2966. Compared 701537 event pairs, 25129 based on Foata normal form. 1652/83754 useless extension candidates. Maximal degree in co-relation 305811. Up to 55352 conditions per place. [2023-08-24 11:23:19,406 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 143 selfloop transitions, 3 changer transitions 0/335 dead transitions. [2023-08-24 11:23:19,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 335 transitions, 4810 flow [2023-08-24 11:23:19,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:23:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:23:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 759 transitions. [2023-08-24 11:23:19,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46055825242718446 [2023-08-24 11:23:19,408 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 759 transitions. [2023-08-24 11:23:19,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 759 transitions. [2023-08-24 11:23:19,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:23:19,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 759 transitions. [2023-08-24 11:23:19,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:23:19,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 412.0) internal successors, (2060), 5 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:23:19,409 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 412.0) internal successors, (2060), 5 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:23:19,409 INFO L175 Difference]: Start difference. First operand has 113 places, 246 transitions, 3768 flow. Second operand 4 states and 759 transitions. [2023-08-24 11:23:19,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 335 transitions, 4810 flow [2023-08-24 11:23:24,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 335 transitions, 4790 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:23:24,952 INFO L231 Difference]: Finished difference. Result has 116 places, 247 transitions, 3776 flow [2023-08-24 11:23:24,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=3760, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3776, PETRI_PLACES=116, PETRI_TRANSITIONS=247} [2023-08-24 11:23:24,953 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 65 predicate places. [2023-08-24 11:23:24,953 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 247 transitions, 3776 flow [2023-08-24 11:23:24,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:23:24,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:23:24,953 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:23:24,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-24 11:23:25,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:23:25,157 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:23:25,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:23:25,157 INFO L85 PathProgramCache]: Analyzing trace with hash -423676854, now seen corresponding path program 2 times [2023-08-24 11:23:25,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:23:25,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222065458] [2023-08-24 11:23:25,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:23:25,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:23:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:23:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-24 11:23:25,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:23:25,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222065458] [2023-08-24 11:23:25,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222065458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:23:25,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:23:25,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:23:25,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404065712] [2023-08-24 11:23:25,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:23:25,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:23:25,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:23:25,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:23:25,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:23:25,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-08-24 11:23:25,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 247 transitions, 3776 flow. Second operand has 5 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:23:25,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:23:25,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-08-24 11:23:25,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:23:42,444 INFO L124 PetriNetUnfolderBase]: 111369/165873 cut-off events. [2023-08-24 11:23:42,444 INFO L125 PetriNetUnfolderBase]: For 678952/678952 co-relation queries the response was YES. [2023-08-24 11:23:43,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611827 conditions, 165873 events. 111369/165873 cut-off events. For 678952/678952 co-relation queries the response was YES. Maximal size of possible extension queue 6760. Compared 1424121 event pairs, 53479 based on Foata normal form. 1000/163154 useless extension candidates. Maximal degree in co-relation 611785. Up to 83886 conditions per place. [2023-08-24 11:23:44,070 INFO L140 encePairwiseOnDemand]: 402/412 looper letters, 274 selfloop transitions, 172 changer transitions 2/455 dead transitions. [2023-08-24 11:23:44,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 455 transitions, 6850 flow [2023-08-24 11:23:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:23:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:23:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1035 transitions. [2023-08-24 11:23:44,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186893203883495 [2023-08-24 11:23:44,071 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1035 transitions. [2023-08-24 11:23:44,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1035 transitions. [2023-08-24 11:23:44,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:23:44,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1035 transitions. [2023-08-24 11:23:44,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:23:44,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:23:44,090 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:23:44,090 INFO L175 Difference]: Start difference. First operand has 116 places, 247 transitions, 3776 flow. Second operand 6 states and 1035 transitions. [2023-08-24 11:23:44,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 455 transitions, 6850 flow [2023-08-24 11:24:16,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 455 transitions, 6834 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 11:24:16,395 INFO L231 Difference]: Finished difference. Result has 123 places, 311 transitions, 5503 flow [2023-08-24 11:24:16,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=3733, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5503, PETRI_PLACES=123, PETRI_TRANSITIONS=311} [2023-08-24 11:24:16,395 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 72 predicate places. [2023-08-24 11:24:16,395 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 311 transitions, 5503 flow [2023-08-24 11:24:16,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:24:16,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:24:16,396 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:24:16,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2023-08-24 11:24:16,396 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:24:16,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:24:16,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1676756770, now seen corresponding path program 1 times [2023-08-24 11:24:16,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:24:16,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204221816] [2023-08-24 11:24:16,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:24:16,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:24:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:24:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-24 11:24:16,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:24:16,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204221816] [2023-08-24 11:24:16,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204221816] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:24:16,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:24:16,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:24:16,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458394411] [2023-08-24 11:24:16,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:24:16,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:24:16,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:24:16,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:24:16,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:24:16,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-08-24 11:24:16,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 311 transitions, 5503 flow. Second operand has 5 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:24:16,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:24:16,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-08-24 11:24:16,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:24:36,751 INFO L124 PetriNetUnfolderBase]: 120241/181233 cut-off events. [2023-08-24 11:24:36,751 INFO L125 PetriNetUnfolderBase]: For 872865/872865 co-relation queries the response was YES. [2023-08-24 11:24:37,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688078 conditions, 181233 events. 120241/181233 cut-off events. For 872865/872865 co-relation queries the response was YES. Maximal size of possible extension queue 8476. Compared 1605206 event pairs, 60607 based on Foata normal form. 1082/181748 useless extension candidates. Maximal degree in co-relation 688032. Up to 92996 conditions per place. [2023-08-24 11:24:38,618 INFO L140 encePairwiseOnDemand]: 402/412 looper letters, 312 selfloop transitions, 206 changer transitions 5/530 dead transitions. [2023-08-24 11:24:38,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 530 transitions, 9027 flow [2023-08-24 11:24:38,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:24:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:24:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1033 transitions. [2023-08-24 11:24:38,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4178802588996764 [2023-08-24 11:24:38,619 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1033 transitions. [2023-08-24 11:24:38,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1033 transitions. [2023-08-24 11:24:38,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:24:38,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1033 transitions. [2023-08-24 11:24:38,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:24:38,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:24:38,621 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:24:38,621 INFO L175 Difference]: Start difference. First operand has 123 places, 311 transitions, 5503 flow. Second operand 6 states and 1033 transitions. [2023-08-24 11:24:38,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 530 transitions, 9027 flow [2023-08-24 11:25:18,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 530 transitions, 9027 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:25:18,505 INFO L231 Difference]: Finished difference. Result has 132 places, 362 transitions, 7283 flow [2023-08-24 11:25:18,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=5363, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7283, PETRI_PLACES=132, PETRI_TRANSITIONS=362} [2023-08-24 11:25:18,505 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 81 predicate places. [2023-08-24 11:25:18,505 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 362 transitions, 7283 flow [2023-08-24 11:25:18,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:25:18,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:25:18,505 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:25:18,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2023-08-24 11:25:18,505 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:25:18,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:25:18,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1345945472, now seen corresponding path program 1 times [2023-08-24 11:25:18,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:25:18,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163189516] [2023-08-24 11:25:18,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:25:18,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:25:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:25:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-24 11:25:18,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:25:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163189516] [2023-08-24 11:25:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163189516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:25:18,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:25:18,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:25:18,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067475472] [2023-08-24 11:25:18,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:25:18,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:25:18,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:25:18,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:25:18,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:25:18,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-08-24 11:25:18,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 362 transitions, 7283 flow. Second operand has 5 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:25:18,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:25:18,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-08-24 11:25:18,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:25:44,069 INFO L124 PetriNetUnfolderBase]: 129480/198524 cut-off events. [2023-08-24 11:25:44,069 INFO L125 PetriNetUnfolderBase]: For 1215925/1215925 co-relation queries the response was YES. [2023-08-24 11:25:45,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788223 conditions, 198524 events. 129480/198524 cut-off events. For 1215925/1215925 co-relation queries the response was YES. Maximal size of possible extension queue 10848. Compared 1849377 event pairs, 62717 based on Foata normal form. 1224/199391 useless extension candidates. Maximal degree in co-relation 788172. Up to 97730 conditions per place. [2023-08-24 11:25:46,019 INFO L140 encePairwiseOnDemand]: 402/412 looper letters, 361 selfloop transitions, 246 changer transitions 3/617 dead transitions. [2023-08-24 11:25:46,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 617 transitions, 12028 flow [2023-08-24 11:25:46,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:25:46,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:25:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1034 transitions. [2023-08-24 11:25:46,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41828478964401294 [2023-08-24 11:25:46,020 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1034 transitions. [2023-08-24 11:25:46,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1034 transitions. [2023-08-24 11:25:46,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:25:46,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1034 transitions. [2023-08-24 11:25:46,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.33333333333334) internal successors, (1034), 6 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:25:46,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:25:46,023 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:25:46,023 INFO L175 Difference]: Start difference. First operand has 132 places, 362 transitions, 7283 flow. Second operand 6 states and 1034 transitions. [2023-08-24 11:25:46,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 617 transitions, 12028 flow [2023-08-24 11:26:48,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 617 transitions, 11944 flow, removed 42 selfloop flow, removed 0 redundant places. [2023-08-24 11:26:48,213 INFO L231 Difference]: Finished difference. Result has 141 places, 442 transitions, 9800 flow [2023-08-24 11:26:48,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=7021, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9800, PETRI_PLACES=141, PETRI_TRANSITIONS=442} [2023-08-24 11:26:48,214 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 90 predicate places. [2023-08-24 11:26:48,214 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 442 transitions, 9800 flow [2023-08-24 11:26:48,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:26:48,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:26:48,214 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:26:48,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2023-08-24 11:26:48,214 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:26:48,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:26:48,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1765707426, now seen corresponding path program 1 times [2023-08-24 11:26:48,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:26:48,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651768461] [2023-08-24 11:26:48,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:26:48,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:26:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:26:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-24 11:26:48,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:26:48,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651768461] [2023-08-24 11:26:48,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651768461] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:26:48,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:26:48,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:26:48,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195001896] [2023-08-24 11:26:48,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:26:48,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:26:48,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:26:48,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:26:48,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:26:48,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 412 [2023-08-24 11:26:48,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 442 transitions, 9800 flow. Second operand has 5 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:26:48,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:26:48,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 412 [2023-08-24 11:26:48,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:27:21,148 INFO L124 PetriNetUnfolderBase]: 138841/216431 cut-off events. [2023-08-24 11:27:21,148 INFO L125 PetriNetUnfolderBase]: For 1609690/1609690 co-relation queries the response was YES. [2023-08-24 11:27:22,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901807 conditions, 216431 events. 138841/216431 cut-off events. For 1609690/1609690 co-relation queries the response was YES. Maximal size of possible extension queue 13716. Compared 2097842 event pairs, 69176 based on Foata normal form. 1308/217172 useless extension candidates. Maximal degree in co-relation 901751. Up to 106975 conditions per place. [2023-08-24 11:27:23,623 INFO L140 encePairwiseOnDemand]: 402/412 looper letters, 392 selfloop transitions, 299 changer transitions 9/707 dead transitions. [2023-08-24 11:27:23,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 707 transitions, 15172 flow [2023-08-24 11:27:23,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:27:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:27:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1033 transitions. [2023-08-24 11:27:23,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4178802588996764 [2023-08-24 11:27:23,631 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1033 transitions. [2023-08-24 11:27:23,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1033 transitions. [2023-08-24 11:27:23,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:27:23,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1033 transitions. [2023-08-24 11:27:23,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:27:23,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:27:23,637 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 412.0) internal successors, (2884), 7 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:27:23,637 INFO L175 Difference]: Start difference. First operand has 141 places, 442 transitions, 9800 flow. Second operand 6 states and 1033 transitions. [2023-08-24 11:27:23,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 707 transitions, 15172 flow [2023-08-24 11:28:53,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 707 transitions, 15172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:28:53,559 INFO L231 Difference]: Finished difference. Result has 151 places, 512 transitions, 12793 flow [2023-08-24 11:28:53,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=9493, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12793, PETRI_PLACES=151, PETRI_TRANSITIONS=512} [2023-08-24 11:28:53,559 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 100 predicate places. [2023-08-24 11:28:53,559 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 512 transitions, 12793 flow [2023-08-24 11:28:53,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:28:53,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:28:53,559 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:28:53,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2023-08-24 11:28:53,560 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 11:28:53,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:28:53,560 INFO L85 PathProgramCache]: Analyzing trace with hash -775689666, now seen corresponding path program 1 times [2023-08-24 11:28:53,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:28:53,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867533055] [2023-08-24 11:28:53,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:28:53,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:28:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:28:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-24 11:28:53,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:28:53,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867533055] [2023-08-24 11:28:53,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867533055] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:28:53,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:28:53,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:28:53,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777392601] [2023-08-24 11:28:53,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:28:53,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:28:53,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:28:53,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:28:53,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:28:53,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 412 [2023-08-24 11:28:53,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 512 transitions, 12793 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:28:53,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:28:53,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 412 [2023-08-24 11:28:53,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-08-24 11:29:03,306 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 11:29:03,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:29:03,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-24 11:29:03,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2023-08-24 11:29:03,768 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (3states, 174/412 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 249249 conditions, 62940 events (41404/62939 cut-off events. For 458756/460937 co-relation queries the response was YES. Maximal size of possible extension queue 4370. Compared 532114 event pairs, 25724 based on Foata normal form. 1232/66927 useless extension candidates. Maximal degree in co-relation 249188. Up to 46409 conditions per place.). [2023-08-24 11:29:03,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-24 11:29:03,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-08-24 11:29:03,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-08-24 11:29:03,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-24 11:29:03,769 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:29:03,769 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-24 11:29:03,769 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2023-08-24 11:29:03,769 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:29:03,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:29:03 BasicIcfg [2023-08-24 11:29:03,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:29:03,779 INFO L158 Benchmark]: Toolchain (without parser) took 778811.13ms. Allocated memory was 379.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 354.7MB in the beginning and 11.5GB in the end (delta: -11.2GB). Peak memory consumption was 6.4GB. Max. memory is 16.0GB. [2023-08-24 11:29:03,779 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 379.6MB. Free memory is still 356.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:29:03,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.89ms. Allocated memory is still 379.6MB. Free memory was 354.1MB in the beginning and 334.6MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-24 11:29:03,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.69ms. Allocated memory is still 379.6MB. Free memory was 334.6MB in the beginning and 332.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:29:03,779 INFO L158 Benchmark]: Boogie Preprocessor took 31.42ms. Allocated memory is still 379.6MB. Free memory was 332.7MB in the beginning and 331.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:29:03,780 INFO L158 Benchmark]: RCFGBuilder took 283.40ms. Allocated memory is still 379.6MB. Free memory was 331.1MB in the beginning and 315.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-24 11:29:03,780 INFO L158 Benchmark]: TraceAbstraction took 778076.01ms. Allocated memory was 379.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 315.3MB in the beginning and 11.5GB in the end (delta: -11.2GB). Peak memory consumption was 6.4GB. Max. memory is 16.0GB. [2023-08-24 11:29:03,780 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.11ms. Allocated memory is still 379.6MB. Free memory is still 356.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 365.89ms. Allocated memory is still 379.6MB. Free memory was 354.1MB in the beginning and 334.6MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.69ms. Allocated memory is still 379.6MB. Free memory was 334.6MB in the beginning and 332.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.42ms. Allocated memory is still 379.6MB. Free memory was 332.7MB in the beginning and 331.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 283.40ms. Allocated memory is still 379.6MB. Free memory was 331.1MB in the beginning and 315.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 778076.01ms. Allocated memory was 379.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 315.3MB in the beginning and 11.5GB in the end (delta: -11.2GB). Peak memory consumption was 6.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 254]: Unsoundness Warning unspecified type, defaulting to int C: short [254] - GenericResultAtLocation [Line: 254]: Unsoundness Warning unspecified type, defaulting to int C: short [254] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 73 PlacesBefore, 12 PlacesAfterwards, 78 TransitionsBefore, 10 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 5 FixpointIterations, 19 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 7 ChoiceCompositions, 81 TotalNumberOfCompositions, 894 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 869, independent: 857, independent conditional: 0, independent unconditional: 857, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 607, independent: 603, independent conditional: 0, independent unconditional: 603, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 869, independent: 254, independent conditional: 0, independent unconditional: 254, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 607, unknown conditional: 0, unknown unconditional: 607] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 73 PlacesBefore, 12 PlacesAfterwards, 78 TransitionsBefore, 10 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 7 ChoiceCompositions, 83 TotalNumberOfCompositions, 924 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 875, independent: 861, independent conditional: 0, independent unconditional: 861, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 603, independent: 599, independent conditional: 0, independent unconditional: 599, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 875, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 603, unknown conditional: 0, unknown unconditional: 603] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 113 PlacesBefore, 29 PlacesAfterwards, 123 TransitionsBefore, 32 TransitionsAfterwards, 6248 CoEnabledTransitionPairs, 7 FixpointIterations, 19 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 23 ConcurrentYvCompositions, 7 ChoiceCompositions, 115 TotalNumberOfCompositions, 9776 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6373, independent: 6188, independent conditional: 0, independent unconditional: 6188, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3383, independent: 3360, independent conditional: 0, independent unconditional: 3360, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6373, independent: 2828, independent conditional: 0, independent unconditional: 2828, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 3383, unknown conditional: 0, unknown unconditional: 3383] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 113 PlacesBefore, 29 PlacesAfterwards, 123 TransitionsBefore, 32 TransitionsAfterwards, 6248 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 20 ConcurrentYvCompositions, 7 ChoiceCompositions, 110 TotalNumberOfCompositions, 8937 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5923, independent: 5762, independent conditional: 0, independent unconditional: 5762, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3297, independent: 3275, independent conditional: 0, independent unconditional: 3275, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5923, independent: 2487, independent conditional: 0, independent unconditional: 2487, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 3297, unknown conditional: 0, unknown unconditional: 3297] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 153 PlacesBefore, 40 PlacesAfterwards, 168 TransitionsBefore, 45 TransitionsAfterwards, 15312 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 99 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 10 ChoiceCompositions, 161 TotalNumberOfCompositions, 23024 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13782, independent: 13546, independent conditional: 0, independent unconditional: 13546, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8210, independent: 8182, independent conditional: 0, independent unconditional: 8182, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13782, independent: 5364, independent conditional: 0, independent unconditional: 5364, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 8210, unknown conditional: 0, unknown unconditional: 8210] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 153 PlacesBefore, 40 PlacesAfterwards, 168 TransitionsBefore, 45 TransitionsAfterwards, 15312 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 98 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 10 ChoiceCompositions, 158 TotalNumberOfCompositions, 23205 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13777, independent: 13537, independent conditional: 0, independent unconditional: 13537, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8012, independent: 7982, independent conditional: 0, independent unconditional: 7982, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13777, independent: 5555, independent conditional: 0, independent unconditional: 5555, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 8012, unknown conditional: 0, unknown unconditional: 8012] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 169, Positive conditional cache size: 0, Positive unconditional cache size: 169, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 193 PlacesBefore, 51 PlacesAfterwards, 213 TransitionsBefore, 58 TransitionsAfterwards, 28336 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 126 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 41 ConcurrentYvCompositions, 13 ChoiceCompositions, 199 TotalNumberOfCompositions, 42708 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 23137, independent: 22823, independent conditional: 0, independent unconditional: 22823, dependent: 314, dependent conditional: 0, dependent unconditional: 314, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15003, independent: 14962, independent conditional: 0, independent unconditional: 14962, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23137, independent: 7861, independent conditional: 0, independent unconditional: 7861, dependent: 273, dependent conditional: 0, dependent unconditional: 273, unknown: 15003, unknown conditional: 0, unknown unconditional: 15003] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 229, Positive conditional cache size: 0, Positive unconditional cache size: 229, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (3states, 174/412 universal loopers) in iteration 21,while PetriNetUnfolder was constructing finite prefix that currently has 249249 conditions, 62940 events (41404/62939 cut-off events. For 458756/460937 co-relation queries the response was YES. Maximal size of possible extension queue 4370. Compared 532114 event pairs, 25724 based on Foata normal form. 1232/66927 useless extension candidates. Maximal degree in co-relation 249188. Up to 46409 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 109 locations, 3 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: 2.3s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 2, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 4 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 147 locations, 4 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: 4.9s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 736 IncrementalHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 46 mSDtfsCounter, 736 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=11, InterpolantAutomatonStates: 45, 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.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 274 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 461 SizeOfPredicates, 4 NumberOfNonLiveVariables, 592 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 76/84 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 185 locations, 5 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: 21.4s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 961 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 961 mSDsluCounter, 258 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3700 IncrementalHoareTripleChecker+Invalid, 3764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 195 mSDtfsCounter, 3700 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 233 SyntacticMatches, 6 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1653occurred in iteration=13, InterpolantAutomatonStates: 125, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 649 NumberOfCodeBlocks, 633 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 679 ConstructedInterpolants, 0 QuantifiedInterpolants, 1129 SizeOfPredicates, 4 NumberOfNonLiveVariables, 777 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 33 InterpolantComputations, 22 PerfectInterpolantSequences, 284/295 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 - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 223 locations, 6 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: 742.7s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 737.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1284 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1284 mSDsluCounter, 309 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3622 IncrementalHoareTripleChecker+Invalid, 3676 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 231 mSDtfsCounter, 3622 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 200 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12793occurred in iteration=20, InterpolantAutomatonStates: 88, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 505 NumberOfCodeBlocks, 489 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 539 ConstructedInterpolants, 0 QuantifiedInterpolants, 863 SizeOfPredicates, 4 NumberOfNonLiveVariables, 760 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 29 InterpolantComputations, 18 PerfectInterpolantSequences, 221/232 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 109 locations, 3 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: 2.0s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 147 locations, 4 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: 2.0s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 3 thread instances CFG has 5 procedures, 185 locations, 5 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: 2.6s, OverallIterations: 1, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 could not prove your program: Timeout Completed graceful shutdown