/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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:33:43,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:33:43,208 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:43,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:33:43,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:33:43,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:33:43,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:33:43,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:33:43,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:33:43,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:33:43,245 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:33:43,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:33:43,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:33:43,246 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:33:43,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:33:43,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:33:43,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:33:43,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:33:43,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:33:43,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:33:43,249 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:33:43,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:33:43,250 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:33:43,250 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:33:43,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:33:43,251 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:33:43,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:33:43,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:33:43,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:33:43,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:33:43,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:33:43,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:33:43,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:33:43,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:33:43,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:33:43,254 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:43,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:33:43,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:33:43,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:33:43,594 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:33:43,595 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:33:43,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-24 05:33:44,782 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:33:45,014 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:33:45,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-24 05:33:45,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b56736c/3fa6a4ea84f7436cac6665bf3c2b9f84/FLAGdf63139bc [2023-08-24 05:33:45,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b56736c/3fa6a4ea84f7436cac6665bf3c2b9f84 [2023-08-24 05:33:45,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:33:45,060 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:33:45,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:33:45,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:33:45,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:33:45,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:33:45" (1/1) ... [2023-08-24 05:33:45,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45e9f9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:45, skipping insertion in model container [2023-08-24 05:33:45,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:33:45" (1/1) ... [2023-08-24 05:33:45,120 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:33:45,294 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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-08-24 05:33:45,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:33:45,545 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:33:45,554 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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-08-24 05:33:45,561 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:33:45,562 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:33:45,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:33:45,624 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:33:45,625 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:33:45,631 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:33:45,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:45 WrapperNode [2023-08-24 05:33:45,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:33:45,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:33:45,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:33:45,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:33:45,638 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:45" (1/1) ... [2023-08-24 05:33:45,653 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:45" (1/1) ... [2023-08-24 05:33:45,682 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-24 05:33:45,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:33:45,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:33:45,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:33:45,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:33:45,692 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:45" (1/1) ... [2023-08-24 05:33:45,692 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:45" (1/1) ... [2023-08-24 05:33:45,709 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:45" (1/1) ... [2023-08-24 05:33:45,709 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:45" (1/1) ... [2023-08-24 05:33:45,720 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:45" (1/1) ... [2023-08-24 05:33:45,722 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:45" (1/1) ... [2023-08-24 05:33:45,724 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:45" (1/1) ... [2023-08-24 05:33:45,726 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:45" (1/1) ... [2023-08-24 05:33:45,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:33:45,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:33:45,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:33:45,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:33:45,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:45" (1/1) ... [2023-08-24 05:33:45,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:33:45,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:33:45,773 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:45,775 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:45,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:33:45,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:33:45,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:33:45,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:33:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:33:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:33:45,798 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:33:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:33:45,798 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:33:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:33:45,798 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:33:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:33:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:33:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:33:45,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:33:45,800 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:45,924 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:33:45,927 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:33:46,337 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:33:46,518 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:33:46,518 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:33:46,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:33:46 BoogieIcfgContainer [2023-08-24 05:33:46,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:33:46,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:33:46,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:33:46,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:33:46,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:33:45" (1/3) ... [2023-08-24 05:33:46,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254711d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:33:46, skipping insertion in model container [2023-08-24 05:33:46,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:33:45" (2/3) ... [2023-08-24 05:33:46,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254711d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:33:46, skipping insertion in model container [2023-08-24 05:33:46,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:33:46" (3/3) ... [2023-08-24 05:33:46,529 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-24 05:33:46,544 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:33:46,545 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:33:46,546 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:33:46,598 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:33:46,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-08-24 05:33:46,676 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events. [2023-08-24 05:33:46,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:33:46,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 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/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-24 05:33:46,681 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-08-24 05:33:46,685 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-08-24 05:33:46,690 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:33:46,702 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-24 05:33:46,708 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-24 05:33:46,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-08-24 05:33:46,746 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events. [2023-08-24 05:33:46,747 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:33:46,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 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/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-24 05:33:46,749 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-08-24 05:33:50,407 INFO L134 LiptonReduction]: Checked pairs total: 5337 [2023-08-24 05:33:50,408 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-24 05:33:50,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:33:50,424 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@6296a49a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:33:50,424 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 05:33:50,426 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:33:50,426 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-24 05:33:50,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:33:50,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:33:50,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 05:33:50,428 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:50,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:33:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash 537160, now seen corresponding path program 1 times [2023-08-24 05:33:50,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:33:50,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15848302] [2023-08-24 05:33:50,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:33:50,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:33:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:33:50,774 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:50,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:33:50,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15848302] [2023-08-24 05:33:50,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15848302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:33:50,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:33:50,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:33:50,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653721516] [2023-08-24 05:33:50,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:33:50,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:33:50,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:33:50,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:33:50,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:33:50,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 200 [2023-08-24 05:33:50,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have 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:50,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:33:50,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 200 [2023-08-24 05:33:50,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:33:51,250 INFO L124 PetriNetUnfolderBase]: 1079/1731 cut-off events. [2023-08-24 05:33:51,251 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-24 05:33:51,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3378 conditions, 1731 events. 1079/1731 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9152 event pairs, 173 based on Foata normal form. 0/1650 useless extension candidates. Maximal degree in co-relation 3367. Up to 1297 conditions per place. [2023-08-24 05:33:51,264 INFO L140 encePairwiseOnDemand]: 196/200 looper letters, 33 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-08-24 05:33:51,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 167 flow [2023-08-24 05:33:51,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:33:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:33:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-08-24 05:33:51,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2023-08-24 05:33:51,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-08-24 05:33:51,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-08-24 05:33:51,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:33:51,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-08-24 05:33:51,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:33:51,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have 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:51,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have 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:51,291 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 316 transitions. [2023-08-24 05:33:51,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 167 flow [2023-08-24 05:33:51,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 05:33:51,296 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-08-24 05:33:51,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-08-24 05:33:51,301 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-08-24 05:33:51,302 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-08-24 05:33:51,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have 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:51,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:33:51,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:33:51,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:33:51,303 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:51,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:33:51,304 INFO L85 PathProgramCache]: Analyzing trace with hash 46376923, now seen corresponding path program 1 times [2023-08-24 05:33:51,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:33:51,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689981255] [2023-08-24 05:33:51,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:33:51,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:33:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:33:52,244 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:52,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:33:52,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689981255] [2023-08-24 05:33:52,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689981255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:33:52,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:33:52,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:33:52,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3531227] [2023-08-24 05:33:52,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:33:52,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:33:52,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:33:52,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:33:52,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:33:52,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 200 [2023-08-24 05:33:52,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have 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:52,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:33:52,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 200 [2023-08-24 05:33:52,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:33:52,580 INFO L124 PetriNetUnfolderBase]: 1197/1808 cut-off events. [2023-08-24 05:33:52,580 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2023-08-24 05:33:52,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3820 conditions, 1808 events. 1197/1808 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8108 event pairs, 262 based on Foata normal form. 100/1907 useless extension candidates. Maximal degree in co-relation 3810. Up to 1301 conditions per place. [2023-08-24 05:33:52,589 INFO L140 encePairwiseOnDemand]: 196/200 looper letters, 28 selfloop transitions, 2 changer transitions 19/50 dead transitions. [2023-08-24 05:33:52,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 50 transitions, 214 flow [2023-08-24 05:33:52,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:33:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:33:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2023-08-24 05:33:52,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.446 [2023-08-24 05:33:52,593 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 446 transitions. [2023-08-24 05:33:52,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 446 transitions. [2023-08-24 05:33:52,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:33:52,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 446 transitions. [2023-08-24 05:33:52,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have 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:52,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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:52,598 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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:52,598 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 5 states and 446 transitions. [2023-08-24 05:33:52,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 50 transitions, 214 flow [2023-08-24 05:33:52,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:33:52,600 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 62 flow [2023-08-24 05:33:52,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-08-24 05:33:52,601 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-08-24 05:33:52,601 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 62 flow [2023-08-24 05:33:52,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have 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:52,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:33:52,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:33:52,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:33:52,602 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:33:52,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:33:52,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1437675383, now seen corresponding path program 1 times [2023-08-24 05:33:52,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:33:52,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001585790] [2023-08-24 05:33:52,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:33:52,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:33:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:33:53,245 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:53,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:33:53,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001585790] [2023-08-24 05:33:53,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001585790] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:33:53,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:33:53,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:33:53,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61431423] [2023-08-24 05:33:53,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:33:53,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:33:53,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:33:53,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:33:53,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:33:53,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 200 [2023-08-24 05:33:53,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have 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:53,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:33:53,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 200 [2023-08-24 05:33:53,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:33:53,616 INFO L124 PetriNetUnfolderBase]: 1082/1641 cut-off events. [2023-08-24 05:33:53,616 INFO L125 PetriNetUnfolderBase]: For 405/405 co-relation queries the response was YES. [2023-08-24 05:33:53,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3665 conditions, 1641 events. 1082/1641 cut-off events. For 405/405 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7621 event pairs, 182 based on Foata normal form. 80/1720 useless extension candidates. Maximal degree in co-relation 3652. Up to 1277 conditions per place. [2023-08-24 05:33:53,624 INFO L140 encePairwiseOnDemand]: 196/200 looper letters, 30 selfloop transitions, 2 changer transitions 17/50 dead transitions. [2023-08-24 05:33:53,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 50 transitions, 223 flow [2023-08-24 05:33:53,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:33:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:33:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2023-08-24 05:33:53,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.446 [2023-08-24 05:33:53,626 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 446 transitions. [2023-08-24 05:33:53,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 446 transitions. [2023-08-24 05:33:53,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:33:53,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 446 transitions. [2023-08-24 05:33:53,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have 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:53,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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:53,630 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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:53,630 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 62 flow. Second operand 5 states and 446 transitions. [2023-08-24 05:33:53,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 50 transitions, 223 flow [2023-08-24 05:33:53,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 213 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-24 05:33:53,637 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 66 flow [2023-08-24 05:33:53,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-08-24 05:33:53,638 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-24 05:33:53,638 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 66 flow [2023-08-24 05:33:53,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have 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:53,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:33:53,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:33:53,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:33:53,639 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:33:53,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:33:53,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1588737568, now seen corresponding path program 1 times [2023-08-24 05:33:53,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:33:53,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815796245] [2023-08-24 05:33:53,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:33:53,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:33:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:33:54,264 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:54,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:33:54,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815796245] [2023-08-24 05:33:54,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815796245] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:33:54,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:33:54,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:33:54,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052445185] [2023-08-24 05:33:54,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:33:54,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:33:54,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:33:54,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:33:54,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:33:54,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 200 [2023-08-24 05:33:54,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 66 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:33:54,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:33:54,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 200 [2023-08-24 05:33:54,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:33:55,034 INFO L124 PetriNetUnfolderBase]: 1624/2416 cut-off events. [2023-08-24 05:33:55,035 INFO L125 PetriNetUnfolderBase]: For 782/782 co-relation queries the response was YES. [2023-08-24 05:33:55,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5537 conditions, 2416 events. 1624/2416 cut-off events. For 782/782 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 11110 event pairs, 198 based on Foata normal form. 102/2518 useless extension candidates. Maximal degree in co-relation 5523. Up to 1247 conditions per place. [2023-08-24 05:33:55,049 INFO L140 encePairwiseOnDemand]: 188/200 looper letters, 48 selfloop transitions, 16 changer transitions 31/95 dead transitions. [2023-08-24 05:33:55,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 95 transitions, 437 flow [2023-08-24 05:33:55,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:33:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:33:55,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 792 transitions. [2023-08-24 05:33:55,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2023-08-24 05:33:55,052 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 792 transitions. [2023-08-24 05:33:55,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 792 transitions. [2023-08-24 05:33:55,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:33:55,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 792 transitions. [2023-08-24 05:33:55,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 88.0) internal successors, (792), 9 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:55,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have 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:55,058 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have 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:55,058 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 66 flow. Second operand 9 states and 792 transitions. [2023-08-24 05:33:55,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 95 transitions, 437 flow [2023-08-24 05:33:55,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 95 transitions, 421 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-24 05:33:55,065 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 199 flow [2023-08-24 05:33:55,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=199, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-24 05:33:55,066 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-08-24 05:33:55,066 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 199 flow [2023-08-24 05:33:55,067 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:33:55,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:33:55,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:33:55,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:33:55,067 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:33:55,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:33:55,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1401564170, now seen corresponding path program 2 times [2023-08-24 05:33:55,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:33:55,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652472171] [2023-08-24 05:33:55,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:33:55,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:33:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:33:55,631 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:55,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:33:55,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652472171] [2023-08-24 05:33:55,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652472171] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:33:55,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:33:55,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:33:55,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861105606] [2023-08-24 05:33:55,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:33:55,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:33:55,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:33:55,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:33:55,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:33:55,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 200 [2023-08-24 05:33:55,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:33:55,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:33:55,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 200 [2023-08-24 05:33:55,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:33:56,116 INFO L124 PetriNetUnfolderBase]: 1855/2765 cut-off events. [2023-08-24 05:33:56,117 INFO L125 PetriNetUnfolderBase]: For 5703/5703 co-relation queries the response was YES. [2023-08-24 05:33:56,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10466 conditions, 2765 events. 1855/2765 cut-off events. For 5703/5703 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12999 event pairs, 281 based on Foata normal form. 80/2845 useless extension candidates. Maximal degree in co-relation 10447. Up to 1184 conditions per place. [2023-08-24 05:33:56,134 INFO L140 encePairwiseOnDemand]: 195/200 looper letters, 42 selfloop transitions, 3 changer transitions 36/81 dead transitions. [2023-08-24 05:33:56,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 81 transitions, 605 flow [2023-08-24 05:33:56,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:33:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:33:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2023-08-24 05:33:56,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425 [2023-08-24 05:33:56,137 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 531 transitions. [2023-08-24 05:33:56,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 531 transitions. [2023-08-24 05:33:56,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:33:56,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 531 transitions. [2023-08-24 05:33:56,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.5) internal successors, (531), 6 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have 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:56,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have 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:56,143 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have 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:56,143 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 199 flow. Second operand 6 states and 531 transitions. [2023-08-24 05:33:56,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 81 transitions, 605 flow [2023-08-24 05:33:56,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 81 transitions, 592 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-24 05:33:56,153 INFO L231 Difference]: Finished difference. Result has 48 places, 25 transitions, 149 flow [2023-08-24 05:33:56,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=48, PETRI_TRANSITIONS=25} [2023-08-24 05:33:56,156 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-08-24 05:33:56,156 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 25 transitions, 149 flow [2023-08-24 05:33:56,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:33:56,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:33:56,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:33:56,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:33:56,157 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:33:56,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:33:56,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1364719448, now seen corresponding path program 1 times [2023-08-24 05:33:56,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:33:56,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112909342] [2023-08-24 05:33:56,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:33:56,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:33:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:33:56,758 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:56,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:33:56,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112909342] [2023-08-24 05:33:56,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112909342] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:33:56,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:33:56,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:33:56,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005682036] [2023-08-24 05:33:56,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:33:56,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:33:56,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:33:56,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:33:56,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:33:56,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 200 [2023-08-24 05:33:56,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 25 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have 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:56,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:33:56,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 200 [2023-08-24 05:33:56,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:33:57,007 INFO L124 PetriNetUnfolderBase]: 728/1131 cut-off events. [2023-08-24 05:33:57,007 INFO L125 PetriNetUnfolderBase]: For 2147/2148 co-relation queries the response was YES. [2023-08-24 05:33:57,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4456 conditions, 1131 events. 728/1131 cut-off events. For 2147/2148 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4486 event pairs, 250 based on Foata normal form. 48/1178 useless extension candidates. Maximal degree in co-relation 4434. Up to 670 conditions per place. [2023-08-24 05:33:57,015 INFO L140 encePairwiseOnDemand]: 196/200 looper letters, 31 selfloop transitions, 2 changer transitions 14/48 dead transitions. [2023-08-24 05:33:57,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 367 flow [2023-08-24 05:33:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:33:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:33:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2023-08-24 05:33:57,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.441 [2023-08-24 05:33:57,017 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 441 transitions. [2023-08-24 05:33:57,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 441 transitions. [2023-08-24 05:33:57,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:33:57,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 441 transitions. [2023-08-24 05:33:57,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:33:57,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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:57,020 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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:57,021 INFO L175 Difference]: Start difference. First operand has 48 places, 25 transitions, 149 flow. Second operand 5 states and 441 transitions. [2023-08-24 05:33:57,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 367 flow [2023-08-24 05:33:57,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 333 flow, removed 8 selfloop flow, removed 8 redundant places. [2023-08-24 05:33:57,026 INFO L231 Difference]: Finished difference. Result has 44 places, 25 transitions, 135 flow [2023-08-24 05:33:57,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2023-08-24 05:33:57,027 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-08-24 05:33:57,027 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 25 transitions, 135 flow [2023-08-24 05:33:57,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have 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:57,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:33:57,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:33:57,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:33:57,028 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:33:57,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:33:57,028 INFO L85 PathProgramCache]: Analyzing trace with hash -515655024, now seen corresponding path program 1 times [2023-08-24 05:33:57,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:33:57,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645107989] [2023-08-24 05:33:57,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:33:57,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:33:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:33:57,398 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:57,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:33:57,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645107989] [2023-08-24 05:33:57,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645107989] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:33:57,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:33:57,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:33:57,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452727004] [2023-08-24 05:33:57,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:33:57,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:33:57,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:33:57,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:33:57,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:33:57,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-24 05:33:57,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 25 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:33:57,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:33:57,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-24 05:33:57,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:33:57,691 INFO L124 PetriNetUnfolderBase]: 1033/1592 cut-off events. [2023-08-24 05:33:57,691 INFO L125 PetriNetUnfolderBase]: For 2698/2699 co-relation queries the response was YES. [2023-08-24 05:33:57,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6102 conditions, 1592 events. 1033/1592 cut-off events. For 2698/2699 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6967 event pairs, 177 based on Foata normal form. 36/1627 useless extension candidates. Maximal degree in co-relation 6082. Up to 747 conditions per place. [2023-08-24 05:33:57,701 INFO L140 encePairwiseOnDemand]: 193/200 looper letters, 35 selfloop transitions, 6 changer transitions 17/59 dead transitions. [2023-08-24 05:33:57,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 432 flow [2023-08-24 05:33:57,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:33:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:33:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 486 transitions. [2023-08-24 05:33:57,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.486 [2023-08-24 05:33:57,703 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 486 transitions. [2023-08-24 05:33:57,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 486 transitions. [2023-08-24 05:33:57,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:33:57,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 486 transitions. [2023-08-24 05:33:57,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.2) internal successors, (486), 5 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have 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:57,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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:57,706 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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:57,707 INFO L175 Difference]: Start difference. First operand has 44 places, 25 transitions, 135 flow. Second operand 5 states and 486 transitions. [2023-08-24 05:33:57,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 432 flow [2023-08-24 05:33:57,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 412 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-24 05:33:57,714 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 164 flow [2023-08-24 05:33:57,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2023-08-24 05:33:57,719 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-08-24 05:33:57,719 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 164 flow [2023-08-24 05:33:57,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:33:57,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:33:57,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:33:57,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:33:57,721 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:33:57,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:33:57,721 INFO L85 PathProgramCache]: Analyzing trace with hash 306393916, now seen corresponding path program 2 times [2023-08-24 05:33:57,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:33:57,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260189612] [2023-08-24 05:33:57,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:33:57,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:33:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:33:58,708 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,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:33:58,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260189612] [2023-08-24 05:33:58,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260189612] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:33:58,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:33:58,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:33:58,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786791497] [2023-08-24 05:33:58,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:33:58,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:33:58,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:33:58,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:33:58,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:33:58,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 200 [2023-08-24 05:33:58,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 164 flow. Second operand has 8 states, 8 states have (on average 79.75) internal successors, (638), 8 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have 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,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:33:58,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 200 [2023-08-24 05:33:58,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:33:59,072 INFO L124 PetriNetUnfolderBase]: 714/1131 cut-off events. [2023-08-24 05:33:59,073 INFO L125 PetriNetUnfolderBase]: For 2373/2373 co-relation queries the response was YES. [2023-08-24 05:33:59,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4619 conditions, 1131 events. 714/1131 cut-off events. For 2373/2373 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4645 event pairs, 86 based on Foata normal form. 36/1167 useless extension candidates. Maximal degree in co-relation 4599. Up to 677 conditions per place. [2023-08-24 05:33:59,080 INFO L140 encePairwiseOnDemand]: 193/200 looper letters, 39 selfloop transitions, 8 changer transitions 24/72 dead transitions. [2023-08-24 05:33:59,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 563 flow [2023-08-24 05:33:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:33:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:33:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 616 transitions. [2023-08-24 05:33:59,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2023-08-24 05:33:59,083 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 616 transitions. [2023-08-24 05:33:59,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 616 transitions. [2023-08-24 05:33:59,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:33:59,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 616 transitions. [2023-08-24 05:33:59,085 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:33:59,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have 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,087 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have 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,087 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 164 flow. Second operand 7 states and 616 transitions. [2023-08-24 05:33:59,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 563 flow [2023-08-24 05:33:59,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 538 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-24 05:33:59,093 INFO L231 Difference]: Finished difference. Result has 50 places, 29 transitions, 202 flow [2023-08-24 05:33:59,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=50, PETRI_TRANSITIONS=29} [2023-08-24 05:33:59,095 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-08-24 05:33:59,095 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 29 transitions, 202 flow [2023-08-24 05:33:59,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 79.75) internal successors, (638), 8 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have 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,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:33:59,097 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:33:59,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:33:59,097 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:33:59,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:33:59,098 INFO L85 PathProgramCache]: Analyzing trace with hash -2078620821, now seen corresponding path program 1 times [2023-08-24 05:33:59,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:33:59,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162577560] [2023-08-24 05:33:59,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:33:59,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:33:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:00,080 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:00,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:00,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162577560] [2023-08-24 05:34:00,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162577560] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:00,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:00,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 05:34:00,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787120345] [2023-08-24 05:34:00,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:00,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 05:34:00,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:00,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 05:34:00,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-24 05:34:00,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 200 [2023-08-24 05:34:00,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 29 transitions, 202 flow. Second operand has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 9 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:00,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 200 [2023-08-24 05:34:00,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:00,590 INFO L124 PetriNetUnfolderBase]: 852/1369 cut-off events. [2023-08-24 05:34:00,590 INFO L125 PetriNetUnfolderBase]: For 4288/4288 co-relation queries the response was YES. [2023-08-24 05:34:00,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5688 conditions, 1369 events. 852/1369 cut-off events. For 4288/4288 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6145 event pairs, 232 based on Foata normal form. 42/1411 useless extension candidates. Maximal degree in co-relation 5665. Up to 602 conditions per place. [2023-08-24 05:34:00,601 INFO L140 encePairwiseOnDemand]: 191/200 looper letters, 57 selfloop transitions, 12 changer transitions 12/82 dead transitions. [2023-08-24 05:34:00,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 682 flow [2023-08-24 05:34:00,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 05:34:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 05:34:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 889 transitions. [2023-08-24 05:34:00,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4445 [2023-08-24 05:34:00,604 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 889 transitions. [2023-08-24 05:34:00,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 889 transitions. [2023-08-24 05:34:00,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:00,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 889 transitions. [2023-08-24 05:34:00,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 88.9) internal successors, (889), 10 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have 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,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 200.0) internal successors, (2200), 11 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have 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,610 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 200.0) internal successors, (2200), 11 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have 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,610 INFO L175 Difference]: Start difference. First operand has 50 places, 29 transitions, 202 flow. Second operand 10 states and 889 transitions. [2023-08-24 05:34:00,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 682 flow [2023-08-24 05:34:00,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 82 transitions, 641 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-24 05:34:00,617 INFO L231 Difference]: Finished difference. Result has 57 places, 35 transitions, 295 flow [2023-08-24 05:34:00,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=295, PETRI_PLACES=57, PETRI_TRANSITIONS=35} [2023-08-24 05:34:00,618 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2023-08-24 05:34:00,618 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 35 transitions, 295 flow [2023-08-24 05:34:00,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 9 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:00,619 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:00,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:34:00,619 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:00,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2110449141, now seen corresponding path program 2 times [2023-08-24 05:34:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:00,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502965888] [2023-08-24 05:34:00,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:00,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:01,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:01,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502965888] [2023-08-24 05:34:01,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502965888] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:01,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:01,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:34:01,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653187783] [2023-08-24 05:34:01,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:01,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:34:01,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:01,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:34:01,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:34:01,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-24 05:34:01,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 35 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have 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,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:01,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-24 05:34:01,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:01,425 INFO L124 PetriNetUnfolderBase]: 1093/1760 cut-off events. [2023-08-24 05:34:01,425 INFO L125 PetriNetUnfolderBase]: For 6289/6289 co-relation queries the response was YES. [2023-08-24 05:34:01,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7909 conditions, 1760 events. 1093/1760 cut-off events. For 6289/6289 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8253 event pairs, 494 based on Foata normal form. 24/1784 useless extension candidates. Maximal degree in co-relation 7883. Up to 1027 conditions per place. [2023-08-24 05:34:01,445 INFO L140 encePairwiseOnDemand]: 191/200 looper letters, 44 selfloop transitions, 12 changer transitions 32/89 dead transitions. [2023-08-24 05:34:01,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 89 transitions, 882 flow [2023-08-24 05:34:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:34:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:34:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 664 transitions. [2023-08-24 05:34:01,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742857142857143 [2023-08-24 05:34:01,447 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 664 transitions. [2023-08-24 05:34:01,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 664 transitions. [2023-08-24 05:34:01,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:01,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 664 transitions. [2023-08-24 05:34:01,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have 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,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have 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,452 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have 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,452 INFO L175 Difference]: Start difference. First operand has 57 places, 35 transitions, 295 flow. Second operand 7 states and 664 transitions. [2023-08-24 05:34:01,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 89 transitions, 882 flow [2023-08-24 05:34:01,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 790 flow, removed 44 selfloop flow, removed 5 redundant places. [2023-08-24 05:34:01,462 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 413 flow [2023-08-24 05:34:01,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=413, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2023-08-24 05:34:01,463 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2023-08-24 05:34:01,463 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 413 flow [2023-08-24 05:34:01,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have 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,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:01,464 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:01,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:34:01,465 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:01,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:01,465 INFO L85 PathProgramCache]: Analyzing trace with hash -40019015, now seen corresponding path program 1 times [2023-08-24 05:34:01,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:01,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652753720] [2023-08-24 05:34:01,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:01,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:02,169 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,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:02,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652753720] [2023-08-24 05:34:02,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652753720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:02,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:02,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:34:02,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086928700] [2023-08-24 05:34:02,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:02,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:34:02,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:02,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:34:02,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:34:02,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 200 [2023-08-24 05:34:02,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 413 flow. Second operand has 8 states, 8 states have (on average 82.875) internal successors, (663), 8 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have 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,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:02,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 200 [2023-08-24 05:34:02,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:02,548 INFO L124 PetriNetUnfolderBase]: 804/1326 cut-off events. [2023-08-24 05:34:02,548 INFO L125 PetriNetUnfolderBase]: For 6122/6122 co-relation queries the response was YES. [2023-08-24 05:34:02,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6239 conditions, 1326 events. 804/1326 cut-off events. For 6122/6122 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5973 event pairs, 295 based on Foata normal form. 55/1381 useless extension candidates. Maximal degree in co-relation 6212. Up to 1005 conditions per place. [2023-08-24 05:34:02,557 INFO L140 encePairwiseOnDemand]: 190/200 looper letters, 46 selfloop transitions, 21 changer transitions 17/85 dead transitions. [2023-08-24 05:34:02,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 924 flow [2023-08-24 05:34:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:34:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:34:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 625 transitions. [2023-08-24 05:34:02,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2023-08-24 05:34:02,560 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 625 transitions. [2023-08-24 05:34:02,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 625 transitions. [2023-08-24 05:34:02,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:02,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 625 transitions. [2023-08-24 05:34:02,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have 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,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have 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,564 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have 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,564 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 413 flow. Second operand 7 states and 625 transitions. [2023-08-24 05:34:02,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 924 flow [2023-08-24 05:34:02,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 854 flow, removed 35 selfloop flow, removed 3 redundant places. [2023-08-24 05:34:02,578 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 582 flow [2023-08-24 05:34:02,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=582, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2023-08-24 05:34:02,579 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2023-08-24 05:34:02,579 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 582 flow [2023-08-24 05:34:02,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.875) internal successors, (663), 8 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have 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,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:02,580 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:02,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:34:02,580 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:02,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:02,580 INFO L85 PathProgramCache]: Analyzing trace with hash 30573008, now seen corresponding path program 1 times [2023-08-24 05:34:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:02,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370392985] [2023-08-24 05:34:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:02,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:02,781 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,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:02,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370392985] [2023-08-24 05:34:02,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370392985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:02,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:02,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:34:02,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293257527] [2023-08-24 05:34:02,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:02,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:34:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:02,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:34:02,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:34:02,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-24 05:34:02,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 582 flow. Second operand has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have 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,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:02,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-24 05:34:02,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:03,013 INFO L124 PetriNetUnfolderBase]: 579/1023 cut-off events. [2023-08-24 05:34:03,014 INFO L125 PetriNetUnfolderBase]: For 9647/9664 co-relation queries the response was YES. [2023-08-24 05:34:03,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5245 conditions, 1023 events. 579/1023 cut-off events. For 9647/9664 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4974 event pairs, 122 based on Foata normal form. 112/1130 useless extension candidates. Maximal degree in co-relation 5215. Up to 702 conditions per place. [2023-08-24 05:34:03,021 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 58 selfloop transitions, 4 changer transitions 46/114 dead transitions. [2023-08-24 05:34:03,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 114 transitions, 1571 flow [2023-08-24 05:34:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:34:03,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:34:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2023-08-24 05:34:03,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.485 [2023-08-24 05:34:03,023 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 485 transitions. [2023-08-24 05:34:03,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 485 transitions. [2023-08-24 05:34:03,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:03,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 485 transitions. [2023-08-24 05:34:03,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have 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,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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,027 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have 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,027 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 582 flow. Second operand 5 states and 485 transitions. [2023-08-24 05:34:03,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 114 transitions, 1571 flow [2023-08-24 05:34:03,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 114 transitions, 1414 flow, removed 73 selfloop flow, removed 6 redundant places. [2023-08-24 05:34:03,039 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 495 flow [2023-08-24 05:34:03,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=495, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2023-08-24 05:34:03,040 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2023-08-24 05:34:03,040 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 495 flow [2023-08-24 05:34:03,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have 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,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:03,040 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:03,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:34:03,040 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:03,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1703523854, now seen corresponding path program 1 times [2023-08-24 05:34:03,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:03,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688221600] [2023-08-24 05:34:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:03,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:03,287 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:03,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:03,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688221600] [2023-08-24 05:34:03,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688221600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:03,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:03,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:34:03,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316040238] [2023-08-24 05:34:03,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:03,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:34:03,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:03,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:34:03,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:34:03,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-24 05:34:03,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 495 flow. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have 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,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:03,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-24 05:34:03,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:03,505 INFO L124 PetriNetUnfolderBase]: 291/572 cut-off events. [2023-08-24 05:34:03,505 INFO L125 PetriNetUnfolderBase]: For 5144/5154 co-relation queries the response was YES. [2023-08-24 05:34:03,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3085 conditions, 572 events. 291/572 cut-off events. For 5144/5154 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2599 event pairs, 34 based on Foata normal form. 73/641 useless extension candidates. Maximal degree in co-relation 3056. Up to 260 conditions per place. [2023-08-24 05:34:03,510 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 66 selfloop transitions, 7 changer transitions 31/107 dead transitions. [2023-08-24 05:34:03,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 107 transitions, 1351 flow [2023-08-24 05:34:03,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:34:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:34:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 579 transitions. [2023-08-24 05:34:03,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4825 [2023-08-24 05:34:03,512 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 579 transitions. [2023-08-24 05:34:03,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 579 transitions. [2023-08-24 05:34:03,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:03,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 579 transitions. [2023-08-24 05:34:03,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.5) internal successors, (579), 6 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have 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,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have 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,517 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have 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,517 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 495 flow. Second operand 6 states and 579 transitions. [2023-08-24 05:34:03,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 107 transitions, 1351 flow [2023-08-24 05:34:03,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 107 transitions, 1192 flow, removed 40 selfloop flow, removed 7 redundant places. [2023-08-24 05:34:03,527 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 432 flow [2023-08-24 05:34:03,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=432, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2023-08-24 05:34:03,528 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2023-08-24 05:34:03,528 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 432 flow [2023-08-24 05:34:03,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have 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,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:03,529 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:03,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:34:03,529 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:03,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2128872495, now seen corresponding path program 1 times [2023-08-24 05:34:03,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:03,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271745711] [2023-08-24 05:34:03,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:03,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:04,962 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,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271745711] [2023-08-24 05:34:04,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271745711] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:04,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:04,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 05:34:04,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511599262] [2023-08-24 05:34:04,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:04,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 05:34:04,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:04,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 05:34:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-08-24 05:34:04,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 200 [2023-08-24 05:34:04,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 432 flow. Second operand has 10 states, 10 states have (on average 81.9) internal successors, (819), 10 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have 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,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:04,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 200 [2023-08-24 05:34:04,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:05,434 INFO L124 PetriNetUnfolderBase]: 255/528 cut-off events. [2023-08-24 05:34:05,434 INFO L125 PetriNetUnfolderBase]: For 2871/2871 co-relation queries the response was YES. [2023-08-24 05:34:05,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2980 conditions, 528 events. 255/528 cut-off events. For 2871/2871 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2295 event pairs, 36 based on Foata normal form. 10/538 useless extension candidates. Maximal degree in co-relation 2952. Up to 299 conditions per place. [2023-08-24 05:34:05,438 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 42 selfloop transitions, 6 changer transitions 37/86 dead transitions. [2023-08-24 05:34:05,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 86 transitions, 935 flow [2023-08-24 05:34:05,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:34:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:34:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2023-08-24 05:34:05,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2023-08-24 05:34:05,442 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 535 transitions. [2023-08-24 05:34:05,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 535 transitions. [2023-08-24 05:34:05,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:05,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 535 transitions. [2023-08-24 05:34:05,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have 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,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have 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,445 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have 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,445 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 432 flow. Second operand 6 states and 535 transitions. [2023-08-24 05:34:05,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 86 transitions, 935 flow [2023-08-24 05:34:05,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 840 flow, removed 36 selfloop flow, removed 5 redundant places. [2023-08-24 05:34:05,455 INFO L231 Difference]: Finished difference. Result has 63 places, 36 transitions, 304 flow [2023-08-24 05:34:05,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=304, PETRI_PLACES=63, PETRI_TRANSITIONS=36} [2023-08-24 05:34:05,456 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2023-08-24 05:34:05,456 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 36 transitions, 304 flow [2023-08-24 05:34:05,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.9) internal successors, (819), 10 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have 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,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:05,457 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:05,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 05:34:05,457 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:05,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2092668157, now seen corresponding path program 2 times [2023-08-24 05:34:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:05,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085162028] [2023-08-24 05:34:05,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:05,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:05,653 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,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:05,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085162028] [2023-08-24 05:34:05,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085162028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:05,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:05,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:34:05,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581447678] [2023-08-24 05:34:05,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:05,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:34:05,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:34:05,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:34:05,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-24 05:34:05,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 36 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:05,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:05,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-24 05:34:05,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:05,769 INFO L124 PetriNetUnfolderBase]: 84/197 cut-off events. [2023-08-24 05:34:05,769 INFO L125 PetriNetUnfolderBase]: For 1235/1237 co-relation queries the response was YES. [2023-08-24 05:34:05,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 197 events. 84/197 cut-off events. For 1235/1237 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 669 event pairs, 11 based on Foata normal form. 15/211 useless extension candidates. Maximal degree in co-relation 971. Up to 66 conditions per place. [2023-08-24 05:34:05,770 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 38 selfloop transitions, 10 changer transitions 11/61 dead transitions. [2023-08-24 05:34:05,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 680 flow [2023-08-24 05:34:05,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:34:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:34:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 651 transitions. [2023-08-24 05:34:05,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465 [2023-08-24 05:34:05,772 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 651 transitions. [2023-08-24 05:34:05,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 651 transitions. [2023-08-24 05:34:05,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:05,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 651 transitions. [2023-08-24 05:34:05,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have 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,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have 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,776 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have 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,777 INFO L175 Difference]: Start difference. First operand has 63 places, 36 transitions, 304 flow. Second operand 7 states and 651 transitions. [2023-08-24 05:34:05,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 680 flow [2023-08-24 05:34:05,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 61 transitions, 581 flow, removed 38 selfloop flow, removed 10 redundant places. [2023-08-24 05:34:05,780 INFO L231 Difference]: Finished difference. Result has 59 places, 36 transitions, 276 flow [2023-08-24 05:34:05,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=59, PETRI_TRANSITIONS=36} [2023-08-24 05:34:05,781 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2023-08-24 05:34:05,781 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 36 transitions, 276 flow [2023-08-24 05:34:05,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:05,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:05,782 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:05,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 05:34:05,782 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:05,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1534003869, now seen corresponding path program 1 times [2023-08-24 05:34:05,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:05,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109575755] [2023-08-24 05:34:05,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:05,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:34:05,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:34:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:34:05,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:34:05,899 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:34:05,900 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 05:34:05,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-24 05:34:05,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-24 05:34:05,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-24 05:34:05,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-24 05:34:05,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 05:34:05,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 05:34:05,902 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:05,907 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:34:05,907 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:34:05,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:34:05 BasicIcfg [2023-08-24 05:34:05,966 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:34:05,966 INFO L158 Benchmark]: Toolchain (without parser) took 20906.41ms. Allocated memory was 415.2MB in the beginning and 937.4MB in the end (delta: 522.2MB). Free memory was 390.8MB in the beginning and 569.1MB in the end (delta: -178.3MB). Peak memory consumption was 346.0MB. Max. memory is 16.0GB. [2023-08-24 05:34:05,966 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 415.2MB. Free memory was 392.3MB in the beginning and 392.1MB in the end (delta: 146.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:34:05,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.64ms. Allocated memory is still 415.2MB. Free memory was 390.5MB in the beginning and 364.6MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-24 05:34:05,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.87ms. Allocated memory is still 415.2MB. Free memory was 364.6MB in the beginning and 362.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:34:05,967 INFO L158 Benchmark]: Boogie Preprocessor took 49.85ms. Allocated memory is still 415.2MB. Free memory was 361.7MB in the beginning and 359.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:34:05,967 INFO L158 Benchmark]: RCFGBuilder took 784.30ms. Allocated memory is still 415.2MB. Free memory was 359.7MB in the beginning and 364.1MB in the end (delta: -4.4MB). Peak memory consumption was 34.0MB. Max. memory is 16.0GB. [2023-08-24 05:34:05,967 INFO L158 Benchmark]: TraceAbstraction took 19442.61ms. Allocated memory was 415.2MB in the beginning and 937.4MB in the end (delta: 522.2MB). Free memory was 363.1MB in the beginning and 569.1MB in the end (delta: -206.1MB). Peak memory consumption was 316.1MB. Max. memory is 16.0GB. [2023-08-24 05:34:05,969 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.19ms. Allocated memory is still 415.2MB. Free memory was 392.3MB in the beginning and 392.1MB in the end (delta: 146.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 569.64ms. Allocated memory is still 415.2MB. Free memory was 390.5MB in the beginning and 364.6MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 50.87ms. Allocated memory is still 415.2MB. Free memory was 364.6MB in the beginning and 362.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.85ms. Allocated memory is still 415.2MB. Free memory was 361.7MB in the beginning and 359.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 784.30ms. Allocated memory is still 415.2MB. Free memory was 359.7MB in the beginning and 364.1MB in the end (delta: -4.4MB). Peak memory consumption was 34.0MB. Max. memory is 16.0GB. * TraceAbstraction took 19442.61ms. Allocated memory was 415.2MB in the beginning and 937.4MB in the end (delta: 522.2MB). Free memory was 363.1MB in the beginning and 569.1MB in the end (delta: -206.1MB). Peak memory consumption was 316.1MB. 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.7s, 113 PlacesBefore, 34 PlacesAfterwards, 105 TransitionsBefore, 25 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 5337 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1992, independent: 1812, independent conditional: 0, independent unconditional: 1812, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1003, independent: 970, independent conditional: 0, independent unconditional: 970, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1992, independent: 842, independent conditional: 0, independent unconditional: 842, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 1003, unknown conditional: 0, unknown unconditional: 1003] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1849; [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=-3, t1849={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] [L848] 0 pthread_t t1850; [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=-2, t1849={5:0}, t1850={6: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] [L850] 0 pthread_t t1851; [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1] [L778] 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) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 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 [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 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_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1] [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=-1, t1849={5:0}, t1850={6:0}, t1851={3: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=1] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] 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) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 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)) [L802] 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)) [L803] 3 __unbuffered_p2_EAX = y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=0, x=1, 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] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] 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) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 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)) [L818] 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)) [L819] 3 __unbuffered_p2_EBX = y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=0, x=1, 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] [L824] 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) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 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_p1_EAX=1, __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=0, x=1, 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] [L758] 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) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 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 [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 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_p1_EAX=1, __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=0, x=1, 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] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 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 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 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_p1_EAX=1, __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, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice2=0, x=1, 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] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 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) [L869] 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)) [L870] 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)) [L871] 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)) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L879] 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_p1_EAX=1, __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=0, x=1, 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: 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: 851]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 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: 19.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 637 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 637 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1827 IncrementalHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 30 mSDtfsCounter, 1827 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=582occurred in iteration=11, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 2490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:05,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...