/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:33:50,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:33:51,021 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 05:33:51,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:33:51,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:33:51,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:33:51,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:33:51,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:33:51,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:33:51,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:33:51,048 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:33:51,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:33:51,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:33:51,050 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:33:51,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:33:51,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:33:51,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:33:51,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:33:51,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:33:51,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:33:51,052 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:33:51,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:33:51,052 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:33:51,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:33:51,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:33:51,053 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:33:51,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:33:51,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:33:51,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:33:51,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:33:51,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:33:51,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:33:51,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:33:51,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:33:51,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:33:51,056 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:33:51,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:33:51,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:33:51,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:33:51,389 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:33:51,389 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:33:51,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:33:52,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:33:52,910 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:33:52,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:33:52,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15162ee7/50cdb526ce4b448b9eefefc9b14ca322/FLAGceda2e80f [2023-08-24 05:33:52,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15162ee7/50cdb526ce4b448b9eefefc9b14ca322 [2023-08-24 05:33:52,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:33:52,951 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:33:52,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:33:52,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:33:52,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:33:52,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:33:52" (1/1) ... [2023-08-24 05:33:52,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fca3735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:52, skipping insertion in model container [2023-08-24 05:33:52,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:33:52" (1/1) ... [2023-08-24 05:33:53,009 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:33:53,181 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-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-08-24 05:33:53,428 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:33:53,441 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:33:53,451 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-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-08-24 05:33:53,457 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:33:53,459 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:33:53,486 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:33:53,511 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:33:53,511 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:33:53,517 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:33:53,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:53 WrapperNode [2023-08-24 05:33:53,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:33:53,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:33:53,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:33:53,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:33:53,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:53" (1/1) ... [2023-08-24 05:33:53,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:53" (1/1) ... [2023-08-24 05:33:53,564 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-24 05:33:53,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:33:53,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:33:53,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:33:53,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:33:53,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:53" (1/1) ... [2023-08-24 05:33:53,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:53" (1/1) ... [2023-08-24 05:33:53,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:53" (1/1) ... [2023-08-24 05:33:53,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:53" (1/1) ... [2023-08-24 05:33:53,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:53" (1/1) ... [2023-08-24 05:33:53,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:53" (1/1) ... [2023-08-24 05:33:53,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:53" (1/1) ... [2023-08-24 05:33:53,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:53" (1/1) ... [2023-08-24 05:33:53,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:33:53,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:33:53,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:33:53,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:33:53,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:53" (1/1) ... [2023-08-24 05:33:53,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:33:53,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:33:53,646 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 05:33:53,674 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 05:33:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:33:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:33:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:33:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:33:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:33:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:33:53,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:33:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:33:53,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:33:53,692 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:33:53,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:33:53,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:33:53,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:33:53,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:33:53,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:33:53,695 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 05:33:53,832 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:33:53,833 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:33:54,244 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:33:54,395 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:33:54,396 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:33:54,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:33:54 BoogieIcfgContainer [2023-08-24 05:33:54,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:33:54,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:33:54,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:33:54,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:33:54,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:33:52" (1/3) ... [2023-08-24 05:33:54,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404bd91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:33:54, skipping insertion in model container [2023-08-24 05:33:54,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:53" (2/3) ... [2023-08-24 05:33:54,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404bd91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:33:54, skipping insertion in model container [2023-08-24 05:33:54,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:33:54" (3/3) ... [2023-08-24 05:33:54,406 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:33:54,436 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:33:54,437 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:33:54,438 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:33:54,528 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:33:54,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-08-24 05:33:54,624 INFO L124 PetriNetUnfolderBase]: 2/104 cut-off events. [2023-08-24 05:33:54,624 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:33:54,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-24 05:33:54,632 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-08-24 05:33:54,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-08-24 05:33:54,639 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:33:54,652 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-08-24 05:33:54,654 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-08-24 05:33:54,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-08-24 05:33:54,684 INFO L124 PetriNetUnfolderBase]: 2/104 cut-off events. [2023-08-24 05:33:54,684 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:33:54,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-24 05:33:54,686 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-08-24 05:33:58,016 INFO L134 LiptonReduction]: Checked pairs total: 5019 [2023-08-24 05:33:58,016 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-08-24 05:33:58,028 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:33:58,033 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;@16f073e0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:33:58,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 05:33:58,035 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:33:58,036 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-24 05:33:58,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:33:58,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:33:58,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 05:33:58,037 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:33:58,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:33:58,041 INFO L85 PathProgramCache]: Analyzing trace with hash 534214, now seen corresponding path program 1 times [2023-08-24 05:33:58,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:33:58,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272772268] [2023-08-24 05:33:58,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:33:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:33:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:33:58,387 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 05:33:58,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:33:58,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272772268] [2023-08-24 05:33:58,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272772268] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:33:58,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:33:58,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:33:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404900011] [2023-08-24 05:33:58,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:33:58,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:33:58,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:33:58,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:33:58,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:33:58,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 198 [2023-08-24 05:33:58,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 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 05:33:58,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:33:58,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 198 [2023-08-24 05:33:58,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:33:58,813 INFO L124 PetriNetUnfolderBase]: 1263/2016 cut-off events. [2023-08-24 05:33:58,814 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-24 05:33:58,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 2016 events. 1263/2016 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10879 event pairs, 204 based on Foata normal form. 80/1935 useless extension candidates. Maximal degree in co-relation 3916. Up to 1510 conditions per place. [2023-08-24 05:33:58,832 INFO L140 encePairwiseOnDemand]: 194/198 looper letters, 33 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2023-08-24 05:33:58,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 175 flow [2023-08-24 05:33:58,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:33:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:33:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-08-24 05:33:58,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2023-08-24 05:33:58,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-08-24 05:33:58,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-08-24 05:33:58,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:33:58,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-08-24 05:33:58,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:33:58,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:33:58,866 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:33:58,868 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 315 transitions. [2023-08-24 05:33:58,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 175 flow [2023-08-24 05:33:58,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 05:33:58,873 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-24 05:33:58,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-24 05:33:58,878 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-08-24 05:33:58,878 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-24 05:33:58,879 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 05:33:58,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:33:58,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:33:58,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:33:58,880 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:33:58,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:33:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1598286958, now seen corresponding path program 1 times [2023-08-24 05:33:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:33:58,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475863368] [2023-08-24 05:33:58,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:33:58,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:33:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:33:59,842 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 05:33:59,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:33:59,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475863368] [2023-08-24 05:33:59,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475863368] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:33:59,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:33:59,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:33:59,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999756878] [2023-08-24 05:33:59,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:33:59,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:33:59,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:33:59,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:33:59,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:33:59,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-08-24 05:33:59,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:33:59,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:33:59,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-08-24 05:33:59,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:00,404 INFO L124 PetriNetUnfolderBase]: 1621/2422 cut-off events. [2023-08-24 05:34:00,404 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2023-08-24 05:34:00,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5052 conditions, 2422 events. 1621/2422 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10547 event pairs, 454 based on Foata normal form. 140/2562 useless extension candidates. Maximal degree in co-relation 5042. Up to 1296 conditions per place. [2023-08-24 05:34:00,416 INFO L140 encePairwiseOnDemand]: 188/198 looper letters, 34 selfloop transitions, 8 changer transitions 29/71 dead transitions. [2023-08-24 05:34:00,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 71 transitions, 300 flow [2023-08-24 05:34:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:34:00,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:34:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 613 transitions. [2023-08-24 05:34:00,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4422799422799423 [2023-08-24 05:34:00,419 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 613 transitions. [2023-08-24 05:34:00,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 613 transitions. [2023-08-24 05:34:00,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:00,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 613 transitions. [2023-08-24 05:34:00,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:00,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:00,425 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:00,425 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 7 states and 613 transitions. [2023-08-24 05:34:00,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 71 transitions, 300 flow [2023-08-24 05:34:00,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 71 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:34:00,427 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 126 flow [2023-08-24 05:34:00,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-24 05:34:00,428 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2023-08-24 05:34:00,428 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 126 flow [2023-08-24 05:34:00,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:00,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:00,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:00,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:34:00,429 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:00,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:00,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1577430061, now seen corresponding path program 1 times [2023-08-24 05:34:00,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:00,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237161776] [2023-08-24 05:34:00,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:00,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:01,209 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 05:34:01,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237161776] [2023-08-24 05:34:01,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237161776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:01,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:01,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:34:01,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264896395] [2023-08-24 05:34:01,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:01,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:34:01,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:01,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:34:01,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:34:01,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-08-24 05:34:01,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:01,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:01,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-08-24 05:34:01,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:01,777 INFO L124 PetriNetUnfolderBase]: 1517/2285 cut-off events. [2023-08-24 05:34:01,777 INFO L125 PetriNetUnfolderBase]: For 2307/2307 co-relation queries the response was YES. [2023-08-24 05:34:01,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7065 conditions, 2285 events. 1517/2285 cut-off events. For 2307/2307 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10167 event pairs, 420 based on Foata normal form. 89/2374 useless extension candidates. Maximal degree in co-relation 7049. Up to 1774 conditions per place. [2023-08-24 05:34:01,795 INFO L140 encePairwiseOnDemand]: 187/198 looper letters, 40 selfloop transitions, 17 changer transitions 23/80 dead transitions. [2023-08-24 05:34:01,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 80 transitions, 496 flow [2023-08-24 05:34:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:34:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:34:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 616 transitions. [2023-08-24 05:34:01,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-24 05:34:01,797 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 616 transitions. [2023-08-24 05:34:01,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 616 transitions. [2023-08-24 05:34:01,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:01,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 616 transitions. [2023-08-24 05:34:01,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:01,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:01,803 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:01,803 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 126 flow. Second operand 7 states and 616 transitions. [2023-08-24 05:34:01,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 80 transitions, 496 flow [2023-08-24 05:34:01,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 80 transitions, 484 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 05:34:01,822 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 240 flow [2023-08-24 05:34:01,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-08-24 05:34:01,824 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2023-08-24 05:34:01,827 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 240 flow [2023-08-24 05:34:01,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:01,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:01,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:01,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:34:01,829 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:01,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:01,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1655715985, now seen corresponding path program 1 times [2023-08-24 05:34:01,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:01,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586697594] [2023-08-24 05:34:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:01,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:02,508 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 05:34:02,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:02,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586697594] [2023-08-24 05:34:02,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586697594] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:02,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:02,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:34:02,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338521832] [2023-08-24 05:34:02,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:02,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:34:02,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:02,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:34:02,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:34:02,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-08-24 05:34:02,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 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 05:34:02,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:02,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-08-24 05:34:02,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:03,118 INFO L124 PetriNetUnfolderBase]: 2255/3357 cut-off events. [2023-08-24 05:34:03,118 INFO L125 PetriNetUnfolderBase]: For 5612/5612 co-relation queries the response was YES. [2023-08-24 05:34:03,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12611 conditions, 3357 events. 2255/3357 cut-off events. For 5612/5612 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15814 event pairs, 462 based on Foata normal form. 81/3438 useless extension candidates. Maximal degree in co-relation 12590. Up to 1464 conditions per place. [2023-08-24 05:34:03,140 INFO L140 encePairwiseOnDemand]: 185/198 looper letters, 47 selfloop transitions, 20 changer transitions 28/95 dead transitions. [2023-08-24 05:34:03,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 95 transitions, 771 flow [2023-08-24 05:34:03,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:34:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:34:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 532 transitions. [2023-08-24 05:34:03,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4478114478114478 [2023-08-24 05:34:03,143 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 532 transitions. [2023-08-24 05:34:03,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 532 transitions. [2023-08-24 05:34:03,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:03,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 532 transitions. [2023-08-24 05:34:03,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:03,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:03,148 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:03,148 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 240 flow. Second operand 6 states and 532 transitions. [2023-08-24 05:34:03,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 95 transitions, 771 flow [2023-08-24 05:34:03,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 95 transitions, 751 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-24 05:34:03,181 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 393 flow [2023-08-24 05:34:03,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=393, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-24 05:34:03,183 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2023-08-24 05:34:03,183 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 393 flow [2023-08-24 05:34:03,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 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 05:34:03,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:03,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:03,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:34:03,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:03,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:03,184 INFO L85 PathProgramCache]: Analyzing trace with hash 923028933, now seen corresponding path program 2 times [2023-08-24 05:34:03,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:03,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733160870] [2023-08-24 05:34:03,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:03,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:04,045 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 05:34:04,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:04,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733160870] [2023-08-24 05:34:04,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733160870] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:04,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:04,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:34:04,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383440775] [2023-08-24 05:34:04,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:04,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:34:04,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:04,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:34:04,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:34:04,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 198 [2023-08-24 05:34:04,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 393 flow. Second operand has 7 states, 7 states have (on average 76.85714285714286) internal successors, (538), 7 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:04,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:04,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 198 [2023-08-24 05:34:04,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:04,672 INFO L124 PetriNetUnfolderBase]: 1890/2844 cut-off events. [2023-08-24 05:34:04,673 INFO L125 PetriNetUnfolderBase]: For 7612/7612 co-relation queries the response was YES. [2023-08-24 05:34:04,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12256 conditions, 2844 events. 1890/2844 cut-off events. For 7612/7612 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13484 event pairs, 251 based on Foata normal form. 81/2925 useless extension candidates. Maximal degree in co-relation 12232. Up to 1219 conditions per place. [2023-08-24 05:34:04,690 INFO L140 encePairwiseOnDemand]: 187/198 looper letters, 51 selfloop transitions, 17 changer transitions 54/122 dead transitions. [2023-08-24 05:34:04,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 122 transitions, 1236 flow [2023-08-24 05:34:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:34:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:34:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 605 transitions. [2023-08-24 05:34:04,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2023-08-24 05:34:04,694 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 605 transitions. [2023-08-24 05:34:04,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 605 transitions. [2023-08-24 05:34:04,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:04,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 605 transitions. [2023-08-24 05:34:04,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.42857142857143) internal successors, (605), 7 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:04,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:04,699 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:04,699 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 393 flow. Second operand 7 states and 605 transitions. [2023-08-24 05:34:04,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 122 transitions, 1236 flow [2023-08-24 05:34:04,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 122 transitions, 1211 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-24 05:34:04,716 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 412 flow [2023-08-24 05:34:04,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=412, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-08-24 05:34:04,719 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2023-08-24 05:34:04,719 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 412 flow [2023-08-24 05:34:04,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.85714285714286) internal successors, (538), 7 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:04,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:04,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:04,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:34:04,720 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:04,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash -974768166, now seen corresponding path program 1 times [2023-08-24 05:34:04,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:04,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165847635] [2023-08-24 05:34:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:05,691 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 05:34:05,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:05,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165847635] [2023-08-24 05:34:05,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165847635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:05,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:05,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:34:05,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808872478] [2023-08-24 05:34:05,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:05,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:34:05,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:05,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:34:05,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:34:05,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 198 [2023-08-24 05:34:05,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 412 flow. Second operand has 7 states, 7 states have (on average 77.0) internal successors, (539), 7 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 05:34:05,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:05,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 198 [2023-08-24 05:34:05,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:06,423 INFO L124 PetriNetUnfolderBase]: 1093/1681 cut-off events. [2023-08-24 05:34:06,423 INFO L125 PetriNetUnfolderBase]: For 5601/5601 co-relation queries the response was YES. [2023-08-24 05:34:06,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7744 conditions, 1681 events. 1093/1681 cut-off events. For 5601/5601 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6992 event pairs, 531 based on Foata normal form. 53/1734 useless extension candidates. Maximal degree in co-relation 7716. Up to 1269 conditions per place. [2023-08-24 05:34:06,438 INFO L140 encePairwiseOnDemand]: 185/198 looper letters, 48 selfloop transitions, 26 changer transitions 18/92 dead transitions. [2023-08-24 05:34:06,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 864 flow [2023-08-24 05:34:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:34:06,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:34:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 678 transitions. [2023-08-24 05:34:06,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2023-08-24 05:34:06,441 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 678 transitions. [2023-08-24 05:34:06,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 678 transitions. [2023-08-24 05:34:06,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:06,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 678 transitions. [2023-08-24 05:34:06,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 84.75) internal successors, (678), 8 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:06,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:06,447 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:06,447 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 412 flow. Second operand 8 states and 678 transitions. [2023-08-24 05:34:06,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 864 flow [2023-08-24 05:34:06,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 92 transitions, 793 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-08-24 05:34:06,459 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 461 flow [2023-08-24 05:34:06,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=461, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-08-24 05:34:06,461 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2023-08-24 05:34:06,461 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 461 flow [2023-08-24 05:34:06,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.0) internal successors, (539), 7 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 05:34:06,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:06,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:06,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:34:06,462 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:06,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:06,465 INFO L85 PathProgramCache]: Analyzing trace with hash 449698731, now seen corresponding path program 1 times [2023-08-24 05:34:06,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:06,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996176062] [2023-08-24 05:34:06,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:06,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:06,623 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 05:34:06,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:06,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996176062] [2023-08-24 05:34:06,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996176062] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:06,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:06,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:34:06,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806045525] [2023-08-24 05:34:06,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:06,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:34:06,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:06,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:34:06,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:34:06,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 198 [2023-08-24 05:34:06,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 461 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:06,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:06,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 198 [2023-08-24 05:34:06,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:06,977 INFO L124 PetriNetUnfolderBase]: 1473/2283 cut-off events. [2023-08-24 05:34:06,978 INFO L125 PetriNetUnfolderBase]: For 8518/8553 co-relation queries the response was YES. [2023-08-24 05:34:06,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10243 conditions, 2283 events. 1473/2283 cut-off events. For 8518/8553 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11010 event pairs, 604 based on Foata normal form. 85/2319 useless extension candidates. Maximal degree in co-relation 10212. Up to 1088 conditions per place. [2023-08-24 05:34:06,997 INFO L140 encePairwiseOnDemand]: 194/198 looper letters, 47 selfloop transitions, 4 changer transitions 23/78 dead transitions. [2023-08-24 05:34:06,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 776 flow [2023-08-24 05:34:06,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:34:06,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:34:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-08-24 05:34:07,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4919191919191919 [2023-08-24 05:34:07,000 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-08-24 05:34:07,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-08-24 05:34:07,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:07,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-08-24 05:34:07,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:07,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:07,003 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:07,003 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 461 flow. Second operand 5 states and 487 transitions. [2023-08-24 05:34:07,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 776 flow [2023-08-24 05:34:07,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 723 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-24 05:34:07,024 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 320 flow [2023-08-24 05:34:07,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2023-08-24 05:34:07,029 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2023-08-24 05:34:07,029 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 320 flow [2023-08-24 05:34:07,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:07,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:07,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:07,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:34:07,031 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:07,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:07,031 INFO L85 PathProgramCache]: Analyzing trace with hash -320624987, now seen corresponding path program 1 times [2023-08-24 05:34:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:07,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234693457] [2023-08-24 05:34:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:07,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:07,788 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 05:34:07,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:07,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234693457] [2023-08-24 05:34:07,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234693457] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:07,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:07,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 05:34:07,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629752025] [2023-08-24 05:34:07,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:07,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 05:34:07,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:07,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 05:34:07,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-24 05:34:07,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 198 [2023-08-24 05:34:07,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 320 flow. Second operand has 9 states, 9 states have (on average 83.66666666666667) internal successors, (753), 9 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:07,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:07,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 198 [2023-08-24 05:34:07,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:08,530 INFO L124 PetriNetUnfolderBase]: 1596/2542 cut-off events. [2023-08-24 05:34:08,531 INFO L125 PetriNetUnfolderBase]: For 10133/10165 co-relation queries the response was YES. [2023-08-24 05:34:08,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11349 conditions, 2542 events. 1596/2542 cut-off events. For 10133/10165 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 12938 event pairs, 213 based on Foata normal form. 150/2680 useless extension candidates. Maximal degree in co-relation 11318. Up to 1413 conditions per place. [2023-08-24 05:34:08,544 INFO L140 encePairwiseOnDemand]: 189/198 looper letters, 70 selfloop transitions, 19 changer transitions 46/137 dead transitions. [2023-08-24 05:34:08,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 137 transitions, 1319 flow [2023-08-24 05:34:08,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 05:34:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 05:34:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1090 transitions. [2023-08-24 05:34:08,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45875420875420875 [2023-08-24 05:34:08,547 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1090 transitions. [2023-08-24 05:34:08,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1090 transitions. [2023-08-24 05:34:08,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:08,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1090 transitions. [2023-08-24 05:34:08,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 90.83333333333333) internal successors, (1090), 12 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:08,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 198.0) internal successors, (2574), 13 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:08,555 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 198.0) internal successors, (2574), 13 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:08,555 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 320 flow. Second operand 12 states and 1090 transitions. [2023-08-24 05:34:08,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 137 transitions, 1319 flow [2023-08-24 05:34:08,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 137 transitions, 1160 flow, removed 8 selfloop flow, removed 8 redundant places. [2023-08-24 05:34:08,578 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 485 flow [2023-08-24 05:34:08,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=485, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2023-08-24 05:34:08,579 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2023-08-24 05:34:08,579 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 485 flow [2023-08-24 05:34:08,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.66666666666667) internal successors, (753), 9 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:08,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:08,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:08,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:34:08,580 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:08,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:08,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1926253351, now seen corresponding path program 2 times [2023-08-24 05:34:08,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:08,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538751549] [2023-08-24 05:34:08,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:08,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:09,724 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 05:34:09,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:09,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538751549] [2023-08-24 05:34:09,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538751549] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:09,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:09,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 05:34:09,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38782134] [2023-08-24 05:34:09,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:09,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 05:34:09,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:09,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 05:34:09,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-08-24 05:34:09,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-08-24 05:34:09,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 485 flow. Second operand has 9 states, 9 states have (on average 78.66666666666667) internal successors, (708), 9 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:09,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:09,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-08-24 05:34:09,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:10,422 INFO L124 PetriNetUnfolderBase]: 1548/2487 cut-off events. [2023-08-24 05:34:10,422 INFO L125 PetriNetUnfolderBase]: For 13110/13110 co-relation queries the response was YES. [2023-08-24 05:34:10,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11674 conditions, 2487 events. 1548/2487 cut-off events. For 13110/13110 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12522 event pairs, 600 based on Foata normal form. 52/2539 useless extension candidates. Maximal degree in co-relation 11639. Up to 1915 conditions per place. [2023-08-24 05:34:10,433 INFO L140 encePairwiseOnDemand]: 185/198 looper letters, 61 selfloop transitions, 26 changer transitions 19/106 dead transitions. [2023-08-24 05:34:10,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 106 transitions, 1057 flow [2023-08-24 05:34:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:34:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:34:10,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 776 transitions. [2023-08-24 05:34:10,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43546576879910215 [2023-08-24 05:34:10,437 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 776 transitions. [2023-08-24 05:34:10,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 776 transitions. [2023-08-24 05:34:10,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:10,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 776 transitions. [2023-08-24 05:34:10,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 86.22222222222223) internal successors, (776), 9 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:10,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:10,442 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:10,442 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 485 flow. Second operand 9 states and 776 transitions. [2023-08-24 05:34:10,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 106 transitions, 1057 flow [2023-08-24 05:34:10,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 1001 flow, removed 25 selfloop flow, removed 6 redundant places. [2023-08-24 05:34:10,459 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 635 flow [2023-08-24 05:34:10,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=635, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2023-08-24 05:34:10,461 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2023-08-24 05:34:10,461 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 635 flow [2023-08-24 05:34:10,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 78.66666666666667) internal successors, (708), 9 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:10,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:10,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:10,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:34:10,462 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:10,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:10,462 INFO L85 PathProgramCache]: Analyzing trace with hash 59985457, now seen corresponding path program 3 times [2023-08-24 05:34:10,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:10,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250616569] [2023-08-24 05:34:10,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:11,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 05:34:11,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:11,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250616569] [2023-08-24 05:34:11,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250616569] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:11,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:11,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:34:11,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045177843] [2023-08-24 05:34:11,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:11,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:34:11,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:11,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:34:11,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:34:11,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 198 [2023-08-24 05:34:11,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 59 transitions, 635 flow. Second operand has 8 states, 8 states have (on average 83.875) internal successors, (671), 8 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:11,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 198 [2023-08-24 05:34:11,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:11,574 INFO L124 PetriNetUnfolderBase]: 1349/2233 cut-off events. [2023-08-24 05:34:11,575 INFO L125 PetriNetUnfolderBase]: For 13434/13492 co-relation queries the response was YES. [2023-08-24 05:34:11,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11540 conditions, 2233 events. 1349/2233 cut-off events. For 13434/13492 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11646 event pairs, 522 based on Foata normal form. 101/2328 useless extension candidates. Maximal degree in co-relation 11505. Up to 1809 conditions per place. [2023-08-24 05:34:11,586 INFO L140 encePairwiseOnDemand]: 189/198 looper letters, 68 selfloop transitions, 18 changer transitions 21/110 dead transitions. [2023-08-24 05:34:11,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 110 transitions, 1281 flow [2023-08-24 05:34:11,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:34:11,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:34:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 728 transitions. [2023-08-24 05:34:11,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595959595959596 [2023-08-24 05:34:11,589 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 728 transitions. [2023-08-24 05:34:11,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 728 transitions. [2023-08-24 05:34:11,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:11,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 728 transitions. [2023-08-24 05:34:11,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,593 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,593 INFO L175 Difference]: Start difference. First operand has 72 places, 59 transitions, 635 flow. Second operand 8 states and 728 transitions. [2023-08-24 05:34:11,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 110 transitions, 1281 flow [2023-08-24 05:34:11,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 110 transitions, 1233 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-24 05:34:11,615 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 726 flow [2023-08-24 05:34:11,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=726, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2023-08-24 05:34:11,616 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 42 predicate places. [2023-08-24 05:34:11,616 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 726 flow [2023-08-24 05:34:11,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 83.875) internal successors, (671), 8 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:11,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:11,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:34:11,617 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:11,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:11,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2073026587, now seen corresponding path program 1 times [2023-08-24 05:34:11,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:11,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882403966] [2023-08-24 05:34:11,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:11,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:12,707 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 05:34:12,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:12,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882403966] [2023-08-24 05:34:12,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882403966] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:12,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:12,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 05:34:12,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464972184] [2023-08-24 05:34:12,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:12,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 05:34:12,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:12,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 05:34:12,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-24 05:34:12,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-08-24 05:34:12,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 726 flow. Second operand has 10 states, 10 states have (on average 78.6) internal successors, (786), 10 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:12,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:12,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-08-24 05:34:12,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:13,386 INFO L124 PetriNetUnfolderBase]: 1827/3095 cut-off events. [2023-08-24 05:34:13,386 INFO L125 PetriNetUnfolderBase]: For 20439/20522 co-relation queries the response was YES. [2023-08-24 05:34:13,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16219 conditions, 3095 events. 1827/3095 cut-off events. For 20439/20522 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 18455 event pairs, 356 based on Foata normal form. 123/3208 useless extension candidates. Maximal degree in co-relation 16181. Up to 1554 conditions per place. [2023-08-24 05:34:13,404 INFO L140 encePairwiseOnDemand]: 190/198 looper letters, 74 selfloop transitions, 21 changer transitions 16/114 dead transitions. [2023-08-24 05:34:13,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 114 transitions, 1425 flow [2023-08-24 05:34:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:34:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:34:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 604 transitions. [2023-08-24 05:34:13,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357864357864358 [2023-08-24 05:34:13,409 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 604 transitions. [2023-08-24 05:34:13,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 604 transitions. [2023-08-24 05:34:13,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:13,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 604 transitions. [2023-08-24 05:34:13,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:13,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:13,413 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:13,413 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 726 flow. Second operand 7 states and 604 transitions. [2023-08-24 05:34:13,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 114 transitions, 1425 flow [2023-08-24 05:34:13,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 114 transitions, 1392 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-24 05:34:13,444 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 890 flow [2023-08-24 05:34:13,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=890, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2023-08-24 05:34:13,445 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 46 predicate places. [2023-08-24 05:34:13,445 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 890 flow [2023-08-24 05:34:13,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 78.6) internal successors, (786), 10 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:13,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:13,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:13,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:34:13,445 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:13,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash -981457993, now seen corresponding path program 2 times [2023-08-24 05:34:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:13,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435459996] [2023-08-24 05:34:13,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:13,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:14,655 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 05:34:14,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:14,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435459996] [2023-08-24 05:34:14,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435459996] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:14,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:14,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 05:34:14,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474979284] [2023-08-24 05:34:14,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:14,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 05:34:14,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:14,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 05:34:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-24 05:34:14,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 198 [2023-08-24 05:34:14,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 890 flow. Second operand has 10 states, 10 states have (on average 77.6) internal successors, (776), 10 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:14,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:14,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 198 [2023-08-24 05:34:14,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:15,380 INFO L124 PetriNetUnfolderBase]: 1933/3336 cut-off events. [2023-08-24 05:34:15,380 INFO L125 PetriNetUnfolderBase]: For 26563/26652 co-relation queries the response was YES. [2023-08-24 05:34:15,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17977 conditions, 3336 events. 1933/3336 cut-off events. For 26563/26652 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 20663 event pairs, 450 based on Foata normal form. 145/3470 useless extension candidates. Maximal degree in co-relation 17937. Up to 2269 conditions per place. [2023-08-24 05:34:15,394 INFO L140 encePairwiseOnDemand]: 189/198 looper letters, 87 selfloop transitions, 34 changer transitions 32/156 dead transitions. [2023-08-24 05:34:15,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 156 transitions, 2058 flow [2023-08-24 05:34:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 05:34:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 05:34:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 927 transitions. [2023-08-24 05:34:15,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4256198347107438 [2023-08-24 05:34:15,397 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 927 transitions. [2023-08-24 05:34:15,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 927 transitions. [2023-08-24 05:34:15,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:15,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 927 transitions. [2023-08-24 05:34:15,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 84.27272727272727) internal successors, (927), 11 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:15,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:15,403 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:15,403 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 890 flow. Second operand 11 states and 927 transitions. [2023-08-24 05:34:15,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 156 transitions, 2058 flow [2023-08-24 05:34:15,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 156 transitions, 2030 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-24 05:34:15,433 INFO L231 Difference]: Finished difference. Result has 93 places, 88 transitions, 1289 flow [2023-08-24 05:34:15,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1289, PETRI_PLACES=93, PETRI_TRANSITIONS=88} [2023-08-24 05:34:15,433 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2023-08-24 05:34:15,433 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 88 transitions, 1289 flow [2023-08-24 05:34:15,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.6) internal successors, (776), 10 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:15,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:15,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:15,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:34:15,434 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:15,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:15,435 INFO L85 PathProgramCache]: Analyzing trace with hash -54076469, now seen corresponding path program 3 times [2023-08-24 05:34:15,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:15,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412508697] [2023-08-24 05:34:15,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:15,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:16,536 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 05:34:16,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:16,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412508697] [2023-08-24 05:34:16,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412508697] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:16,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:16,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 05:34:16,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147626059] [2023-08-24 05:34:16,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:16,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 05:34:16,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:16,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 05:34:16,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-08-24 05:34:16,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 198 [2023-08-24 05:34:16,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 88 transitions, 1289 flow. Second operand has 10 states, 10 states have (on average 77.6) internal successors, (776), 10 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:16,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:16,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 198 [2023-08-24 05:34:16,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:17,204 INFO L124 PetriNetUnfolderBase]: 1794/3165 cut-off events. [2023-08-24 05:34:17,204 INFO L125 PetriNetUnfolderBase]: For 34285/34367 co-relation queries the response was YES. [2023-08-24 05:34:17,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18850 conditions, 3165 events. 1794/3165 cut-off events. For 34285/34367 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 19866 event pairs, 747 based on Foata normal form. 104/3254 useless extension candidates. Maximal degree in co-relation 18805. Up to 2711 conditions per place. [2023-08-24 05:34:17,219 INFO L140 encePairwiseOnDemand]: 189/198 looper letters, 101 selfloop transitions, 18 changer transitions 20/142 dead transitions. [2023-08-24 05:34:17,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 142 transitions, 2104 flow [2023-08-24 05:34:17,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 05:34:17,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 05:34:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 841 transitions. [2023-08-24 05:34:17,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42474747474747476 [2023-08-24 05:34:17,230 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 841 transitions. [2023-08-24 05:34:17,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 841 transitions. [2023-08-24 05:34:17,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:17,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 841 transitions. [2023-08-24 05:34:17,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 84.1) internal successors, (841), 10 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:17,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:17,238 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:17,239 INFO L175 Difference]: Start difference. First operand has 93 places, 88 transitions, 1289 flow. Second operand 10 states and 841 transitions. [2023-08-24 05:34:17,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 142 transitions, 2104 flow [2023-08-24 05:34:17,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 142 transitions, 2059 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-08-24 05:34:17,292 INFO L231 Difference]: Finished difference. Result has 97 places, 90 transitions, 1352 flow [2023-08-24 05:34:17,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1352, PETRI_PLACES=97, PETRI_TRANSITIONS=90} [2023-08-24 05:34:17,293 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 62 predicate places. [2023-08-24 05:34:17,293 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 90 transitions, 1352 flow [2023-08-24 05:34:17,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.6) internal successors, (776), 10 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:17,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:17,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:17,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:34:17,294 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:17,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:17,295 INFO L85 PathProgramCache]: Analyzing trace with hash -449330100, now seen corresponding path program 1 times [2023-08-24 05:34:17,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:17,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430089451] [2023-08-24 05:34:17,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:17,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:18,729 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 05:34:18,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:18,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430089451] [2023-08-24 05:34:18,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430089451] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:18,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:18,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 05:34:18,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947543512] [2023-08-24 05:34:18,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:18,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 05:34:18,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:18,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 05:34:18,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-24 05:34:18,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 198 [2023-08-24 05:34:18,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 90 transitions, 1352 flow. Second operand has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:18,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:18,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 198 [2023-08-24 05:34:18,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:19,576 INFO L124 PetriNetUnfolderBase]: 1866/3318 cut-off events. [2023-08-24 05:34:19,576 INFO L125 PetriNetUnfolderBase]: For 40064/40153 co-relation queries the response was YES. [2023-08-24 05:34:19,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20113 conditions, 3318 events. 1866/3318 cut-off events. For 40064/40153 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 21292 event pairs, 819 based on Foata normal form. 115/3424 useless extension candidates. Maximal degree in co-relation 20067. Up to 2668 conditions per place. [2023-08-24 05:34:19,595 INFO L140 encePairwiseOnDemand]: 187/198 looper letters, 108 selfloop transitions, 39 changer transitions 25/175 dead transitions. [2023-08-24 05:34:19,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 175 transitions, 2610 flow [2023-08-24 05:34:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 05:34:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 05:34:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 973 transitions. [2023-08-24 05:34:19,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44674012855831036 [2023-08-24 05:34:19,598 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 973 transitions. [2023-08-24 05:34:19,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 973 transitions. [2023-08-24 05:34:19,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:19,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 973 transitions. [2023-08-24 05:34:19,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.45454545454545) internal successors, (973), 11 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:19,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:19,604 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:19,604 INFO L175 Difference]: Start difference. First operand has 97 places, 90 transitions, 1352 flow. Second operand 11 states and 973 transitions. [2023-08-24 05:34:19,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 175 transitions, 2610 flow [2023-08-24 05:34:19,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 175 transitions, 2543 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-08-24 05:34:19,664 INFO L231 Difference]: Finished difference. Result has 104 places, 112 transitions, 1757 flow [2023-08-24 05:34:19,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1757, PETRI_PLACES=104, PETRI_TRANSITIONS=112} [2023-08-24 05:34:19,665 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2023-08-24 05:34:19,665 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 112 transitions, 1757 flow [2023-08-24 05:34:19,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:19,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:19,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:19,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 05:34:19,666 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:19,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:19,666 INFO L85 PathProgramCache]: Analyzing trace with hash 327332153, now seen corresponding path program 4 times [2023-08-24 05:34:19,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:19,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822295341] [2023-08-24 05:34:19,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:20,336 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 05:34:20,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:20,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822295341] [2023-08-24 05:34:20,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822295341] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:20,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:20,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 05:34:20,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303834106] [2023-08-24 05:34:20,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:20,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 05:34:20,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:20,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 05:34:20,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-24 05:34:20,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 198 [2023-08-24 05:34:20,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 112 transitions, 1757 flow. Second operand has 10 states, 10 states have (on average 81.6) internal successors, (816), 10 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:20,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:20,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 198 [2023-08-24 05:34:20,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:20,937 INFO L124 PetriNetUnfolderBase]: 1762/3152 cut-off events. [2023-08-24 05:34:20,937 INFO L125 PetriNetUnfolderBase]: For 39056/39141 co-relation queries the response was YES. [2023-08-24 05:34:20,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19291 conditions, 3152 events. 1762/3152 cut-off events. For 39056/39141 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 20066 event pairs, 769 based on Foata normal form. 107/3250 useless extension candidates. Maximal degree in co-relation 19242. Up to 2632 conditions per place. [2023-08-24 05:34:20,950 INFO L140 encePairwiseOnDemand]: 189/198 looper letters, 113 selfloop transitions, 27 changer transitions 19/162 dead transitions. [2023-08-24 05:34:20,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 162 transitions, 2695 flow [2023-08-24 05:34:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:34:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:34:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 710 transitions. [2023-08-24 05:34:20,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44823232323232326 [2023-08-24 05:34:20,952 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 710 transitions. [2023-08-24 05:34:20,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 710 transitions. [2023-08-24 05:34:20,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:20,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 710 transitions. [2023-08-24 05:34:20,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:20,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:20,957 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:20,957 INFO L175 Difference]: Start difference. First operand has 104 places, 112 transitions, 1757 flow. Second operand 8 states and 710 transitions. [2023-08-24 05:34:20,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 162 transitions, 2695 flow [2023-08-24 05:34:21,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 162 transitions, 2569 flow, removed 63 selfloop flow, removed 2 redundant places. [2023-08-24 05:34:21,020 INFO L231 Difference]: Finished difference. Result has 110 places, 117 transitions, 1862 flow [2023-08-24 05:34:21,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1862, PETRI_PLACES=110, PETRI_TRANSITIONS=117} [2023-08-24 05:34:21,020 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 75 predicate places. [2023-08-24 05:34:21,021 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 117 transitions, 1862 flow [2023-08-24 05:34:21,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.6) internal successors, (816), 10 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:21,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:21,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:21,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 05:34:21,021 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:21,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash -458249790, now seen corresponding path program 2 times [2023-08-24 05:34:21,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:21,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666479651] [2023-08-24 05:34:21,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:21,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:22,434 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 05:34:22,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:22,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666479651] [2023-08-24 05:34:22,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666479651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:22,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:22,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 05:34:22,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196664953] [2023-08-24 05:34:22,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:22,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 05:34:22,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:22,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 05:34:22,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-24 05:34:22,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 198 [2023-08-24 05:34:22,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 117 transitions, 1862 flow. Second operand has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:22,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:22,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 198 [2023-08-24 05:34:22,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:23,414 INFO L124 PetriNetUnfolderBase]: 1783/3251 cut-off events. [2023-08-24 05:34:23,414 INFO L125 PetriNetUnfolderBase]: For 43676/43768 co-relation queries the response was YES. [2023-08-24 05:34:23,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20125 conditions, 3251 events. 1783/3251 cut-off events. For 43676/43768 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 21362 event pairs, 829 based on Foata normal form. 118/3366 useless extension candidates. Maximal degree in co-relation 20073. Up to 2541 conditions per place. [2023-08-24 05:34:23,427 INFO L140 encePairwiseOnDemand]: 187/198 looper letters, 104 selfloop transitions, 44 changer transitions 40/191 dead transitions. [2023-08-24 05:34:23,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 191 transitions, 3191 flow [2023-08-24 05:34:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 05:34:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 05:34:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 886 transitions. [2023-08-24 05:34:23,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44747474747474747 [2023-08-24 05:34:23,429 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 886 transitions. [2023-08-24 05:34:23,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 886 transitions. [2023-08-24 05:34:23,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:23,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 886 transitions. [2023-08-24 05:34:23,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 88.6) internal successors, (886), 10 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:23,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:23,434 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:23,434 INFO L175 Difference]: Start difference. First operand has 110 places, 117 transitions, 1862 flow. Second operand 10 states and 886 transitions. [2023-08-24 05:34:23,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 191 transitions, 3191 flow [2023-08-24 05:34:23,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 191 transitions, 3129 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-08-24 05:34:23,505 INFO L231 Difference]: Finished difference. Result has 119 places, 123 transitions, 2151 flow [2023-08-24 05:34:23,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2151, PETRI_PLACES=119, PETRI_TRANSITIONS=123} [2023-08-24 05:34:23,506 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 84 predicate places. [2023-08-24 05:34:23,506 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 123 transitions, 2151 flow [2023-08-24 05:34:23,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:23,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:23,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:23,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 05:34:23,506 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:23,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:23,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1630073363, now seen corresponding path program 5 times [2023-08-24 05:34:23,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:23,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944023292] [2023-08-24 05:34:23,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:23,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:24,318 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 05:34:24,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:24,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944023292] [2023-08-24 05:34:24,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944023292] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:24,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:24,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 05:34:24,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490893638] [2023-08-24 05:34:24,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:24,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 05:34:24,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:24,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 05:34:24,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-08-24 05:34:24,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 198 [2023-08-24 05:34:24,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 123 transitions, 2151 flow. Second operand has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:24,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:24,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 198 [2023-08-24 05:34:24,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:24,868 INFO L124 PetriNetUnfolderBase]: 1548/2809 cut-off events. [2023-08-24 05:34:24,868 INFO L125 PetriNetUnfolderBase]: For 37668/37727 co-relation queries the response was YES. [2023-08-24 05:34:24,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17563 conditions, 2809 events. 1548/2809 cut-off events. For 37668/37727 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 17772 event pairs, 778 based on Foata normal form. 93/2895 useless extension candidates. Maximal degree in co-relation 17507. Up to 1710 conditions per place. [2023-08-24 05:34:24,881 INFO L140 encePairwiseOnDemand]: 192/198 looper letters, 62 selfloop transitions, 25 changer transitions 74/163 dead transitions. [2023-08-24 05:34:24,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 163 transitions, 2894 flow [2023-08-24 05:34:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:34:24,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:34:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 618 transitions. [2023-08-24 05:34:24,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4458874458874459 [2023-08-24 05:34:24,883 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 618 transitions. [2023-08-24 05:34:24,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 618 transitions. [2023-08-24 05:34:24,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:24,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 618 transitions. [2023-08-24 05:34:24,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:24,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:24,896 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:24,897 INFO L175 Difference]: Start difference. First operand has 119 places, 123 transitions, 2151 flow. Second operand 7 states and 618 transitions. [2023-08-24 05:34:24,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 163 transitions, 2894 flow [2023-08-24 05:34:24,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 163 transitions, 2799 flow, removed 31 selfloop flow, removed 7 redundant places. [2023-08-24 05:34:24,959 INFO L231 Difference]: Finished difference. Result has 119 places, 72 transitions, 1248 flow [2023-08-24 05:34:24,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2066, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1248, PETRI_PLACES=119, PETRI_TRANSITIONS=72} [2023-08-24 05:34:24,959 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 84 predicate places. [2023-08-24 05:34:24,959 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 72 transitions, 1248 flow [2023-08-24 05:34:24,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:24,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:24,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:24,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 05:34:24,961 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:24,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:24,961 INFO L85 PathProgramCache]: Analyzing trace with hash -272155952, now seen corresponding path program 1 times [2023-08-24 05:34:24,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:24,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206221350] [2023-08-24 05:34:24,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:24,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:25,057 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 05:34:25,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:25,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206221350] [2023-08-24 05:34:25,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206221350] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:25,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:25,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:34:25,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184760315] [2023-08-24 05:34:25,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:25,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:34:25,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:25,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:34:25,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:34:25,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 198 [2023-08-24 05:34:25,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 72 transitions, 1248 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 05:34:25,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:25,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 198 [2023-08-24 05:34:25,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:25,221 INFO L124 PetriNetUnfolderBase]: 624/1143 cut-off events. [2023-08-24 05:34:25,222 INFO L125 PetriNetUnfolderBase]: For 16662/16702 co-relation queries the response was YES. [2023-08-24 05:34:25,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7012 conditions, 1143 events. 624/1143 cut-off events. For 16662/16702 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6188 event pairs, 148 based on Foata normal form. 62/1202 useless extension candidates. Maximal degree in co-relation 6970. Up to 1017 conditions per place. [2023-08-24 05:34:25,225 INFO L140 encePairwiseOnDemand]: 193/198 looper letters, 73 selfloop transitions, 4 changer transitions 1/82 dead transitions. [2023-08-24 05:34:25,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 82 transitions, 1449 flow [2023-08-24 05:34:25,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:34:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:34:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-08-24 05:34:25,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49663299663299665 [2023-08-24 05:34:25,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-08-24 05:34:25,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-08-24 05:34:25,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:25,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-08-24 05:34:25,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 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 05:34:25,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:25,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:25,228 INFO L175 Difference]: Start difference. First operand has 119 places, 72 transitions, 1248 flow. Second operand 3 states and 295 transitions. [2023-08-24 05:34:25,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 82 transitions, 1449 flow [2023-08-24 05:34:25,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 82 transitions, 1230 flow, removed 38 selfloop flow, removed 29 redundant places. [2023-08-24 05:34:25,240 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 775 flow [2023-08-24 05:34:25,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2023-08-24 05:34:25,240 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 38 predicate places. [2023-08-24 05:34:25,240 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 775 flow [2023-08-24 05:34:25,241 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 05:34:25,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:25,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:25,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-24 05:34:25,241 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:25,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1463852278, now seen corresponding path program 1 times [2023-08-24 05:34:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:25,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743626307] [2023-08-24 05:34:25,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:25,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:25,369 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 05:34:25,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:25,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743626307] [2023-08-24 05:34:25,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743626307] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:25,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:25,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:34:25,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468499133] [2023-08-24 05:34:25,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:25,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:34:25,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:25,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:34:25,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:34:25,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 198 [2023-08-24 05:34:25,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 775 flow. Second operand has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:25,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:25,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 198 [2023-08-24 05:34:25,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:25,496 INFO L124 PetriNetUnfolderBase]: 290/593 cut-off events. [2023-08-24 05:34:25,496 INFO L125 PetriNetUnfolderBase]: For 5488/5499 co-relation queries the response was YES. [2023-08-24 05:34:25,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3511 conditions, 593 events. 290/593 cut-off events. For 5488/5499 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2907 event pairs, 39 based on Foata normal form. 78/668 useless extension candidates. Maximal degree in co-relation 3482. Up to 290 conditions per place. [2023-08-24 05:34:25,498 INFO L140 encePairwiseOnDemand]: 193/198 looper letters, 75 selfloop transitions, 7 changer transitions 8/94 dead transitions. [2023-08-24 05:34:25,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 94 transitions, 1377 flow [2023-08-24 05:34:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:34:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:34:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2023-08-24 05:34:25,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962121212121212 [2023-08-24 05:34:25,501 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2023-08-24 05:34:25,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2023-08-24 05:34:25,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:25,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2023-08-24 05:34:25,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:25,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:25,504 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:25,504 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 775 flow. Second operand 4 states and 393 transitions. [2023-08-24 05:34:25,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 94 transitions, 1377 flow [2023-08-24 05:34:25,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 1369 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-24 05:34:25,512 INFO L231 Difference]: Finished difference. Result has 76 places, 55 transitions, 692 flow [2023-08-24 05:34:25,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=692, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2023-08-24 05:34:25,512 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 41 predicate places. [2023-08-24 05:34:25,512 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 692 flow [2023-08-24 05:34:25,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:25,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:25,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:25,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-24 05:34:25,513 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:25,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:25,513 INFO L85 PathProgramCache]: Analyzing trace with hash 406376295, now seen corresponding path program 1 times [2023-08-24 05:34:25,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:25,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751380219] [2023-08-24 05:34:25,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:25,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:26,025 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 05:34:26,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:26,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751380219] [2023-08-24 05:34:26,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751380219] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:26,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:26,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 05:34:26,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075095755] [2023-08-24 05:34:26,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:26,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:34:26,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:26,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:34:26,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:34:26,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 198 [2023-08-24 05:34:26,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 692 flow. Second operand has 8 states, 8 states have (on average 78.5) internal successors, (628), 8 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:26,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:26,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 198 [2023-08-24 05:34:26,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:26,290 INFO L124 PetriNetUnfolderBase]: 388/798 cut-off events. [2023-08-24 05:34:26,290 INFO L125 PetriNetUnfolderBase]: For 6985/6985 co-relation queries the response was YES. [2023-08-24 05:34:26,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5046 conditions, 798 events. 388/798 cut-off events. For 6985/6985 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4085 event pairs, 100 based on Foata normal form. 5/803 useless extension candidates. Maximal degree in co-relation 5016. Up to 374 conditions per place. [2023-08-24 05:34:26,293 INFO L140 encePairwiseOnDemand]: 189/198 looper letters, 51 selfloop transitions, 10 changer transitions 33/94 dead transitions. [2023-08-24 05:34:26,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 94 transitions, 1268 flow [2023-08-24 05:34:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:34:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:34:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 589 transitions. [2023-08-24 05:34:26,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.424963924963925 [2023-08-24 05:34:26,295 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 589 transitions. [2023-08-24 05:34:26,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 589 transitions. [2023-08-24 05:34:26,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:26,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 589 transitions. [2023-08-24 05:34:26,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 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 05:34:26,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:26,298 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:26,299 INFO L175 Difference]: Start difference. First operand has 76 places, 55 transitions, 692 flow. Second operand 7 states and 589 transitions. [2023-08-24 05:34:26,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 94 transitions, 1268 flow [2023-08-24 05:34:26,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 94 transitions, 1241 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-24 05:34:26,310 INFO L231 Difference]: Finished difference. Result has 83 places, 50 transitions, 651 flow [2023-08-24 05:34:26,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=651, PETRI_PLACES=83, PETRI_TRANSITIONS=50} [2023-08-24 05:34:26,311 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2023-08-24 05:34:26,311 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 50 transitions, 651 flow [2023-08-24 05:34:26,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 78.5) internal successors, (628), 8 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:26,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:26,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:26,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-24 05:34:26,312 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:26,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash 499402769, now seen corresponding path program 2 times [2023-08-24 05:34:26,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:26,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108099686] [2023-08-24 05:34:26,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:26,467 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 05:34:26,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:26,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108099686] [2023-08-24 05:34:26,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108099686] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:26,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:26,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:34:26,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443886317] [2023-08-24 05:34:26,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:26,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:34:26,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:26,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:34:26,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:34:26,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 198 [2023-08-24 05:34:26,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 50 transitions, 651 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:26,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:26,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 198 [2023-08-24 05:34:26,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:26,571 INFO L124 PetriNetUnfolderBase]: 151/323 cut-off events. [2023-08-24 05:34:26,571 INFO L125 PetriNetUnfolderBase]: For 3453/3457 co-relation queries the response was YES. [2023-08-24 05:34:26,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2020 conditions, 323 events. 151/323 cut-off events. For 3453/3457 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1357 event pairs, 20 based on Foata normal form. 30/351 useless extension candidates. Maximal degree in co-relation 1987. Up to 128 conditions per place. [2023-08-24 05:34:26,573 INFO L140 encePairwiseOnDemand]: 193/198 looper letters, 62 selfloop transitions, 10 changer transitions 5/80 dead transitions. [2023-08-24 05:34:26,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 80 transitions, 1231 flow [2023-08-24 05:34:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:34:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:34:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2023-08-24 05:34:26,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48383838383838385 [2023-08-24 05:34:26,577 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 479 transitions. [2023-08-24 05:34:26,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 479 transitions. [2023-08-24 05:34:26,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:26,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 479 transitions. [2023-08-24 05:34:26,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:26,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:26,581 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:26,581 INFO L175 Difference]: Start difference. First operand has 83 places, 50 transitions, 651 flow. Second operand 5 states and 479 transitions. [2023-08-24 05:34:26,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 80 transitions, 1231 flow [2023-08-24 05:34:26,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 80 transitions, 1021 flow, removed 63 selfloop flow, removed 13 redundant places. [2023-08-24 05:34:26,587 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 501 flow [2023-08-24 05:34:26,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=501, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2023-08-24 05:34:26,589 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 39 predicate places. [2023-08-24 05:34:26,589 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 501 flow [2023-08-24 05:34:26,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:26,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:26,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:26,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-24 05:34:26,590 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:26,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:26,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1519914854, now seen corresponding path program 1 times [2023-08-24 05:34:26,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:26,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221538279] [2023-08-24 05:34:26,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:26,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:27,678 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 05:34:27,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:27,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221538279] [2023-08-24 05:34:27,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221538279] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:27,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:27,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 05:34:27,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669859044] [2023-08-24 05:34:27,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:27,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 05:34:27,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:27,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 05:34:27,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-24 05:34:27,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 198 [2023-08-24 05:34:27,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 501 flow. Second operand has 10 states, 10 states have (on average 79.1) internal successors, (791), 10 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:27,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:27,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 198 [2023-08-24 05:34:27,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:27,926 INFO L124 PetriNetUnfolderBase]: 159/340 cut-off events. [2023-08-24 05:34:27,926 INFO L125 PetriNetUnfolderBase]: For 2305/2305 co-relation queries the response was YES. [2023-08-24 05:34:27,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1983 conditions, 340 events. 159/340 cut-off events. For 2305/2305 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1324 event pairs, 32 based on Foata normal form. 1/341 useless extension candidates. Maximal degree in co-relation 1957. Up to 234 conditions per place. [2023-08-24 05:34:27,927 INFO L140 encePairwiseOnDemand]: 191/198 looper letters, 37 selfloop transitions, 8 changer transitions 22/68 dead transitions. [2023-08-24 05:34:27,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 68 transitions, 757 flow [2023-08-24 05:34:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:34:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:34:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 503 transitions. [2023-08-24 05:34:27,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4234006734006734 [2023-08-24 05:34:27,928 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 503 transitions. [2023-08-24 05:34:27,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 503 transitions. [2023-08-24 05:34:27,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:27,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 503 transitions. [2023-08-24 05:34:27,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 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 05:34:27,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:27,930 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:27,930 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 501 flow. Second operand 6 states and 503 transitions. [2023-08-24 05:34:27,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 68 transitions, 757 flow [2023-08-24 05:34:27,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 68 transitions, 656 flow, removed 29 selfloop flow, removed 6 redundant places. [2023-08-24 05:34:27,934 INFO L231 Difference]: Finished difference. Result has 75 places, 38 transitions, 343 flow [2023-08-24 05:34:27,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=343, PETRI_PLACES=75, PETRI_TRANSITIONS=38} [2023-08-24 05:34:27,935 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 40 predicate places. [2023-08-24 05:34:27,935 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 38 transitions, 343 flow [2023-08-24 05:34:27,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 79.1) internal successors, (791), 10 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:27,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:27,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:27,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-24 05:34:27,935 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:27,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash -835412108, now seen corresponding path program 2 times [2023-08-24 05:34:27,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:27,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603871846] [2023-08-24 05:34:27,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:27,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:34:27,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:34:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:34:28,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:34:28,066 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:34:28,067 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 05:34:28,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-24 05:34:28,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-24 05:34:28,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-24 05:34:28,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-24 05:34:28,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 05:34:28,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-24 05:34:28,069 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:28,073 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:34:28,073 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:34:28,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:34:28 BasicIcfg [2023-08-24 05:34:28,121 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:34:28,122 INFO L158 Benchmark]: Toolchain (without parser) took 35170.26ms. Allocated memory was 333.4MB in the beginning and 1.1GB in the end (delta: 755.0MB). Free memory was 307.2MB in the beginning and 747.7MB in the end (delta: -440.5MB). Peak memory consumption was 318.0MB. Max. memory is 16.0GB. [2023-08-24 05:34:28,122 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 333.4MB. Free memory was 311.4MB in the beginning and 311.3MB in the end (delta: 119.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:34:28,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.72ms. Allocated memory is still 333.4MB. Free memory was 307.2MB in the beginning and 281.3MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-24 05:34:28,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.04ms. Allocated memory is still 333.4MB. Free memory was 281.3MB in the beginning and 278.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 05:34:28,123 INFO L158 Benchmark]: Boogie Preprocessor took 29.48ms. Allocated memory is still 333.4MB. Free memory was 278.1MB in the beginning and 276.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:34:28,123 INFO L158 Benchmark]: RCFGBuilder took 803.22ms. Allocated memory was 333.4MB in the beginning and 436.2MB in the end (delta: 102.8MB). Free memory was 276.0MB in the beginning and 403.9MB in the end (delta: -127.8MB). Peak memory consumption was 53.6MB. Max. memory is 16.0GB. [2023-08-24 05:34:28,123 INFO L158 Benchmark]: TraceAbstraction took 33721.10ms. Allocated memory was 436.2MB in the beginning and 1.1GB in the end (delta: 652.2MB). Free memory was 402.8MB in the beginning and 747.7MB in the end (delta: -344.8MB). Peak memory consumption was 308.4MB. Max. memory is 16.0GB. [2023-08-24 05:34:28,124 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.15ms. Allocated memory is still 333.4MB. Free memory was 311.4MB in the beginning and 311.3MB in the end (delta: 119.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 565.72ms. Allocated memory is still 333.4MB. Free memory was 307.2MB in the beginning and 281.3MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 46.04ms. Allocated memory is still 333.4MB. Free memory was 281.3MB in the beginning and 278.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.48ms. Allocated memory is still 333.4MB. Free memory was 278.1MB in the beginning and 276.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 803.22ms. Allocated memory was 333.4MB in the beginning and 436.2MB in the end (delta: 102.8MB). Free memory was 276.0MB in the beginning and 403.9MB in the end (delta: -127.8MB). Peak memory consumption was 53.6MB. Max. memory is 16.0GB. * TraceAbstraction took 33721.10ms. Allocated memory was 436.2MB in the beginning and 1.1GB in the end (delta: 652.2MB). Free memory was 402.8MB in the beginning and 747.7MB in the end (delta: -344.8MB). Peak memory consumption was 308.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 112 PlacesBefore, 35 PlacesAfterwards, 104 TransitionsBefore, 26 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 5019 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1714, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 963, independent: 937, independent conditional: 0, independent unconditional: 937, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1714, independent: 617, independent conditional: 0, independent unconditional: 617, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 963, unknown conditional: 0, unknown unconditional: 963] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1873, ((void *)0), P0, ((void *)0))=-2, t1873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L846] 0 pthread_t t1874; [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1874, ((void *)0), P1, ((void *)0))=-1, t1873={5:0}, t1874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1875; [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1875, ((void *)0), P2, ((void *)0))=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 [L877] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 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: 33.5s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 928 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 928 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 376 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3602 IncrementalHoareTripleChecker+Invalid, 3978 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 376 mSolverCounterUnsat, 47 mSDtfsCounter, 3602 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2151occurred in iteration=16, InterpolantAutomatonStates: 161, 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.6s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 5376 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 05:34:28,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...