/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/mix040.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:29:43,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:29:43,615 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:29:43,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:29:43,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:29:43,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:29:43,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:29:43,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:29:43,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:29:43,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:29:43,651 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:29:43,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:29:43,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:29:43,652 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:29:43,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:29:43,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:29:43,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:29:43,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:29:43,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:29:43,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:29:43,653 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:29:43,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:29:43,654 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:29:43,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:29:43,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:29:43,655 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:29:43,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:29:43,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:29:43,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:29:43,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:29:43,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:29:43,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:29:43,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:29:43,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:29:43,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:29:43,657 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:29:43,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:29:43,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:29:43,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:29:43,931 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:29:43,931 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:29:43,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040.opt.i [2023-08-24 05:29:44,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:29:45,095 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:29:45,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040.opt.i [2023-08-24 05:29:45,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951f3c5e4/eef6b684671f4e46ad8c91863b040cd0/FLAG093f507f1 [2023-08-24 05:29:45,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951f3c5e4/eef6b684671f4e46ad8c91863b040cd0 [2023-08-24 05:29:45,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:29:45,131 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:29:45,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:29:45,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:29:45,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:29:45,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:29:45" (1/1) ... [2023-08-24 05:29:45,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54cb0aa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:45, skipping insertion in model container [2023-08-24 05:29:45,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:29:45" (1/1) ... [2023-08-24 05:29:45,183 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:29:45,311 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/mix040.opt.i[944,957] [2023-08-24 05:29:45,467 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:29:45,475 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:29:45,484 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/mix040.opt.i[944,957] [2023-08-24 05:29:45,498 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:29:45,499 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:29:45,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:29:45,568 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:29:45,568 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:29:45,573 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:29:45,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:45 WrapperNode [2023-08-24 05:29:45,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:29:45,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:29:45,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:29:45,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:29:45,579 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:29:45" (1/1) ... [2023-08-24 05:29:45,606 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:29:45" (1/1) ... [2023-08-24 05:29:45,622 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-08-24 05:29:45,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:29:45,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:29:45,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:29:45,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:29:45,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:45" (1/1) ... [2023-08-24 05:29:45,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:45" (1/1) ... [2023-08-24 05:29:45,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:45" (1/1) ... [2023-08-24 05:29:45,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:45" (1/1) ... [2023-08-24 05:29:45,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:45" (1/1) ... [2023-08-24 05:29:45,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:45" (1/1) ... [2023-08-24 05:29:45,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:45" (1/1) ... [2023-08-24 05:29:45,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:45" (1/1) ... [2023-08-24 05:29:45,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:29:45,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:29:45,653 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:29:45,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:29:45,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:45" (1/1) ... [2023-08-24 05:29:45,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:29:45,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:29:45,678 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:29:45,683 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:29:45,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:29:45,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:29:45,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:29:45,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:29:45,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:29:45,699 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:29:45,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:29:45,699 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:29:45,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:29:45,699 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:29:45,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:29:45,699 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 05:29:45,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 05:29:45,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:29:45,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:29:45,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:29:45,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:29:45,701 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:29:45,795 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:29:45,796 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:29:45,969 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:29:46,056 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:29:46,056 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:29:46,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:29:46 BoogieIcfgContainer [2023-08-24 05:29:46,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:29:46,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:29:46,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:29:46,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:29:46,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:29:45" (1/3) ... [2023-08-24 05:29:46,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f19b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:29:46, skipping insertion in model container [2023-08-24 05:29:46,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:45" (2/3) ... [2023-08-24 05:29:46,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f19b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:29:46, skipping insertion in model container [2023-08-24 05:29:46,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:29:46" (3/3) ... [2023-08-24 05:29:46,065 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040.opt.i [2023-08-24 05:29:46,077 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:29:46,077 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:29:46,077 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:29:46,123 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:29:46,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-08-24 05:29:46,212 INFO L124 PetriNetUnfolderBase]: 2/125 cut-off events. [2023-08-24 05:29:46,212 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:46,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-24 05:29:46,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-08-24 05:29:46,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-08-24 05:29:46,224 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:29:46,233 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-08-24 05:29:46,235 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-08-24 05:29:46,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-08-24 05:29:46,267 INFO L124 PetriNetUnfolderBase]: 2/125 cut-off events. [2023-08-24 05:29:46,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:46,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-24 05:29:46,270 INFO L119 LiptonReduction]: Number of co-enabled transitions 2816 [2023-08-24 05:29:49,603 INFO L134 LiptonReduction]: Checked pairs total: 6600 [2023-08-24 05:29:49,603 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-08-24 05:29:49,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:29:49,615 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;@14a4733, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:29:49,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 05:29:49,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:29:49,621 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2023-08-24 05:29:49,621 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:49,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:49,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:49,622 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:49,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:49,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1463241210, now seen corresponding path program 1 times [2023-08-24 05:29:49,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:49,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511731484] [2023-08-24 05:29:49,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:49,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:50,013 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:29:50,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:50,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511731484] [2023-08-24 05:29:50,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511731484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:50,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:50,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:29:50,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350674370] [2023-08-24 05:29:50,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:50,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:29:50,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:50,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:29:50,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:29:50,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 237 [2023-08-24 05:29:50,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:50,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:50,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 237 [2023-08-24 05:29:50,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:50,480 INFO L124 PetriNetUnfolderBase]: 2891/4508 cut-off events. [2023-08-24 05:29:50,480 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-24 05:29:50,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8608 conditions, 4508 events. 2891/4508 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 26768 event pairs, 668 based on Foata normal form. 144/4360 useless extension candidates. Maximal degree in co-relation 8596. Up to 2980 conditions per place. [2023-08-24 05:29:50,501 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 31 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2023-08-24 05:29:50,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 168 flow [2023-08-24 05:29:50,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:29:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:29:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-24 05:29:50,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5457102672292545 [2023-08-24 05:29:50,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-24 05:29:50,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-24 05:29:50,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:50,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-24 05:29:50,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have 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:29:50,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have 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:29:50,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have 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:29:50,526 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 388 transitions. [2023-08-24 05:29:50,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 168 flow [2023-08-24 05:29:50,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 05:29:50,530 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-08-24 05:29:50,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-24 05:29:50,534 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-24 05:29:50,534 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-08-24 05:29:50,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:50,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:50,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:50,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:29:50,535 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:50,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:50,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1798587667, now seen corresponding path program 1 times [2023-08-24 05:29:50,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:50,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712159325] [2023-08-24 05:29:50,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:50,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:50,759 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:29:50,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:50,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712159325] [2023-08-24 05:29:50,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712159325] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:50,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:50,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:29:50,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171648881] [2023-08-24 05:29:50,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:50,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:50,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:50,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:50,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:50,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 237 [2023-08-24 05:29:50,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have 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:29:50,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:50,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 237 [2023-08-24 05:29:50,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:51,711 INFO L124 PetriNetUnfolderBase]: 10895/15040 cut-off events. [2023-08-24 05:29:51,711 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2023-08-24 05:29:51,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30938 conditions, 15040 events. 10895/15040 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 78549 event pairs, 3371 based on Foata normal form. 652/15692 useless extension candidates. Maximal degree in co-relation 30928. Up to 7839 conditions per place. [2023-08-24 05:29:51,840 INFO L140 encePairwiseOnDemand]: 227/237 looper letters, 39 selfloop transitions, 8 changer transitions 29/76 dead transitions. [2023-08-24 05:29:51,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 76 transitions, 326 flow [2023-08-24 05:29:51,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:29:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:29:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-08-24 05:29:51,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5004219409282701 [2023-08-24 05:29:51,842 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-08-24 05:29:51,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-08-24 05:29:51,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:51,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-08-24 05:29:51,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:51,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:29:51,846 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:29:51,846 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 5 states and 593 transitions. [2023-08-24 05:29:51,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 76 transitions, 326 flow [2023-08-24 05:29:51,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:29:51,854 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 140 flow [2023-08-24 05:29:51,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-24 05:29:51,855 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-24 05:29:51,855 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 140 flow [2023-08-24 05:29:51,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have 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:29:51,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:51,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:51,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:29:51,856 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:51,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:51,856 INFO L85 PathProgramCache]: Analyzing trace with hash -78402104, now seen corresponding path program 1 times [2023-08-24 05:29:51,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:51,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350781752] [2023-08-24 05:29:51,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:51,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:51,951 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:29:51,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:51,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350781752] [2023-08-24 05:29:51,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350781752] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:51,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:51,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:29:51,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129578684] [2023-08-24 05:29:51,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:51,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:29:51,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:51,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:29:51,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:29:51,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 237 [2023-08-24 05:29:51,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:51,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:51,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 237 [2023-08-24 05:29:51,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:52,907 INFO L124 PetriNetUnfolderBase]: 9487/13208 cut-off events. [2023-08-24 05:29:52,907 INFO L125 PetriNetUnfolderBase]: For 11851/11851 co-relation queries the response was YES. [2023-08-24 05:29:52,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38414 conditions, 13208 events. 9487/13208 cut-off events. For 11851/11851 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 67602 event pairs, 1943 based on Foata normal form. 620/13828 useless extension candidates. Maximal degree in co-relation 38400. Up to 5411 conditions per place. [2023-08-24 05:29:52,971 INFO L140 encePairwiseOnDemand]: 227/237 looper letters, 49 selfloop transitions, 9 changer transitions 42/100 dead transitions. [2023-08-24 05:29:52,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 100 transitions, 616 flow [2023-08-24 05:29:52,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:29:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:29:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 812 transitions. [2023-08-24 05:29:52,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48945147679324896 [2023-08-24 05:29:52,974 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 812 transitions. [2023-08-24 05:29:52,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 812 transitions. [2023-08-24 05:29:52,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:52,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 812 transitions. [2023-08-24 05:29:52,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have 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:29:52,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:29:52,979 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:29:52,979 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 140 flow. Second operand 7 states and 812 transitions. [2023-08-24 05:29:52,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 100 transitions, 616 flow [2023-08-24 05:29:53,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 100 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:29:53,001 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 208 flow [2023-08-24 05:29:53,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-24 05:29:53,002 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-08-24 05:29:53,002 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 208 flow [2023-08-24 05:29:53,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:53,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:53,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:53,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:29:53,003 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:53,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:53,003 INFO L85 PathProgramCache]: Analyzing trace with hash 814659778, now seen corresponding path program 1 times [2023-08-24 05:29:53,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:53,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618157623] [2023-08-24 05:29:53,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:53,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:53,147 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:29:53,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:53,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618157623] [2023-08-24 05:29:53,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618157623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:53,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:53,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:29:53,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140460564] [2023-08-24 05:29:53,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:53,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:29:53,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:53,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:29:53,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:29:53,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 237 [2023-08-24 05:29:53,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:53,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:53,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 237 [2023-08-24 05:29:53,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:54,078 INFO L124 PetriNetUnfolderBase]: 8635/12048 cut-off events. [2023-08-24 05:29:54,079 INFO L125 PetriNetUnfolderBase]: For 24222/24222 co-relation queries the response was YES. [2023-08-24 05:29:54,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38842 conditions, 12048 events. 8635/12048 cut-off events. For 24222/24222 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 62313 event pairs, 1119 based on Foata normal form. 440/12488 useless extension candidates. Maximal degree in co-relation 38822. Up to 6137 conditions per place. [2023-08-24 05:29:54,128 INFO L140 encePairwiseOnDemand]: 227/237 looper letters, 58 selfloop transitions, 19 changer transitions 38/115 dead transitions. [2023-08-24 05:29:54,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 115 transitions, 806 flow [2023-08-24 05:29:54,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:29:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:29:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 820 transitions. [2023-08-24 05:29:54,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49427365883062085 [2023-08-24 05:29:54,130 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 820 transitions. [2023-08-24 05:29:54,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 820 transitions. [2023-08-24 05:29:54,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:54,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 820 transitions. [2023-08-24 05:29:54,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have 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:29:54,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:29:54,134 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:29:54,134 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 208 flow. Second operand 7 states and 820 transitions. [2023-08-24 05:29:54,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 115 transitions, 806 flow [2023-08-24 05:29:54,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 115 transitions, 789 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-24 05:29:54,180 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 400 flow [2023-08-24 05:29:54,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=400, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-24 05:29:54,180 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-08-24 05:29:54,181 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 400 flow [2023-08-24 05:29:54,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:54,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:54,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:54,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:29:54,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:54,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash -514017517, now seen corresponding path program 1 times [2023-08-24 05:29:54,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:54,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396418071] [2023-08-24 05:29:54,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:54,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:54,257 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:29:54,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:54,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396418071] [2023-08-24 05:29:54,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396418071] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:54,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:54,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:29:54,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540986496] [2023-08-24 05:29:54,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:54,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:54,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:54,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:54,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 237 [2023-08-24 05:29:54,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 400 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have 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:29:54,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:54,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 237 [2023-08-24 05:29:54,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:54,951 INFO L124 PetriNetUnfolderBase]: 6609/9639 cut-off events. [2023-08-24 05:29:54,951 INFO L125 PetriNetUnfolderBase]: For 32275/32705 co-relation queries the response was YES. [2023-08-24 05:29:54,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34632 conditions, 9639 events. 6609/9639 cut-off events. For 32275/32705 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 54910 event pairs, 2497 based on Foata normal form. 602/9931 useless extension candidates. Maximal degree in co-relation 34606. Up to 7610 conditions per place. [2023-08-24 05:29:55,002 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 53 selfloop transitions, 7 changer transitions 20/92 dead transitions. [2023-08-24 05:29:55,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 784 flow [2023-08-24 05:29:55,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:29:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:29:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2023-08-24 05:29:55,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5181434599156118 [2023-08-24 05:29:55,004 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2023-08-24 05:29:55,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2023-08-24 05:29:55,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:55,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2023-08-24 05:29:55,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have 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:29:55,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:29:55,007 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:29:55,007 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 400 flow. Second operand 5 states and 614 transitions. [2023-08-24 05:29:55,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 784 flow [2023-08-24 05:29:55,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 756 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-24 05:29:55,079 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 475 flow [2023-08-24 05:29:55,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=475, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2023-08-24 05:29:55,080 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2023-08-24 05:29:55,081 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 475 flow [2023-08-24 05:29:55,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have 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:29:55,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:55,081 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:29:55,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:29:55,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:55,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:55,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1222677543, now seen corresponding path program 1 times [2023-08-24 05:29:55,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:55,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278192209] [2023-08-24 05:29:55,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:55,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:55,190 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:29:55,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:55,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278192209] [2023-08-24 05:29:55,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278192209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:55,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:55,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:29:55,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426641494] [2023-08-24 05:29:55,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:55,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:29:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:55,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:29:55,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:29:55,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 237 [2023-08-24 05:29:55,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 475 flow. Second operand has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 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:29:55,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:55,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 237 [2023-08-24 05:29:55,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:56,415 INFO L124 PetriNetUnfolderBase]: 9913/13958 cut-off events. [2023-08-24 05:29:56,416 INFO L125 PetriNetUnfolderBase]: For 45007/45007 co-relation queries the response was YES. [2023-08-24 05:29:56,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50799 conditions, 13958 events. 9913/13958 cut-off events. For 45007/45007 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 74969 event pairs, 1755 based on Foata normal form. 336/14294 useless extension candidates. Maximal degree in co-relation 50770. Up to 5508 conditions per place. [2023-08-24 05:29:56,492 INFO L140 encePairwiseOnDemand]: 227/237 looper letters, 60 selfloop transitions, 29 changer transitions 34/123 dead transitions. [2023-08-24 05:29:56,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 123 transitions, 1069 flow [2023-08-24 05:29:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:29:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:29:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 817 transitions. [2023-08-24 05:29:56,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924653405666064 [2023-08-24 05:29:56,494 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 817 transitions. [2023-08-24 05:29:56,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 817 transitions. [2023-08-24 05:29:56,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:56,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 817 transitions. [2023-08-24 05:29:56,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have 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:29:56,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:29:56,498 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:29:56,498 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 475 flow. Second operand 7 states and 817 transitions. [2023-08-24 05:29:56,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 123 transitions, 1069 flow [2023-08-24 05:29:56,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 123 transitions, 1042 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-24 05:29:56,603 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 633 flow [2023-08-24 05:29:56,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=633, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2023-08-24 05:29:56,605 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-24 05:29:56,605 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 633 flow [2023-08-24 05:29:56,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 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:29:56,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:56,605 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:29:56,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:29:56,607 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:56,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1224494794, now seen corresponding path program 1 times [2023-08-24 05:29:56,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:56,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205174411] [2023-08-24 05:29:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:56,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:56,717 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:29:56,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:56,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205174411] [2023-08-24 05:29:56,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205174411] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:56,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:56,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:29:56,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336777702] [2023-08-24 05:29:56,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:56,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:56,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:56,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:56,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 237 [2023-08-24 05:29:56,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 633 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:56,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:56,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 237 [2023-08-24 05:29:56,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:57,370 INFO L124 PetriNetUnfolderBase]: 5953/8863 cut-off events. [2023-08-24 05:29:57,370 INFO L125 PetriNetUnfolderBase]: For 40996/42066 co-relation queries the response was YES. [2023-08-24 05:29:57,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32587 conditions, 8863 events. 5953/8863 cut-off events. For 40996/42066 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 54231 event pairs, 1313 based on Foata normal form. 882/9277 useless extension candidates. Maximal degree in co-relation 32554. Up to 6041 conditions per place. [2023-08-24 05:29:57,411 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 92 selfloop transitions, 10 changer transitions 11/136 dead transitions. [2023-08-24 05:29:57,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 136 transitions, 1565 flow [2023-08-24 05:29:57,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:29:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:29:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2023-08-24 05:29:57,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029535864978903 [2023-08-24 05:29:57,413 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 596 transitions. [2023-08-24 05:29:57,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 596 transitions. [2023-08-24 05:29:57,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:57,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 596 transitions. [2023-08-24 05:29:57,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have 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:29:57,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:29:57,416 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:29:57,416 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 633 flow. Second operand 5 states and 596 transitions. [2023-08-24 05:29:57,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 136 transitions, 1565 flow [2023-08-24 05:29:57,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 136 transitions, 1545 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-24 05:29:57,449 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 694 flow [2023-08-24 05:29:57,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=694, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2023-08-24 05:29:57,450 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-08-24 05:29:57,450 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 694 flow [2023-08-24 05:29:57,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:57,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:57,450 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:29:57,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:29:57,450 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:57,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:57,451 INFO L85 PathProgramCache]: Analyzing trace with hash 76552396, now seen corresponding path program 1 times [2023-08-24 05:29:57,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:57,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759011309] [2023-08-24 05:29:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:57,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:57,527 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:29:57,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:57,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759011309] [2023-08-24 05:29:57,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759011309] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:57,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:57,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:29:57,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643856077] [2023-08-24 05:29:57,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:57,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:57,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:57,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:57,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:57,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 237 [2023-08-24 05:29:57,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 694 flow. Second operand has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have 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:29:57,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:57,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 237 [2023-08-24 05:29:57,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:58,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L830-->L837: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_89 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_90 256) 0)))) (.cse0 (and .cse4 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_89) v_~z$w_buff1_used~0_88) (= v_~z~0_52 (ite .cse2 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_46 v_~z~0_53))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_88 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_22) v_~z$r_buff1_thd4~0_21) (= (ite .cse2 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd4~0_32 (ite .cse0 0 v_~z$r_buff0_thd4~0_33))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_89, ~z$w_buff1~0=v_~z$w_buff1~0_46, ~z~0=v_~z~0_53} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_88, ~z$w_buff1~0=v_~z$w_buff1~0_46, ~z~0=v_~z~0_52} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][80], [Black: 195#(and (= ~x~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 192#(= ~x~0 0), P3Thread1of1ForFork2InUse, 102#P0EXITtrue, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 174#true, 158#true, Black: 208#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#true, Black: 203#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 228#(= ~x~0 1), Black: 150#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 202#(= ~y~0 1), Black: 221#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 218#(= ~__unbuffered_cnt~0 0), Black: 219#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 132#L837true, 59#P2EXITtrue, Black: 161#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 160#(= ~__unbuffered_p3_EAX~0 0), 78#L872true, Black: 177#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 31#L771true, Black: 176#(= ~y~0 0), 216#true]) [2023-08-24 05:29:58,392 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 05:29:58,392 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:29:58,392 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:29:58,392 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:29:58,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L830-->L837: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_89 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_90 256) 0)))) (.cse0 (and .cse4 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_89) v_~z$w_buff1_used~0_88) (= v_~z~0_52 (ite .cse2 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_46 v_~z~0_53))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_88 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_22) v_~z$r_buff1_thd4~0_21) (= (ite .cse2 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd4~0_32 (ite .cse0 0 v_~z$r_buff0_thd4~0_33))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_89, ~z$w_buff1~0=v_~z$w_buff1~0_46, ~z~0=v_~z~0_53} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_88, ~z$w_buff1~0=v_~z$w_buff1~0_46, ~z~0=v_~z~0_52} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][80], [Black: 195#(and (= ~x~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P3Thread1of1ForFork2InUse, Black: 192#(= ~x~0 0), 102#P0EXITtrue, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 174#true, 54#L3true, P2Thread1of1ForFork0InUse, 158#true, Black: 208#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 203#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 202#(= ~y~0 1), Black: 149#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 228#(= ~x~0 1), Black: 150#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 221#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 218#(= ~__unbuffered_cnt~0 0), 132#L837true, 59#P2EXITtrue, Black: 161#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 108#P1EXITtrue, Black: 160#(= ~__unbuffered_p3_EAX~0 0), 219#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 200#true, Black: 177#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 176#(= ~y~0 0)]) [2023-08-24 05:29:58,408 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 05:29:58,408 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:29:58,408 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:29:58,408 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:29:58,422 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([462] L771-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.offset_7| 0) (= |v_P1Thread1of1ForFork3_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_34 1) v_~__unbuffered_cnt~0_33)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0][43], [161#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 195#(and (= ~x~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 192#(= ~x~0 0), P3Thread1of1ForFork2InUse, 102#P0EXITtrue, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 177#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 208#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#true, Black: 203#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 147#true, 48#L830true, Black: 152#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 150#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 228#(= ~x~0 1), 202#(= ~y~0 1), Black: 221#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 218#(= ~__unbuffered_cnt~0 0), Black: 219#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 59#P2EXITtrue, 108#P1EXITtrue, Black: 160#(= ~__unbuffered_p3_EAX~0 0), Black: 158#true, 78#L872true, Black: 176#(= ~y~0 0), Black: 174#true, 216#true]) [2023-08-24 05:29:58,422 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 05:29:58,422 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:29:58,422 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:29:58,422 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 05:29:58,538 INFO L124 PetriNetUnfolderBase]: 8394/12804 cut-off events. [2023-08-24 05:29:58,538 INFO L125 PetriNetUnfolderBase]: For 65249/66277 co-relation queries the response was YES. [2023-08-24 05:29:58,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58574 conditions, 12804 events. 8394/12804 cut-off events. For 65249/66277 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 84612 event pairs, 3505 based on Foata normal form. 394/12491 useless extension candidates. Maximal degree in co-relation 58539. Up to 5977 conditions per place. [2023-08-24 05:29:58,591 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 63 selfloop transitions, 12 changer transitions 28/115 dead transitions. [2023-08-24 05:29:58,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 115 transitions, 1218 flow [2023-08-24 05:29:58,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:29:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:29:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-08-24 05:29:58,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5164556962025316 [2023-08-24 05:29:58,593 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-08-24 05:29:58,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-08-24 05:29:58,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:58,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-08-24 05:29:58,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have 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:29:58,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:29:58,596 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:29:58,596 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 694 flow. Second operand 5 states and 612 transitions. [2023-08-24 05:29:58,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 115 transitions, 1218 flow [2023-08-24 05:29:58,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 115 transitions, 1205 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-24 05:29:58,677 INFO L231 Difference]: Finished difference. Result has 73 places, 63 transitions, 667 flow [2023-08-24 05:29:58,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=667, PETRI_PLACES=73, PETRI_TRANSITIONS=63} [2023-08-24 05:29:58,678 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2023-08-24 05:29:58,678 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 63 transitions, 667 flow [2023-08-24 05:29:58,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have 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:29:58,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:58,678 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:29:58,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:29:58,678 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:58,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash 662538984, now seen corresponding path program 1 times [2023-08-24 05:29:58,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:58,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237004533] [2023-08-24 05:29:58,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:58,773 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:29:58,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:58,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237004533] [2023-08-24 05:29:58,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237004533] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:58,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:58,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:29:58,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671113968] [2023-08-24 05:29:58,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:58,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:29:58,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:58,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:29:58,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:29:58,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 237 [2023-08-24 05:29:58,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 667 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have 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:29:58,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:58,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 237 [2023-08-24 05:29:58,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:59,486 INFO L124 PetriNetUnfolderBase]: 5309/8342 cut-off events. [2023-08-24 05:29:59,487 INFO L125 PetriNetUnfolderBase]: For 37742/39641 co-relation queries the response was YES. [2023-08-24 05:29:59,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36302 conditions, 8342 events. 5309/8342 cut-off events. For 37742/39641 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 55848 event pairs, 512 based on Foata normal form. 1118/9084 useless extension candidates. Maximal degree in co-relation 36264. Up to 3535 conditions per place. [2023-08-24 05:29:59,519 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 123 selfloop transitions, 18 changer transitions 16/176 dead transitions. [2023-08-24 05:29:59,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 176 transitions, 2146 flow [2023-08-24 05:29:59,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:29:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:29:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 834 transitions. [2023-08-24 05:29:59,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027124773960217 [2023-08-24 05:29:59,521 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 834 transitions. [2023-08-24 05:29:59,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 834 transitions. [2023-08-24 05:29:59,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:59,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 834 transitions. [2023-08-24 05:29:59,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have 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:29:59,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:29:59,525 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:29:59,525 INFO L175 Difference]: Start difference. First operand has 73 places, 63 transitions, 667 flow. Second operand 7 states and 834 transitions. [2023-08-24 05:29:59,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 176 transitions, 2146 flow [2023-08-24 05:29:59,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 176 transitions, 2087 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-24 05:29:59,551 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 778 flow [2023-08-24 05:29:59,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=778, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2023-08-24 05:29:59,551 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2023-08-24 05:29:59,552 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 778 flow [2023-08-24 05:29:59,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have 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:29:59,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:59,552 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:29:59,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:29:59,552 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:59,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:59,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1979376304, now seen corresponding path program 1 times [2023-08-24 05:29:59,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:59,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261785089] [2023-08-24 05:29:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:59,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:59,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261785089] [2023-08-24 05:29:59,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261785089] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:59,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:59,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:29:59,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116455216] [2023-08-24 05:29:59,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:59,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:29:59,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:59,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:29:59,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:29:59,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 237 [2023-08-24 05:29:59,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 778 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have 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:29:59,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:59,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 237 [2023-08-24 05:29:59,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:00,437 INFO L124 PetriNetUnfolderBase]: 4668/7408 cut-off events. [2023-08-24 05:30:00,437 INFO L125 PetriNetUnfolderBase]: For 39703/43202 co-relation queries the response was YES. [2023-08-24 05:30:00,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37484 conditions, 7408 events. 4668/7408 cut-off events. For 39703/43202 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 50062 event pairs, 243 based on Foata normal form. 1154/8220 useless extension candidates. Maximal degree in co-relation 37444. Up to 3229 conditions per place. [2023-08-24 05:30:00,460 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 124 selfloop transitions, 26 changer transitions 39/207 dead transitions. [2023-08-24 05:30:00,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 207 transitions, 2528 flow [2023-08-24 05:30:00,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:30:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:30:00,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1071 transitions. [2023-08-24 05:30:00,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021097046413502 [2023-08-24 05:30:00,463 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1071 transitions. [2023-08-24 05:30:00,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1071 transitions. [2023-08-24 05:30:00,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:00,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1071 transitions. [2023-08-24 05:30:00,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have 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:30:00,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have 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:30:00,467 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have 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:30:00,467 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 778 flow. Second operand 9 states and 1071 transitions. [2023-08-24 05:30:00,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 207 transitions, 2528 flow [2023-08-24 05:30:00,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 207 transitions, 2475 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-08-24 05:30:00,657 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 877 flow [2023-08-24 05:30:00,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=877, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2023-08-24 05:30:00,658 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2023-08-24 05:30:00,658 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 877 flow [2023-08-24 05:30:00,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have 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:30:00,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:00,658 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, 1] [2023-08-24 05:30:00,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:30:00,658 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:00,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:00,659 INFO L85 PathProgramCache]: Analyzing trace with hash -880357935, now seen corresponding path program 1 times [2023-08-24 05:30:00,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:00,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444911525] [2023-08-24 05:30:00,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:00,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:00,771 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:30:00,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:00,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444911525] [2023-08-24 05:30:00,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444911525] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:00,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:00,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:30:00,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555871332] [2023-08-24 05:30:00,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:00,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:30:00,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:00,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:30:00,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:30:00,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 237 [2023-08-24 05:30:00,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 877 flow. Second operand has 7 states, 7 states have (on average 109.85714285714286) internal successors, (769), 7 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have 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:30:00,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:00,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 237 [2023-08-24 05:30:00,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:01,463 INFO L124 PetriNetUnfolderBase]: 4392/7047 cut-off events. [2023-08-24 05:30:01,463 INFO L125 PetriNetUnfolderBase]: For 43027/45315 co-relation queries the response was YES. [2023-08-24 05:30:01,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36144 conditions, 7047 events. 4392/7047 cut-off events. For 43027/45315 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 48337 event pairs, 222 based on Foata normal form. 778/7485 useless extension candidates. Maximal degree in co-relation 36101. Up to 2065 conditions per place. [2023-08-24 05:30:01,492 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 70 selfloop transitions, 24 changer transitions 102/206 dead transitions. [2023-08-24 05:30:01,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 206 transitions, 2559 flow [2023-08-24 05:30:01,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 05:30:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 05:30:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1285 transitions. [2023-08-24 05:30:01,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49290372075182204 [2023-08-24 05:30:01,494 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1285 transitions. [2023-08-24 05:30:01,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1285 transitions. [2023-08-24 05:30:01,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:01,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1285 transitions. [2023-08-24 05:30:01,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 116.81818181818181) internal successors, (1285), 11 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have 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:30:01,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 237.0) internal successors, (2844), 12 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have 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:30:01,499 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 237.0) internal successors, (2844), 12 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have 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:30:01,500 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 877 flow. Second operand 11 states and 1285 transitions. [2023-08-24 05:30:01,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 206 transitions, 2559 flow [2023-08-24 05:30:01,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 206 transitions, 2414 flow, removed 47 selfloop flow, removed 9 redundant places. [2023-08-24 05:30:01,998 INFO L231 Difference]: Finished difference. Result has 89 places, 55 transitions, 512 flow [2023-08-24 05:30:01,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=512, PETRI_PLACES=89, PETRI_TRANSITIONS=55} [2023-08-24 05:30:01,998 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2023-08-24 05:30:01,998 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 55 transitions, 512 flow [2023-08-24 05:30:01,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.85714285714286) internal successors, (769), 7 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have 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:30:01,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:01,999 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, 1, 1, 1, 1] [2023-08-24 05:30:01,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:30:01,999 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:01,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:01,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1835478294, now seen corresponding path program 1 times [2023-08-24 05:30:01,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:01,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93473995] [2023-08-24 05:30:01,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:01,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:02,145 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:30:02,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:02,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93473995] [2023-08-24 05:30:02,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93473995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:02,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:02,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:30:02,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162445637] [2023-08-24 05:30:02,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:02,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:30:02,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:02,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:30:02,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:30:02,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 237 [2023-08-24 05:30:02,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 55 transitions, 512 flow. Second operand has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 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:30:02,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:02,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 237 [2023-08-24 05:30:02,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:02,369 INFO L124 PetriNetUnfolderBase]: 843/1439 cut-off events. [2023-08-24 05:30:02,369 INFO L125 PetriNetUnfolderBase]: For 7949/7949 co-relation queries the response was YES. [2023-08-24 05:30:02,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7314 conditions, 1439 events. 843/1439 cut-off events. For 7949/7949 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7003 event pairs, 142 based on Foata normal form. 1/1440 useless extension candidates. Maximal degree in co-relation 7272. Up to 798 conditions per place. [2023-08-24 05:30:02,375 INFO L140 encePairwiseOnDemand]: 226/237 looper letters, 63 selfloop transitions, 17 changer transitions 27/107 dead transitions. [2023-08-24 05:30:02,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 107 transitions, 1131 flow [2023-08-24 05:30:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:30:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:30:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 667 transitions. [2023-08-24 05:30:02,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46905766526019693 [2023-08-24 05:30:02,377 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 667 transitions. [2023-08-24 05:30:02,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 667 transitions. [2023-08-24 05:30:02,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:02,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 667 transitions. [2023-08-24 05:30:02,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have 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:30:02,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have 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:30:02,380 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have 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:30:02,381 INFO L175 Difference]: Start difference. First operand has 89 places, 55 transitions, 512 flow. Second operand 6 states and 667 transitions. [2023-08-24 05:30:02,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 107 transitions, 1131 flow [2023-08-24 05:30:02,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 824 flow, removed 74 selfloop flow, removed 22 redundant places. [2023-08-24 05:30:02,396 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 414 flow [2023-08-24 05:30:02,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2023-08-24 05:30:02,397 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2023-08-24 05:30:02,397 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 414 flow [2023-08-24 05:30:02,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 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:30:02,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:02,397 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, 1, 1, 1, 1] [2023-08-24 05:30:02,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:30:02,398 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:02,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:02,398 INFO L85 PathProgramCache]: Analyzing trace with hash -497408542, now seen corresponding path program 2 times [2023-08-24 05:30:02,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:02,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981570800] [2023-08-24 05:30:02,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:02,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:02,562 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:30:02,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:02,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981570800] [2023-08-24 05:30:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981570800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:02,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:02,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:30:02,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614188474] [2023-08-24 05:30:02,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:02,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:30:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:02,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:30:02,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:30:02,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 237 [2023-08-24 05:30:02,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have 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:30:02,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:02,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 237 [2023-08-24 05:30:02,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:02,709 INFO L124 PetriNetUnfolderBase]: 414/745 cut-off events. [2023-08-24 05:30:02,709 INFO L125 PetriNetUnfolderBase]: For 2488/2513 co-relation queries the response was YES. [2023-08-24 05:30:02,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3213 conditions, 745 events. 414/745 cut-off events. For 2488/2513 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3112 event pairs, 82 based on Foata normal form. 18/753 useless extension candidates. Maximal degree in co-relation 3192. Up to 375 conditions per place. [2023-08-24 05:30:02,712 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 36 selfloop transitions, 1 changer transitions 48/88 dead transitions. [2023-08-24 05:30:02,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 748 flow [2023-08-24 05:30:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:30:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:30:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2023-08-24 05:30:02,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021097046413502 [2023-08-24 05:30:02,713 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 595 transitions. [2023-08-24 05:30:02,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 595 transitions. [2023-08-24 05:30:02,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:02,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 595 transitions. [2023-08-24 05:30:02,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have 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:30:02,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:30:02,716 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have 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:30:02,716 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 414 flow. Second operand 5 states and 595 transitions. [2023-08-24 05:30:02,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 748 flow [2023-08-24 05:30:02,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 730 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-24 05:30:02,721 INFO L231 Difference]: Finished difference. Result has 66 places, 38 transitions, 237 flow [2023-08-24 05:30:02,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=66, PETRI_TRANSITIONS=38} [2023-08-24 05:30:02,722 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-24 05:30:02,722 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 38 transitions, 237 flow [2023-08-24 05:30:02,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have 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:30:02,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:02,722 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, 1, 1, 1, 1] [2023-08-24 05:30:02,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:30:02,722 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:02,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:02,723 INFO L85 PathProgramCache]: Analyzing trace with hash 421074394, now seen corresponding path program 3 times [2023-08-24 05:30:02,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:02,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3331340] [2023-08-24 05:30:02,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:02,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:30:03,203 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:30:03,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:30:03,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3331340] [2023-08-24 05:30:03,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3331340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:30:03,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:30:03,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:30:03,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697931039] [2023-08-24 05:30:03,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:30:03,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:30:03,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:30:03,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:30:03,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:30:03,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 237 [2023-08-24 05:30:03,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 38 transitions, 237 flow. Second operand has 8 states, 8 states have (on average 106.75) internal successors, (854), 8 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have 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:30:03,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:30:03,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 237 [2023-08-24 05:30:03,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:30:03,376 INFO L124 PetriNetUnfolderBase]: 108/220 cut-off events. [2023-08-24 05:30:03,376 INFO L125 PetriNetUnfolderBase]: For 820/825 co-relation queries the response was YES. [2023-08-24 05:30:03,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 220 events. 108/220 cut-off events. For 820/825 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 763 event pairs, 14 based on Foata normal form. 2/220 useless extension candidates. Maximal degree in co-relation 937. Up to 98 conditions per place. [2023-08-24 05:30:03,377 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 40 selfloop transitions, 3 changer transitions 23/70 dead transitions. [2023-08-24 05:30:03,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 572 flow [2023-08-24 05:30:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:30:03,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:30:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 765 transitions. [2023-08-24 05:30:03,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46112115732368897 [2023-08-24 05:30:03,379 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 765 transitions. [2023-08-24 05:30:03,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 765 transitions. [2023-08-24 05:30:03,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:30:03,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 765 transitions. [2023-08-24 05:30:03,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have 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:30:03,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:30:03,382 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have 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:30:03,382 INFO L175 Difference]: Start difference. First operand has 66 places, 38 transitions, 237 flow. Second operand 7 states and 765 transitions. [2023-08-24 05:30:03,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 572 flow [2023-08-24 05:30:03,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 472 flow, removed 9 selfloop flow, removed 17 redundant places. [2023-08-24 05:30:03,383 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 182 flow [2023-08-24 05:30:03,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2023-08-24 05:30:03,384 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-08-24 05:30:03,384 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 182 flow [2023-08-24 05:30:03,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.75) internal successors, (854), 8 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have 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:30:03,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:30:03,384 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, 1, 1, 1, 1] [2023-08-24 05:30:03,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 05:30:03,385 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:30:03,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:30:03,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1990705698, now seen corresponding path program 4 times [2023-08-24 05:30:03,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:30:03,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260975212] [2023-08-24 05:30:03,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:30:03,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:30:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:30:03,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:30:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:30:03,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:30:03,444 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:30:03,444 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 05:30:03,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 05:30:03,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 05:30:03,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 05:30:03,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 05:30:03,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 05:30:03,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 05:30:03,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 05:30:03,446 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:30:03,449 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:30:03,449 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:30:03,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:30:03 BasicIcfg [2023-08-24 05:30:03,509 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:30:03,509 INFO L158 Benchmark]: Toolchain (without parser) took 18378.50ms. Allocated memory was 339.7MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 314.9MB in the beginning and 1.2GB in the end (delta: -933.3MB). Peak memory consumption was 703.3MB. Max. memory is 16.0GB. [2023-08-24 05:30:03,509 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 339.7MB. Free memory was 316.9MB in the beginning and 316.9MB in the end (delta: 80.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:30:03,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.86ms. Allocated memory is still 339.7MB. Free memory was 314.9MB in the beginning and 291.7MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:03,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.44ms. Allocated memory is still 339.7MB. Free memory was 291.7MB in the beginning and 289.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:03,510 INFO L158 Benchmark]: Boogie Preprocessor took 29.93ms. Allocated memory is still 339.7MB. Free memory was 289.0MB in the beginning and 287.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:03,510 INFO L158 Benchmark]: RCFGBuilder took 405.47ms. Allocated memory is still 339.7MB. Free memory was 287.3MB in the beginning and 305.8MB in the end (delta: -18.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-24 05:30:03,511 INFO L158 Benchmark]: TraceAbstraction took 17448.59ms. Allocated memory was 339.7MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 304.6MB in the beginning and 1.2GB in the end (delta: -943.5MB). Peak memory consumption was 693.1MB. Max. memory is 16.0GB. [2023-08-24 05:30:03,514 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 339.7MB. Free memory was 316.9MB in the beginning and 316.9MB in the end (delta: 80.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 441.86ms. Allocated memory is still 339.7MB. Free memory was 314.9MB in the beginning and 291.7MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.44ms. Allocated memory is still 339.7MB. Free memory was 291.7MB in the beginning and 289.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.93ms. Allocated memory is still 339.7MB. Free memory was 289.0MB in the beginning and 287.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 405.47ms. Allocated memory is still 339.7MB. Free memory was 287.3MB in the beginning and 305.8MB in the end (delta: -18.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 17448.59ms. Allocated memory was 339.7MB in the beginning and 2.0GB in the end (delta: 1.6GB). Free memory was 304.6MB in the beginning and 1.2GB in the end (delta: -943.5MB). Peak memory consumption was 693.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.4s, 136 PlacesBefore, 42 PlacesAfterwards, 125 TransitionsBefore, 30 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 6600 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3336, independent: 3158, independent conditional: 0, independent unconditional: 3158, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1543, independent: 1506, independent conditional: 0, independent unconditional: 1506, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3336, independent: 1652, independent conditional: 0, independent unconditional: 1652, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 1543, unknown conditional: 0, unknown unconditional: 1543] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L854] 0 pthread_t t1061; [L855] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1061, ((void *)0), P0, ((void *)0))=-3, t1061={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 pthread_t t1062; [L857] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1062, ((void *)0), P1, ((void *)0))=-2, t1061={5:0}, t1062={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1063; [L859] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1063, ((void *)0), P2, ((void *)0))=-1, t1061={5:0}, t1062={6:0}, t1063={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1064; [L861] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1064, ((void *)0), P3, ((void *)0))=0, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 [L823] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L829] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L832] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L833] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L834] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L835] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L836] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L868] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L869] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L870] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L871] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={3:0}, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L874] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - 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: 861]: 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: 857]: 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: 855]: 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: 859]: 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 9 procedures, 164 locations, 7 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: 17.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 549 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 549 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1608 IncrementalHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 50 mSDtfsCounter, 1608 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=877occurred in iteration=10, InterpolantAutomatonStates: 89, 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.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 278 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 1505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:30:03,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...