/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 22:59:46,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 22:59:46,188 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-23 22:59:46,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 22:59:46,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 22:59:46,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 22:59:46,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 22:59:46,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 22:59:46,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 22:59:46,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 22:59:46,238 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 22:59:46,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 22:59:46,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 22:59:46,239 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 22:59:46,239 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 22:59:46,239 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 22:59:46,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 22:59:46,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 22:59:46,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 22:59:46,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 22:59:46,242 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 22:59:46,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 22:59:46,243 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 22:59:46,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 22:59:46,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 22:59:46,244 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 22:59:46,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 22:59:46,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 22:59:46,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 22:59:46,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 22:59:46,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 22:59:46,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 22:59:46,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 22:59:46,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 22:59:46,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 22:59:46,246 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 [2023-08-23 22:59:46,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 22:59:46,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 22:59:46,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 22:59:46,580 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 22:59:46,581 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 22:59:46,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2023-08-23 22:59:47,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 22:59:48,109 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 22:59:48,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2023-08-23 22:59:48,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe71b505/f823a736d6f4420390245eea59355118/FLAGedbe9beb1 [2023-08-23 22:59:48,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe71b505/f823a736d6f4420390245eea59355118 [2023-08-23 22:59:48,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 22:59:48,150 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 22:59:48,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 22:59:48,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 22:59:48,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 22:59:48,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 10:59:48" (1/1) ... [2023-08-23 22:59:48,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a031d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:48, skipping insertion in model container [2023-08-23 22:59:48,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 10:59:48" (1/1) ... [2023-08-23 22:59:48,194 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 22:59:48,349 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/mix017_power.opt_rmo.opt.i[958,971] [2023-08-23 22:59:48,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 22:59:48,582 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 22:59:48,592 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/mix017_power.opt_rmo.opt.i[958,971] [2023-08-23 22:59:48,613 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 22:59:48,615 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 22:59:48,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 22:59:48,667 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 22:59:48,668 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 22:59:48,674 INFO L206 MainTranslator]: Completed translation [2023-08-23 22:59:48,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:48 WrapperNode [2023-08-23 22:59:48,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 22:59:48,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 22:59:48,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 22:59:48,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 22:59:48,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:48" (1/1) ... [2023-08-23 22:59:48,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:48" (1/1) ... [2023-08-23 22:59:48,746 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-23 22:59:48,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 22:59:48,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 22:59:48,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 22:59:48,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 22:59:48,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:48" (1/1) ... [2023-08-23 22:59:48,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:48" (1/1) ... [2023-08-23 22:59:48,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:48" (1/1) ... [2023-08-23 22:59:48,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:48" (1/1) ... [2023-08-23 22:59:48,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:48" (1/1) ... [2023-08-23 22:59:48,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:48" (1/1) ... [2023-08-23 22:59:48,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:48" (1/1) ... [2023-08-23 22:59:48,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:48" (1/1) ... [2023-08-23 22:59:48,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 22:59:48,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 22:59:48,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 22:59:48,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 22:59:48,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:48" (1/1) ... [2023-08-23 22:59:48,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 22:59:48,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:59:48,823 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-23 22:59:48,843 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-23 22:59:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 22:59:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 22:59:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 22:59:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 22:59:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 22:59:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 22:59:48,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 22:59:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 22:59:48,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 22:59:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 22:59:48,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 22:59:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-23 22:59:48,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-23 22:59:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 22:59:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 22:59:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 22:59:48,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 22:59:48,872 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 22:59:49,042 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 22:59:49,044 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 22:59:49,362 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 22:59:49,499 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 22:59:49,499 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 22:59:49,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 10:59:49 BoogieIcfgContainer [2023-08-23 22:59:49,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 22:59:49,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 22:59:49,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 22:59:49,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 22:59:49,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 10:59:48" (1/3) ... [2023-08-23 22:59:49,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bece60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 10:59:49, skipping insertion in model container [2023-08-23 22:59:49,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:48" (2/3) ... [2023-08-23 22:59:49,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bece60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 10:59:49, skipping insertion in model container [2023-08-23 22:59:49,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 10:59:49" (3/3) ... [2023-08-23 22:59:49,509 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2023-08-23 22:59:49,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 22:59:49,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 22:59:49,526 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 22:59:49,589 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 22:59:49,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-08-23 22:59:49,667 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2023-08-23 22:59:49,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:59:49,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-23 22:59:49,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-08-23 22:59:49,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-08-23 22:59:49,686 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 22:59:49,705 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-23 22:59:49,711 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-23 22:59:49,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-08-23 22:59:49,752 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2023-08-23 22:59:49,752 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:59:49,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-23 22:59:49,755 INFO L119 LiptonReduction]: Number of co-enabled transitions 2852 [2023-08-23 22:59:53,653 INFO L134 LiptonReduction]: Checked pairs total: 7686 [2023-08-23 22:59:53,653 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-08-23 22:59:53,665 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 22:59:53,670 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;@4ff5ca47, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 22:59:53,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-23 22:59:53,675 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 22:59:53,675 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-23 22:59:53,675 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:59:53,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:53,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:53,676 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:53,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:53,680 INFO L85 PathProgramCache]: Analyzing trace with hash 361439951, now seen corresponding path program 1 times [2023-08-23 22:59:53,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:53,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247026327] [2023-08-23 22:59:53,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:53,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:54,168 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-23 22:59:54,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:54,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247026327] [2023-08-23 22:59:54,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247026327] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:54,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:54,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 22:59:54,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21584535] [2023-08-23 22:59:54,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:54,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 22:59:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:54,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 22:59:54,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 22:59:54,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 236 [2023-08-23 22:59:54,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:54,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:54,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 236 [2023-08-23 22:59:54,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:54,931 INFO L124 PetriNetUnfolderBase]: 3415/5055 cut-off events. [2023-08-23 22:59:54,931 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-08-23 22:59:54,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9883 conditions, 5055 events. 3415/5055 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 28429 event pairs, 649 based on Foata normal form. 0/4826 useless extension candidates. Maximal degree in co-relation 9871. Up to 3703 conditions per place. [2023-08-23 22:59:54,964 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 35 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-08-23 22:59:54,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 179 flow [2023-08-23 22:59:54,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 22:59:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 22:59:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-08-23 22:59:54,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5508474576271186 [2023-08-23 22:59:54,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-08-23 22:59:54,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-08-23 22:59:54,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:54,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-08-23 22:59:54,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:54,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:54,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,001 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 390 transitions. [2023-08-23 22:59:55,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 179 flow [2023-08-23 22:59:55,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-23 22:59:55,006 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-08-23 22:59:55,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, 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=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-23 22:59:55,011 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-23 22:59:55,011 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-08-23 22:59:55,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:55,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:55,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 22:59:55,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:55,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:55,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1738333228, now seen corresponding path program 1 times [2023-08-23 22:59:55,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:55,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025310850] [2023-08-23 22:59:55,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:55,194 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-23 22:59:55,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:55,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025310850] [2023-08-23 22:59:55,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025310850] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:55,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:55,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 22:59:55,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874951668] [2023-08-23 22:59:55,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:55,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 22:59:55,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:55,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 22:59:55,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 22:59:55,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 236 [2023-08-23 22:59:55,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:55,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 236 [2023-08-23 22:59:55,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:55,824 INFO L124 PetriNetUnfolderBase]: 3527/5104 cut-off events. [2023-08-23 22:59:55,825 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2023-08-23 22:59:55,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10474 conditions, 5104 events. 3527/5104 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26305 event pairs, 1111 based on Foata normal form. 240/5331 useless extension candidates. Maximal degree in co-relation 10464. Up to 2761 conditions per place. [2023-08-23 22:59:55,855 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 32 selfloop transitions, 2 changer transitions 21/58 dead transitions. [2023-08-23 22:59:55,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 244 flow [2023-08-23 22:59:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:59:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:59:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2023-08-23 22:59:55,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.514406779661017 [2023-08-23 22:59:55,857 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 607 transitions. [2023-08-23 22:59:55,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 607 transitions. [2023-08-23 22:59:55,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:55,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 607 transitions. [2023-08-23 22:59:55,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,864 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,865 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 5 states and 607 transitions. [2023-08-23 22:59:55,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 244 flow [2023-08-23 22:59:55,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 22:59:55,867 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 74 flow [2023-08-23 22:59:55,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-08-23 22:59:55,869 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-23 22:59:55,871 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 74 flow [2023-08-23 22:59:55,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:55,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:55,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 22:59:55,877 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:55,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:55,879 INFO L85 PathProgramCache]: Analyzing trace with hash 172889075, now seen corresponding path program 1 times [2023-08-23 22:59:55,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:55,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885166623] [2023-08-23 22:59:55,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:55,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:56,051 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-23 22:59:56,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:56,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885166623] [2023-08-23 22:59:56,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885166623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:56,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:56,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:59:56,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223469261] [2023-08-23 22:59:56,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:56,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 22:59:56,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:56,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 22:59:56,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 22:59:56,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-08-23 22:59:56,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:56,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-08-23 22:59:56,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:56,457 INFO L124 PetriNetUnfolderBase]: 2253/3299 cut-off events. [2023-08-23 22:59:56,457 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2023-08-23 22:59:56,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7050 conditions, 3299 events. 2253/3299 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16538 event pairs, 452 based on Foata normal form. 192/3461 useless extension candidates. Maximal degree in co-relation 7037. Up to 2372 conditions per place. [2023-08-23 22:59:56,476 INFO L140 encePairwiseOnDemand]: 229/236 looper letters, 35 selfloop transitions, 5 changer transitions 23/67 dead transitions. [2023-08-23 22:59:56,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 286 flow [2023-08-23 22:59:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:59:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:59:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2023-08-23 22:59:56,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5169491525423728 [2023-08-23 22:59:56,478 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2023-08-23 22:59:56,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2023-08-23 22:59:56,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:56,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2023-08-23 22:59:56,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,483 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,483 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 74 flow. Second operand 5 states and 610 transitions. [2023-08-23 22:59:56,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 286 flow [2023-08-23 22:59:56,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 278 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-23 22:59:56,491 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 111 flow [2023-08-23 22:59:56,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-23 22:59:56,491 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-23 22:59:56,492 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 111 flow [2023-08-23 22:59:56,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:56,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:56,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 22:59:56,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:56,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:56,493 INFO L85 PathProgramCache]: Analyzing trace with hash 101892049, now seen corresponding path program 1 times [2023-08-23 22:59:56,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:56,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651058839] [2023-08-23 22:59:56,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:56,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:56,633 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-23 22:59:56,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:56,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651058839] [2023-08-23 22:59:56,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651058839] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:56,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:56,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:59:56,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124047398] [2023-08-23 22:59:56,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:56,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:59:56,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:56,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:59:56,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:59:56,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-08-23 22:59:56,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:56,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-08-23 22:59:56,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:56,951 INFO L124 PetriNetUnfolderBase]: 1272/1982 cut-off events. [2023-08-23 22:59:56,952 INFO L125 PetriNetUnfolderBase]: For 787/787 co-relation queries the response was YES. [2023-08-23 22:59:56,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5521 conditions, 1982 events. 1272/1982 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9714 event pairs, 216 based on Foata normal form. 138/2104 useless extension candidates. Maximal degree in co-relation 5507. Up to 844 conditions per place. [2023-08-23 22:59:56,965 INFO L140 encePairwiseOnDemand]: 229/236 looper letters, 46 selfloop transitions, 9 changer transitions 23/82 dead transitions. [2023-08-23 22:59:56,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 429 flow [2023-08-23 22:59:56,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 22:59:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 22:59:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions. [2023-08-23 22:59:56,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518361581920904 [2023-08-23 22:59:56,967 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 734 transitions. [2023-08-23 22:59:56,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 734 transitions. [2023-08-23 22:59:56,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:56,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 734 transitions. [2023-08-23 22:59:56,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,973 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,973 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 111 flow. Second operand 6 states and 734 transitions. [2023-08-23 22:59:56,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 429 flow [2023-08-23 22:59:56,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-23 22:59:56,980 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 176 flow [2023-08-23 22:59:56,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-23 22:59:56,981 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-08-23 22:59:56,981 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 176 flow [2023-08-23 22:59:56,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:56,983 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-23 22:59:56,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 22:59:56,983 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:56,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:56,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1428647012, now seen corresponding path program 1 times [2023-08-23 22:59:56,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:56,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169146055] [2023-08-23 22:59:56,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:56,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:57,233 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-23 22:59:57,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:57,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169146055] [2023-08-23 22:59:57,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169146055] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:57,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:57,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:59:57,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618712518] [2023-08-23 22:59:57,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:57,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:59:57,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:57,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:59:57,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:59:57,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 236 [2023-08-23 22:59:57,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:57,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 236 [2023-08-23 22:59:57,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:57,825 INFO L124 PetriNetUnfolderBase]: 2904/4436 cut-off events. [2023-08-23 22:59:57,825 INFO L125 PetriNetUnfolderBase]: For 5978/5978 co-relation queries the response was YES. [2023-08-23 22:59:57,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14223 conditions, 4436 events. 2904/4436 cut-off events. For 5978/5978 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 22024 event pairs, 358 based on Foata normal form. 83/4519 useless extension candidates. Maximal degree in co-relation 14206. Up to 2662 conditions per place. [2023-08-23 22:59:57,860 INFO L140 encePairwiseOnDemand]: 227/236 looper letters, 92 selfloop transitions, 11 changer transitions 21/124 dead transitions. [2023-08-23 22:59:57,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 124 transitions, 847 flow [2023-08-23 22:59:57,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:59:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:59:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 811 transitions. [2023-08-23 22:59:57,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49092009685230026 [2023-08-23 22:59:57,864 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 811 transitions. [2023-08-23 22:59:57,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 811 transitions. [2023-08-23 22:59:57,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:57,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 811 transitions. [2023-08-23 22:59:57,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,870 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,870 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 176 flow. Second operand 7 states and 811 transitions. [2023-08-23 22:59:57,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 124 transitions, 847 flow [2023-08-23 22:59:57,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 124 transitions, 729 flow, removed 47 selfloop flow, removed 4 redundant places. [2023-08-23 22:59:57,897 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 225 flow [2023-08-23 22:59:57,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=225, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-08-23 22:59:57,898 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-08-23 22:59:57,898 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 225 flow [2023-08-23 22:59:57,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:57,899 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-23 22:59:57,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 22:59:57,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:57,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:57,900 INFO L85 PathProgramCache]: Analyzing trace with hash 411659646, now seen corresponding path program 2 times [2023-08-23 22:59:57,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:57,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848602107] [2023-08-23 22:59:57,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:57,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:58,083 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-23 22:59:58,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:58,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848602107] [2023-08-23 22:59:58,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848602107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:58,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:58,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 22:59:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723809518] [2023-08-23 22:59:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:58,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 22:59:58,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:58,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 22:59:58,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 22:59:58,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-08-23 22:59:58,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:58,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:58,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-08-23 22:59:58,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:58,482 INFO L124 PetriNetUnfolderBase]: 1579/2553 cut-off events. [2023-08-23 22:59:58,483 INFO L125 PetriNetUnfolderBase]: For 2750/2876 co-relation queries the response was YES. [2023-08-23 22:59:58,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8206 conditions, 2553 events. 1579/2553 cut-off events. For 2750/2876 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13530 event pairs, 267 based on Foata normal form. 191/2652 useless extension candidates. Maximal degree in co-relation 8186. Up to 800 conditions per place. [2023-08-23 22:59:58,501 INFO L140 encePairwiseOnDemand]: 229/236 looper letters, 70 selfloop transitions, 18 changer transitions 10/109 dead transitions. [2023-08-23 22:59:58,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 109 transitions, 694 flow [2023-08-23 22:59:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:59:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:59:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-08-23 22:59:58,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5181598062953995 [2023-08-23 22:59:58,504 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-08-23 22:59:58,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-08-23 22:59:58,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:58,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-08-23 22:59:58,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:58,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:58,510 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:58,510 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 225 flow. Second operand 7 states and 856 transitions. [2023-08-23 22:59:58,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 109 transitions, 694 flow [2023-08-23 22:59:58,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 109 transitions, 692 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-23 22:59:58,517 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 361 flow [2023-08-23 22:59:58,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=361, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-23 22:59:58,518 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2023-08-23 22:59:58,518 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 361 flow [2023-08-23 22:59:58,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:58,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:58,519 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-23 22:59:58,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 22:59:58,519 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:58,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:58,519 INFO L85 PathProgramCache]: Analyzing trace with hash 2124851526, now seen corresponding path program 1 times [2023-08-23 22:59:58,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:58,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163812545] [2023-08-23 22:59:58,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:58,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:59:58,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:58,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163812545] [2023-08-23 22:59:58,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163812545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:58,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:58,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:59:58,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923887451] [2023-08-23 22:59:58,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:58,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:59:58,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:58,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:59:58,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:59:58,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 236 [2023-08-23 22:59:58,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 361 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-23 22:59:58,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:58,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 236 [2023-08-23 22:59:58,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:59,305 INFO L124 PetriNetUnfolderBase]: 2694/4159 cut-off events. [2023-08-23 22:59:59,305 INFO L125 PetriNetUnfolderBase]: For 9293/9293 co-relation queries the response was YES. [2023-08-23 22:59:59,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16118 conditions, 4159 events. 2694/4159 cut-off events. For 9293/9293 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 20798 event pairs, 530 based on Foata normal form. 18/4177 useless extension candidates. Maximal degree in co-relation 16094. Up to 2989 conditions per place. [2023-08-23 22:59:59,336 INFO L140 encePairwiseOnDemand]: 227/236 looper letters, 103 selfloop transitions, 20 changer transitions 33/156 dead transitions. [2023-08-23 22:59:59,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 156 transitions, 1342 flow [2023-08-23 22:59:59,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:59:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:59:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 807 transitions. [2023-08-23 22:59:59,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48849878934624696 [2023-08-23 22:59:59,339 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 807 transitions. [2023-08-23 22:59:59,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 807 transitions. [2023-08-23 22:59:59,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:59,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 807 transitions. [2023-08-23 22:59:59,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:59,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:59,344 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:59,345 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 361 flow. Second operand 7 states and 807 transitions. [2023-08-23 22:59:59,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 156 transitions, 1342 flow [2023-08-23 22:59:59,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 156 transitions, 1164 flow, removed 72 selfloop flow, removed 2 redundant places. [2023-08-23 22:59:59,403 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 443 flow [2023-08-23 22:59:59,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=443, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2023-08-23 22:59:59,405 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-08-23 22:59:59,405 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 443 flow [2023-08-23 22:59:59,405 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-23 22:59:59,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:59,405 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-23 22:59:59,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 22:59:59,406 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:59,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:59,406 INFO L85 PathProgramCache]: Analyzing trace with hash 710062344, now seen corresponding path program 2 times [2023-08-23 22:59:59,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:59,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402030408] [2023-08-23 22:59:59,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:59,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:59,593 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-23 22:59:59,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:59,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402030408] [2023-08-23 22:59:59,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402030408] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:59,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:59,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:59:59,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111136875] [2023-08-23 22:59:59,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:59,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:59:59,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:59,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:59:59,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:59:59,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 236 [2023-08-23 22:59:59,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 443 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:59,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:59,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 236 [2023-08-23 22:59:59,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:00:00,180 INFO L124 PetriNetUnfolderBase]: 2213/3618 cut-off events. [2023-08-23 23:00:00,181 INFO L125 PetriNetUnfolderBase]: For 8972/9178 co-relation queries the response was YES. [2023-08-23 23:00:00,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13888 conditions, 3618 events. 2213/3618 cut-off events. For 8972/9178 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 20515 event pairs, 391 based on Foata normal form. 22/3501 useless extension candidates. Maximal degree in co-relation 13859. Up to 1745 conditions per place. [2023-08-23 23:00:00,208 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 68 selfloop transitions, 3 changer transitions 36/123 dead transitions. [2023-08-23 23:00:00,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 123 transitions, 1013 flow [2023-08-23 23:00:00,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:00:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:00:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2023-08-23 23:00:00,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.514406779661017 [2023-08-23 23:00:00,211 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 607 transitions. [2023-08-23 23:00:00,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 607 transitions. [2023-08-23 23:00:00,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:00:00,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 607 transitions. [2023-08-23 23:00:00,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:00,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:00,214 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:00,215 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 443 flow. Second operand 5 states and 607 transitions. [2023-08-23 23:00:00,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 123 transitions, 1013 flow [2023-08-23 23:00:00,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 123 transitions, 995 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-23 23:00:00,256 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 406 flow [2023-08-23 23:00:00,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2023-08-23 23:00:00,258 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-23 23:00:00,258 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 406 flow [2023-08-23 23:00:00,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:00,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:00:00,259 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-23 23:00:00,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:00:00,259 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:00:00,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:00:00,266 INFO L85 PathProgramCache]: Analyzing trace with hash 540678000, now seen corresponding path program 3 times [2023-08-23 23:00:00,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:00:00,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222226332] [2023-08-23 23:00:00,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:00:00,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:00:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:00:00,476 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-23 23:00:00,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:00:00,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222226332] [2023-08-23 23:00:00,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222226332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:00:00,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:00:00,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:00:00,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397686196] [2023-08-23 23:00:00,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:00:00,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:00:00,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:00:00,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:00:00,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:00:00,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 236 [2023-08-23 23:00:00,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 406 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:00,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:00:00,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 236 [2023-08-23 23:00:00,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:00:01,041 INFO L124 PetriNetUnfolderBase]: 2481/4113 cut-off events. [2023-08-23 23:00:01,041 INFO L125 PetriNetUnfolderBase]: For 9118/9194 co-relation queries the response was YES. [2023-08-23 23:00:01,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15389 conditions, 4113 events. 2481/4113 cut-off events. For 9118/9194 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 24253 event pairs, 429 based on Foata normal form. 24/3991 useless extension candidates. Maximal degree in co-relation 15360. Up to 1912 conditions per place. [2023-08-23 23:00:01,066 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 62 selfloop transitions, 3 changer transitions 44/119 dead transitions. [2023-08-23 23:00:01,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 119 transitions, 965 flow [2023-08-23 23:00:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:00:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:00:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2023-08-23 23:00:01,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.514406779661017 [2023-08-23 23:00:01,069 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 607 transitions. [2023-08-23 23:00:01,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 607 transitions. [2023-08-23 23:00:01,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:00:01,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 607 transitions. [2023-08-23 23:00:01,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:01,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:01,073 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:01,073 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 406 flow. Second operand 5 states and 607 transitions. [2023-08-23 23:00:01,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 119 transitions, 965 flow [2023-08-23 23:00:01,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 119 transitions, 955 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-23 23:00:01,123 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 347 flow [2023-08-23 23:00:01,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2023-08-23 23:00:01,124 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2023-08-23 23:00:01,124 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 347 flow [2023-08-23 23:00:01,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:01,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:00:01,125 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-23 23:00:01,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:00:01,125 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:00:01,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:00:01,125 INFO L85 PathProgramCache]: Analyzing trace with hash 89444128, now seen corresponding path program 4 times [2023-08-23 23:00:01,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:00:01,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593998392] [2023-08-23 23:00:01,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:00:01,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:00:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:00:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:00:01,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:00:01,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593998392] [2023-08-23 23:00:01,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593998392] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:00:01,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:00:01,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:00:01,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869789834] [2023-08-23 23:00:01,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:00:01,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:00:01,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:00:01,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:00:01,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:00:01,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-08-23 23:00:01,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 347 flow. Second operand has 7 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:01,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:00:01,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-08-23 23:00:01,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:00:01,745 INFO L124 PetriNetUnfolderBase]: 1425/2383 cut-off events. [2023-08-23 23:00:01,745 INFO L125 PetriNetUnfolderBase]: For 5362/5493 co-relation queries the response was YES. [2023-08-23 23:00:01,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8710 conditions, 2383 events. 1425/2383 cut-off events. For 5362/5493 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13316 event pairs, 250 based on Foata normal form. 69/2383 useless extension candidates. Maximal degree in co-relation 8684. Up to 896 conditions per place. [2023-08-23 23:00:01,756 INFO L140 encePairwiseOnDemand]: 229/236 looper letters, 39 selfloop transitions, 18 changer transitions 33/96 dead transitions. [2023-08-23 23:00:01,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 96 transitions, 721 flow [2023-08-23 23:00:01,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:00:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:00:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 954 transitions. [2023-08-23 23:00:01,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052966101694916 [2023-08-23 23:00:01,759 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 954 transitions. [2023-08-23 23:00:01,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 954 transitions. [2023-08-23 23:00:01,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:00:01,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 954 transitions. [2023-08-23 23:00:01,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.25) internal successors, (954), 8 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:01,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:01,765 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:01,765 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 347 flow. Second operand 8 states and 954 transitions. [2023-08-23 23:00:01,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 96 transitions, 721 flow [2023-08-23 23:00:01,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 96 transitions, 666 flow, removed 14 selfloop flow, removed 7 redundant places. [2023-08-23 23:00:01,799 INFO L231 Difference]: Finished difference. Result has 71 places, 42 transitions, 288 flow [2023-08-23 23:00:01,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=288, PETRI_PLACES=71, PETRI_TRANSITIONS=42} [2023-08-23 23:00:01,799 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2023-08-23 23:00:01,800 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 42 transitions, 288 flow [2023-08-23 23:00:01,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:01,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:00:01,800 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, 1] [2023-08-23 23:00:01,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:00:01,800 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:00:01,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:00:01,801 INFO L85 PathProgramCache]: Analyzing trace with hash 149175588, now seen corresponding path program 1 times [2023-08-23 23:00:01,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:00:01,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571062532] [2023-08-23 23:00:01,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:00:01,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:00:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:00:02,175 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-23 23:00:02,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:00:02,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571062532] [2023-08-23 23:00:02,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571062532] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:00:02,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:00:02,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:00:02,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172667493] [2023-08-23 23:00:02,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:00:02,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:00:02,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:00:02,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:00:02,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:00:02,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 236 [2023-08-23 23:00:02,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 42 transitions, 288 flow. Second operand has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:02,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:00:02,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 236 [2023-08-23 23:00:02,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:00:02,524 INFO L124 PetriNetUnfolderBase]: 1127/1933 cut-off events. [2023-08-23 23:00:02,524 INFO L125 PetriNetUnfolderBase]: For 5604/5654 co-relation queries the response was YES. [2023-08-23 23:00:02,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7835 conditions, 1933 events. 1127/1933 cut-off events. For 5604/5654 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10657 event pairs, 197 based on Foata normal form. 3/1858 useless extension candidates. Maximal degree in co-relation 7805. Up to 840 conditions per place. [2023-08-23 23:00:02,534 INFO L140 encePairwiseOnDemand]: 229/236 looper letters, 71 selfloop transitions, 6 changer transitions 48/131 dead transitions. [2023-08-23 23:00:02,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 1220 flow [2023-08-23 23:00:02,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:00:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:00:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 817 transitions. [2023-08-23 23:00:02,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49455205811138014 [2023-08-23 23:00:02,537 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 817 transitions. [2023-08-23 23:00:02,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 817 transitions. [2023-08-23 23:00:02,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:00:02,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 817 transitions. [2023-08-23 23:00:02,540 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-23 23:00:02,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:02,542 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:02,543 INFO L175 Difference]: Start difference. First operand has 71 places, 42 transitions, 288 flow. Second operand 7 states and 817 transitions. [2023-08-23 23:00:02,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 1220 flow [2023-08-23 23:00:02,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 131 transitions, 916 flow, removed 84 selfloop flow, removed 10 redundant places. [2023-08-23 23:00:02,581 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 257 flow [2023-08-23 23:00:02,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=257, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2023-08-23 23:00:02,582 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-08-23 23:00:02,582 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 257 flow [2023-08-23 23:00:02,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:02,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:00:02,583 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, 1] [2023-08-23 23:00:02,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 23:00:02,583 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:00:02,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:00:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1512825910, now seen corresponding path program 2 times [2023-08-23 23:00:02,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:00:02,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739845141] [2023-08-23 23:00:02,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:00:02,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:00:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:00:02,750 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-23 23:00:02,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:00:02,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739845141] [2023-08-23 23:00:02,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739845141] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:00:02,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:00:02,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:00:02,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011445427] [2023-08-23 23:00:02,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:00:02,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:00:02,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:00:02,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:00:02,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:00:02,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 236 [2023-08-23 23:00:02,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:02,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:00:02,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 236 [2023-08-23 23:00:02,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:00:03,077 INFO L124 PetriNetUnfolderBase]: 1443/2410 cut-off events. [2023-08-23 23:00:03,077 INFO L125 PetriNetUnfolderBase]: For 5259/5274 co-relation queries the response was YES. [2023-08-23 23:00:03,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9100 conditions, 2410 events. 1443/2410 cut-off events. For 5259/5274 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13330 event pairs, 434 based on Foata normal form. 2/2357 useless extension candidates. Maximal degree in co-relation 9077. Up to 1037 conditions per place. [2023-08-23 23:00:03,086 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 42 selfloop transitions, 1 changer transitions 49/94 dead transitions. [2023-08-23 23:00:03,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 94 transitions, 716 flow [2023-08-23 23:00:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:00:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:00:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2023-08-23 23:00:03,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49491525423728816 [2023-08-23 23:00:03,089 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2023-08-23 23:00:03,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2023-08-23 23:00:03,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:00:03,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2023-08-23 23:00:03,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:03,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:03,092 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:03,092 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 257 flow. Second operand 5 states and 584 transitions. [2023-08-23 23:00:03,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 94 transitions, 716 flow [2023-08-23 23:00:03,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 706 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-23 23:00:03,118 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 233 flow [2023-08-23 23:00:03,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2023-08-23 23:00:03,118 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2023-08-23 23:00:03,118 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 233 flow [2023-08-23 23:00:03,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:03,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:00:03,119 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, 1] [2023-08-23 23:00:03,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-23 23:00:03,119 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:00:03,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:00:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1866302834, now seen corresponding path program 3 times [2023-08-23 23:00:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:00:03,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419729051] [2023-08-23 23:00:03,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:00:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:00:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:00:03,830 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-23 23:00:03,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:00:03,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419729051] [2023-08-23 23:00:03,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419729051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:00:03,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:00:03,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:00:03,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238185944] [2023-08-23 23:00:03,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:00:03,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 23:00:03,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:00:03,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 23:00:03,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-23 23:00:03,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 236 [2023-08-23 23:00:03,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 233 flow. Second operand has 8 states, 8 states have (on average 107.875) internal successors, (863), 8 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:03,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:00:03,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 236 [2023-08-23 23:00:03,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:00:04,091 INFO L124 PetriNetUnfolderBase]: 550/930 cut-off events. [2023-08-23 23:00:04,092 INFO L125 PetriNetUnfolderBase]: For 1875/1895 co-relation queries the response was YES. [2023-08-23 23:00:04,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3401 conditions, 930 events. 550/930 cut-off events. For 1875/1895 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4132 event pairs, 162 based on Foata normal form. 15/917 useless extension candidates. Maximal degree in co-relation 3377. Up to 438 conditions per place. [2023-08-23 23:00:04,096 INFO L140 encePairwiseOnDemand]: 229/236 looper letters, 39 selfloop transitions, 4 changer transitions 40/87 dead transitions. [2023-08-23 23:00:04,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 87 transitions, 641 flow [2023-08-23 23:00:04,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:00:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:00:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 890 transitions. [2023-08-23 23:00:04,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713983050847458 [2023-08-23 23:00:04,099 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 890 transitions. [2023-08-23 23:00:04,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 890 transitions. [2023-08-23 23:00:04,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:00:04,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 890 transitions. [2023-08-23 23:00:04,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.25) internal successors, (890), 8 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:04,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:04,105 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:04,105 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 233 flow. Second operand 8 states and 890 transitions. [2023-08-23 23:00:04,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 87 transitions, 641 flow [2023-08-23 23:00:04,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 87 transitions, 614 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-08-23 23:00:04,114 INFO L231 Difference]: Finished difference. Result has 70 places, 41 transitions, 224 flow [2023-08-23 23:00:04,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=70, PETRI_TRANSITIONS=41} [2023-08-23 23:00:04,115 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2023-08-23 23:00:04,115 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 41 transitions, 224 flow [2023-08-23 23:00:04,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.875) internal successors, (863), 8 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:00:04,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:00:04,116 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, 1] [2023-08-23 23:00:04,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-23 23:00:04,116 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:00:04,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:00:04,117 INFO L85 PathProgramCache]: Analyzing trace with hash 872350752, now seen corresponding path program 4 times [2023-08-23 23:00:04,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:00:04,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151674882] [2023-08-23 23:00:04,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:00:04,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:00:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:00:04,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:00:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:00:04,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:00:04,251 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:00:04,251 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-23 23:00:04,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-23 23:00:04,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-23 23:00:04,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-23 23:00:04,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-23 23:00:04,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-23 23:00:04,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-23 23:00:04,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-23 23:00:04,256 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 2, 1, 1, 1, 1] [2023-08-23 23:00:04,262 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:00:04,262 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:00:04,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:00:04 BasicIcfg [2023-08-23 23:00:04,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:00:04,357 INFO L158 Benchmark]: Toolchain (without parser) took 16207.29ms. Allocated memory was 367.0MB in the beginning and 671.1MB in the end (delta: 304.1MB). Free memory was 342.6MB in the beginning and 402.9MB in the end (delta: -60.3MB). Peak memory consumption was 244.3MB. Max. memory is 16.0GB. [2023-08-23 23:00:04,357 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 367.0MB. Free memory is still 344.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:00:04,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.55ms. Allocated memory is still 367.0MB. Free memory was 342.6MB in the beginning and 318.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 23:00:04,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.31ms. Allocated memory is still 367.0MB. Free memory was 318.9MB in the beginning and 316.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:00:04,358 INFO L158 Benchmark]: Boogie Preprocessor took 46.51ms. Allocated memory is still 367.0MB. Free memory was 316.5MB in the beginning and 314.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:00:04,358 INFO L158 Benchmark]: RCFGBuilder took 707.00ms. Allocated memory is still 367.0MB. Free memory was 314.4MB in the beginning and 334.7MB in the end (delta: -20.3MB). Peak memory consumption was 33.7MB. Max. memory is 16.0GB. [2023-08-23 23:00:04,358 INFO L158 Benchmark]: TraceAbstraction took 14853.67ms. Allocated memory was 367.0MB in the beginning and 671.1MB in the end (delta: 304.1MB). Free memory was 334.7MB in the beginning and 402.9MB in the end (delta: -68.2MB). Peak memory consumption was 235.8MB. Max. memory is 16.0GB. [2023-08-23 23:00:04,359 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 367.0MB. Free memory is still 344.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 524.55ms. Allocated memory is still 367.0MB. Free memory was 342.6MB in the beginning and 318.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 71.31ms. Allocated memory is still 367.0MB. Free memory was 318.9MB in the beginning and 316.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.51ms. Allocated memory is still 367.0MB. Free memory was 316.5MB in the beginning and 314.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 707.00ms. Allocated memory is still 367.0MB. Free memory was 314.4MB in the beginning and 334.7MB in the end (delta: -20.3MB). Peak memory consumption was 33.7MB. Max. memory is 16.0GB. * TraceAbstraction took 14853.67ms. Allocated memory was 367.0MB in the beginning and 671.1MB in the end (delta: 304.1MB). Free memory was 334.7MB in the beginning and 402.9MB in the end (delta: -68.2MB). Peak memory consumption was 235.8MB. 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.9s, 137 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 30 TransitionsAfterwards, 2852 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 7686 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3764, independent: 3549, independent conditional: 0, independent unconditional: 3549, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1544, independent: 1511, independent conditional: 0, independent unconditional: 1511, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3764, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1544, unknown conditional: 0, unknown unconditional: 1544] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 133, Positive conditional cache size: 0, Positive unconditional cache size: 133, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t437; [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t437, ((void *)0), P0, ((void *)0))=-2, t437={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t438; [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t438, ((void *)0), P1, ((void *)0))=-1, t437={5:0}, t438={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t439; [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t439, ((void *)0), P2, ((void *)0))=0, t437={5:0}, t438={6:0}, t439={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t440; [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t440, ((void *)0), P3, ((void *)0))=1, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 2 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 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_p0_EAX=0, __unbuffered_p1_EAX=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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 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: 865]: 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: 863]: 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, 165 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: 14.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 505 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 505 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1790 IncrementalHoareTripleChecker+Invalid, 1825 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 23 mSDtfsCounter, 1790 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=443occurred in iteration=7, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 1226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-23 23:00:04,384 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...