/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:25:00,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:25:00,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 05:25:00,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:25:00,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:25:00,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:25:00,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:25:00,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:25:00,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:25:00,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:25:00,802 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:25:00,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:25:00,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:25:00,803 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:25:00,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:25:00,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:25:00,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:25:00,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:25:00,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:25:00,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:25:00,806 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:25:00,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:25:00,806 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:25:00,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:25:00,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:25:00,807 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:25:00,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:25:00,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:25:00,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:25:00,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:25:00,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:25:00,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:25:00,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:25:00,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:25:00,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:25:00,810 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:25:01,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:25:01,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:25:01,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:25:01,175 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:25:01,175 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:25:01,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019.opt.i [2023-08-24 05:25:02,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:25:02,533 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:25:02,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019.opt.i [2023-08-24 05:25:02,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5346d0b6f/88e115c926ef469c843373b0003c7962/FLAGb7338904a [2023-08-24 05:25:02,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5346d0b6f/88e115c926ef469c843373b0003c7962 [2023-08-24 05:25:02,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:25:02,575 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:25:02,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:25:02,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:25:02,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:25:02,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:25:02" (1/1) ... [2023-08-24 05:25:02,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ef40cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:02, skipping insertion in model container [2023-08-24 05:25:02,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:25:02" (1/1) ... [2023-08-24 05:25:02,641 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:25:02,803 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/mix019.opt.i[944,957] [2023-08-24 05:25:02,969 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:25:02,979 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:25:02,988 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/mix019.opt.i[944,957] [2023-08-24 05:25:02,996 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:25:02,998 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:25:03,029 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:25:03,059 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:25:03,059 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:25:03,065 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:25:03,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:03 WrapperNode [2023-08-24 05:25:03,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:25:03,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:25:03,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:25:03,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:25:03,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:03" (1/1) ... [2023-08-24 05:25:03,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:03" (1/1) ... [2023-08-24 05:25:03,146 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2023-08-24 05:25:03,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:25:03,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:25:03,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:25:03,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:25:03,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:03" (1/1) ... [2023-08-24 05:25:03,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:03" (1/1) ... [2023-08-24 05:25:03,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:03" (1/1) ... [2023-08-24 05:25:03,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:03" (1/1) ... [2023-08-24 05:25:03,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:03" (1/1) ... [2023-08-24 05:25:03,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:03" (1/1) ... [2023-08-24 05:25:03,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:03" (1/1) ... [2023-08-24 05:25:03,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:03" (1/1) ... [2023-08-24 05:25:03,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:25:03,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:25:03,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:25:03,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:25:03,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:03" (1/1) ... [2023-08-24 05:25:03,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:25:03,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:25:03,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 05:25:03,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 05:25:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:25:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:25:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:25:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:25:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:25:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:25:03,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:25:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:25:03,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:25:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:25:03,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:25:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:25:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:25:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:25:03,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:25:03,277 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:25:03,409 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:25:03,411 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:25:03,755 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:25:03,871 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:25:03,872 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:25:03,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:25:03 BoogieIcfgContainer [2023-08-24 05:25:03,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:25:03,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:25:03,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:25:03,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:25:03,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:25:02" (1/3) ... [2023-08-24 05:25:03,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e58752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:25:03, skipping insertion in model container [2023-08-24 05:25:03,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:25:03" (2/3) ... [2023-08-24 05:25:03,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e58752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:25:03, skipping insertion in model container [2023-08-24 05:25:03,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:25:03" (3/3) ... [2023-08-24 05:25:03,882 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019.opt.i [2023-08-24 05:25:03,898 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:25:03,899 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:25:03,899 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:25:03,962 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:25:04,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-08-24 05:25:04,059 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events. [2023-08-24 05:25:04,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:25:04,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-24 05:25:04,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-08-24 05:25:04,069 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-08-24 05:25:04,072 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:25:04,083 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-24 05:25:04,086 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-24 05:25:04,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-08-24 05:25:04,132 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events. [2023-08-24 05:25:04,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:25:04,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-24 05:25:04,135 INFO L119 LiptonReduction]: Number of co-enabled transitions 1758 [2023-08-24 05:25:07,373 INFO L134 LiptonReduction]: Checked pairs total: 4661 [2023-08-24 05:25:07,374 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-08-24 05:25:07,385 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:25:07,390 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;@f18774d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:25:07,390 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 05:25:07,394 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:25:07,394 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-24 05:25:07,394 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:25:07,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:07,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:07,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:25:07,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash 992158827, now seen corresponding path program 1 times [2023-08-24 05:25:07,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:07,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294978343] [2023-08-24 05:25:07,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:07,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:07,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:07,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294978343] [2023-08-24 05:25:07,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294978343] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:07,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:07,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:25:07,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291574046] [2023-08-24 05:25:07,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:07,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:25:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:07,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:25:07,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:25:07,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 199 [2023-08-24 05:25:07,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:07,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:07,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 199 [2023-08-24 05:25:07,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:08,032 INFO L124 PetriNetUnfolderBase]: 910/1447 cut-off events. [2023-08-24 05:25:08,033 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-24 05:25:08,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1447 events. 910/1447 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7047 event pairs, 146 based on Foata normal form. 60/1386 useless extension candidates. Maximal degree in co-relation 2834. Up to 1101 conditions per place. [2023-08-24 05:25:08,046 INFO L140 encePairwiseOnDemand]: 195/199 looper letters, 26 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2023-08-24 05:25:08,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 141 flow [2023-08-24 05:25:08,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:25:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:25:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-08-24 05:25:08,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5360134003350083 [2023-08-24 05:25:08,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-08-24 05:25:08,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-08-24 05:25:08,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:08,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-08-24 05:25:08,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:08,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:08,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:08,077 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 320 transitions. [2023-08-24 05:25:08,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 141 flow [2023-08-24 05:25:08,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 05:25:08,081 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-08-24 05:25:08,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-24 05:25:08,085 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-08-24 05:25:08,085 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-08-24 05:25:08,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:08,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:08,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:08,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:25:08,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:25:08,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:08,087 INFO L85 PathProgramCache]: Analyzing trace with hash -559402200, now seen corresponding path program 1 times [2023-08-24 05:25:08,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:08,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926506957] [2023-08-24 05:25:08,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:08,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:08,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:08,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926506957] [2023-08-24 05:25:08,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926506957] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:08,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:08,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:25:08,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070626679] [2023-08-24 05:25:08,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:08,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:25:08,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:08,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:25:08,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:25:08,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 199 [2023-08-24 05:25:08,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:08,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:08,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 199 [2023-08-24 05:25:08,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:08,638 INFO L124 PetriNetUnfolderBase]: 1637/2514 cut-off events. [2023-08-24 05:25:08,639 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2023-08-24 05:25:08,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5210 conditions, 2514 events. 1637/2514 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12129 event pairs, 509 based on Foata normal form. 140/2654 useless extension candidates. Maximal degree in co-relation 5200. Up to 1523 conditions per place. [2023-08-24 05:25:08,650 INFO L140 encePairwiseOnDemand]: 191/199 looper letters, 31 selfloop transitions, 6 changer transitions 23/60 dead transitions. [2023-08-24 05:25:08,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 60 transitions, 258 flow [2023-08-24 05:25:08,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:25:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:25:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 482 transitions. [2023-08-24 05:25:08,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4844221105527638 [2023-08-24 05:25:08,652 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 482 transitions. [2023-08-24 05:25:08,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 482 transitions. [2023-08-24 05:25:08,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:08,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 482 transitions. [2023-08-24 05:25:08,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:08,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:08,658 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:08,658 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 482 transitions. [2023-08-24 05:25:08,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 60 transitions, 258 flow [2023-08-24 05:25:08,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 60 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:25:08,662 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 108 flow [2023-08-24 05:25:08,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-24 05:25:08,663 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-08-24 05:25:08,664 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 108 flow [2023-08-24 05:25:08,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:08,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:08,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:08,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:25:08,671 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:25:08,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:08,674 INFO L85 PathProgramCache]: Analyzing trace with hash -161624351, now seen corresponding path program 1 times [2023-08-24 05:25:08,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:08,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020009222] [2023-08-24 05:25:08,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:08,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:08,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:08,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020009222] [2023-08-24 05:25:08,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020009222] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:08,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:08,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:25:08,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715699969] [2023-08-24 05:25:08,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:08,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:25:08,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:08,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:25:08,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:25:08,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 199 [2023-08-24 05:25:08,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:08,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:08,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 199 [2023-08-24 05:25:08,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:09,108 INFO L124 PetriNetUnfolderBase]: 1131/1825 cut-off events. [2023-08-24 05:25:09,108 INFO L125 PetriNetUnfolderBase]: For 1396/1413 co-relation queries the response was YES. [2023-08-24 05:25:09,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4994 conditions, 1825 events. 1131/1825 cut-off events. For 1396/1413 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9073 event pairs, 373 based on Foata normal form. 106/1917 useless extension candidates. Maximal degree in co-relation 4980. Up to 1083 conditions per place. [2023-08-24 05:25:09,121 INFO L140 encePairwiseOnDemand]: 195/199 looper letters, 27 selfloop transitions, 3 changer transitions 16/50 dead transitions. [2023-08-24 05:25:09,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 50 transitions, 286 flow [2023-08-24 05:25:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:25:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:25:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2023-08-24 05:25:09,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4934673366834171 [2023-08-24 05:25:09,123 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 491 transitions. [2023-08-24 05:25:09,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 491 transitions. [2023-08-24 05:25:09,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:09,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 491 transitions. [2023-08-24 05:25:09,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:09,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:09,128 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:09,128 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 108 flow. Second operand 5 states and 491 transitions. [2023-08-24 05:25:09,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 50 transitions, 286 flow [2023-08-24 05:25:09,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 50 transitions, 262 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 05:25:09,134 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 109 flow [2023-08-24 05:25:09,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-24 05:25:09,135 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-08-24 05:25:09,135 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 109 flow [2023-08-24 05:25:09,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:09,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:09,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:09,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:25:09,136 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:25:09,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:09,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2097312661, now seen corresponding path program 1 times [2023-08-24 05:25:09,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:09,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066028053] [2023-08-24 05:25:09,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:09,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:09,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:09,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066028053] [2023-08-24 05:25:09,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066028053] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:09,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:09,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:25:09,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047969641] [2023-08-24 05:25:09,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:09,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:25:09,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:09,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:25:09,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:25:09,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 199 [2023-08-24 05:25:09,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:09,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:09,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 199 [2023-08-24 05:25:09,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:09,694 INFO L124 PetriNetUnfolderBase]: 1300/2027 cut-off events. [2023-08-24 05:25:09,694 INFO L125 PetriNetUnfolderBase]: For 1606/1606 co-relation queries the response was YES. [2023-08-24 05:25:09,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5617 conditions, 2027 events. 1300/2027 cut-off events. For 1606/1606 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9547 event pairs, 285 based on Foata normal form. 94/2121 useless extension candidates. Maximal degree in co-relation 5600. Up to 1227 conditions per place. [2023-08-24 05:25:09,708 INFO L140 encePairwiseOnDemand]: 191/199 looper letters, 41 selfloop transitions, 10 changer transitions 23/74 dead transitions. [2023-08-24 05:25:09,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 74 transitions, 416 flow [2023-08-24 05:25:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:25:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:25:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2023-08-24 05:25:09,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47595118449389806 [2023-08-24 05:25:09,711 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 663 transitions. [2023-08-24 05:25:09,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 663 transitions. [2023-08-24 05:25:09,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:09,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 663 transitions. [2023-08-24 05:25:09,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:09,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:09,716 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:09,716 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 109 flow. Second operand 7 states and 663 transitions. [2023-08-24 05:25:09,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 74 transitions, 416 flow [2023-08-24 05:25:09,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 74 transitions, 398 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-24 05:25:09,731 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 162 flow [2023-08-24 05:25:09,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-24 05:25:09,733 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-08-24 05:25:09,733 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 162 flow [2023-08-24 05:25:09,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:09,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:09,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:09,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:25:09,734 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:25:09,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:09,735 INFO L85 PathProgramCache]: Analyzing trace with hash -590882206, now seen corresponding path program 1 times [2023-08-24 05:25:09,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:09,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128846619] [2023-08-24 05:25:09,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:09,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:09,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:09,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128846619] [2023-08-24 05:25:09,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128846619] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:09,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:09,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:25:09,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808378033] [2023-08-24 05:25:09,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:09,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:25:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:25:09,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:25:09,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 199 [2023-08-24 05:25:09,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:09,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:09,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 199 [2023-08-24 05:25:09,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:10,083 INFO L124 PetriNetUnfolderBase]: 555/947 cut-off events. [2023-08-24 05:25:10,083 INFO L125 PetriNetUnfolderBase]: For 1214/1245 co-relation queries the response was YES. [2023-08-24 05:25:10,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2941 conditions, 947 events. 555/947 cut-off events. For 1214/1245 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4368 event pairs, 141 based on Foata normal form. 48/977 useless extension candidates. Maximal degree in co-relation 2922. Up to 782 conditions per place. [2023-08-24 05:25:10,090 INFO L140 encePairwiseOnDemand]: 194/199 looper letters, 38 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-24 05:25:10,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 324 flow [2023-08-24 05:25:10,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:25:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:25:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2023-08-24 05:25:10,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125628140703518 [2023-08-24 05:25:10,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2023-08-24 05:25:10,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2023-08-24 05:25:10,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:10,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2023-08-24 05:25:10,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:10,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:10,094 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:10,094 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 162 flow. Second operand 3 states and 306 transitions. [2023-08-24 05:25:10,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 324 flow [2023-08-24 05:25:10,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 314 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-24 05:25:10,099 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 180 flow [2023-08-24 05:25:10,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-24 05:25:10,099 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2023-08-24 05:25:10,100 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 180 flow [2023-08-24 05:25:10,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:10,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:10,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:10,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:25:10,100 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:25:10,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:10,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1810604313, now seen corresponding path program 1 times [2023-08-24 05:25:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:10,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590034174] [2023-08-24 05:25:10,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:10,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:10,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590034174] [2023-08-24 05:25:10,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590034174] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:10,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:10,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:25:10,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979345984] [2023-08-24 05:25:10,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:10,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:25:10,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:10,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:25:10,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:25:10,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 199 [2023-08-24 05:25:10,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:10,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:10,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 199 [2023-08-24 05:25:10,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:10,504 INFO L124 PetriNetUnfolderBase]: 813/1396 cut-off events. [2023-08-24 05:25:10,504 INFO L125 PetriNetUnfolderBase]: For 1419/1419 co-relation queries the response was YES. [2023-08-24 05:25:10,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4720 conditions, 1396 events. 813/1396 cut-off events. For 1419/1419 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6741 event pairs, 244 based on Foata normal form. 38/1434 useless extension candidates. Maximal degree in co-relation 4701. Up to 654 conditions per place. [2023-08-24 05:25:10,512 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 44 selfloop transitions, 8 changer transitions 17/69 dead transitions. [2023-08-24 05:25:10,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 468 flow [2023-08-24 05:25:10,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:25:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:25:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 564 transitions. [2023-08-24 05:25:10,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723618090452261 [2023-08-24 05:25:10,515 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 564 transitions. [2023-08-24 05:25:10,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 564 transitions. [2023-08-24 05:25:10,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:10,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 564 transitions. [2023-08-24 05:25:10,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:10,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:10,518 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:10,518 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 180 flow. Second operand 6 states and 564 transitions. [2023-08-24 05:25:10,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 468 flow [2023-08-24 05:25:10,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 69 transitions, 461 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:25:10,523 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 203 flow [2023-08-24 05:25:10,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-08-24 05:25:10,524 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-08-24 05:25:10,524 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 203 flow [2023-08-24 05:25:10,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:10,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:10,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:10,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:25:10,525 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:25:10,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1812893544, now seen corresponding path program 1 times [2023-08-24 05:25:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794377689] [2023-08-24 05:25:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:10,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:10,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:10,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794377689] [2023-08-24 05:25:10,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794377689] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:10,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:10,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:25:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452490270] [2023-08-24 05:25:10,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:10,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:25:10,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:25:10,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:25:10,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 199 [2023-08-24 05:25:10,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:10,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:10,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 199 [2023-08-24 05:25:10,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:10,860 INFO L124 PetriNetUnfolderBase]: 300/585 cut-off events. [2023-08-24 05:25:10,860 INFO L125 PetriNetUnfolderBase]: For 766/779 co-relation queries the response was YES. [2023-08-24 05:25:10,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 585 events. 300/585 cut-off events. For 766/779 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2716 event pairs, 63 based on Foata normal form. 65/643 useless extension candidates. Maximal degree in co-relation 2002. Up to 243 conditions per place. [2023-08-24 05:25:10,864 INFO L140 encePairwiseOnDemand]: 194/199 looper letters, 45 selfloop transitions, 7 changer transitions 4/61 dead transitions. [2023-08-24 05:25:10,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 464 flow [2023-08-24 05:25:10,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:25:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:25:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2023-08-24 05:25:10,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125628140703518 [2023-08-24 05:25:10,866 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 408 transitions. [2023-08-24 05:25:10,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 408 transitions. [2023-08-24 05:25:10,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:10,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 408 transitions. [2023-08-24 05:25:10,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:10,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:10,869 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:10,869 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 203 flow. Second operand 4 states and 408 transitions. [2023-08-24 05:25:10,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 464 flow [2023-08-24 05:25:10,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 422 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-24 05:25:10,872 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 212 flow [2023-08-24 05:25:10,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-24 05:25:10,873 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2023-08-24 05:25:10,874 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 212 flow [2023-08-24 05:25:10,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:10,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:10,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:10,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:25:10,874 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:25:10,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:10,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1536475098, now seen corresponding path program 1 times [2023-08-24 05:25:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:10,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057513840] [2023-08-24 05:25:10,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:10,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:11,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:11,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057513840] [2023-08-24 05:25:11,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057513840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:11,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:11,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:25:11,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930816335] [2023-08-24 05:25:11,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:11,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:25:11,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:11,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:25:11,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:25:11,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 199 [2023-08-24 05:25:11,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:11,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:11,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 199 [2023-08-24 05:25:11,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:11,219 INFO L124 PetriNetUnfolderBase]: 200/396 cut-off events. [2023-08-24 05:25:11,219 INFO L125 PetriNetUnfolderBase]: For 696/703 co-relation queries the response was YES. [2023-08-24 05:25:11,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 396 events. 200/396 cut-off events. For 696/703 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1706 event pairs, 49 based on Foata normal form. 31/422 useless extension candidates. Maximal degree in co-relation 1508. Up to 160 conditions per place. [2023-08-24 05:25:11,222 INFO L140 encePairwiseOnDemand]: 194/199 looper letters, 38 selfloop transitions, 10 changer transitions 6/58 dead transitions. [2023-08-24 05:25:11,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 429 flow [2023-08-24 05:25:11,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:25:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:25:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2023-08-24 05:25:11,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015075376884423 [2023-08-24 05:25:11,224 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 499 transitions. [2023-08-24 05:25:11,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 499 transitions. [2023-08-24 05:25:11,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:11,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 499 transitions. [2023-08-24 05:25:11,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:11,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:11,227 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:11,227 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 212 flow. Second operand 5 states and 499 transitions. [2023-08-24 05:25:11,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 429 flow [2023-08-24 05:25:11,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 395 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-24 05:25:11,230 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 188 flow [2023-08-24 05:25:11,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-08-24 05:25:11,233 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-08-24 05:25:11,233 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 188 flow [2023-08-24 05:25:11,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:11,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:11,234 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] [2023-08-24 05:25:11,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:25:11,234 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:25:11,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1175362742, now seen corresponding path program 1 times [2023-08-24 05:25:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:11,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781604076] [2023-08-24 05:25:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:11,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:11,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781604076] [2023-08-24 05:25:11,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781604076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:11,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:11,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:25:11,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417469220] [2023-08-24 05:25:11,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:11,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:25:11,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:11,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:25:11,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:25:11,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 199 [2023-08-24 05:25:11,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:11,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:11,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 199 [2023-08-24 05:25:11,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:11,570 INFO L124 PetriNetUnfolderBase]: 118/247 cut-off events. [2023-08-24 05:25:11,570 INFO L125 PetriNetUnfolderBase]: For 545/547 co-relation queries the response was YES. [2023-08-24 05:25:11,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 247 events. 118/247 cut-off events. For 545/547 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 862 event pairs, 22 based on Foata normal form. 3/250 useless extension candidates. Maximal degree in co-relation 986. Up to 152 conditions per place. [2023-08-24 05:25:11,572 INFO L140 encePairwiseOnDemand]: 195/199 looper letters, 27 selfloop transitions, 1 changer transitions 28/57 dead transitions. [2023-08-24 05:25:11,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 446 flow [2023-08-24 05:25:11,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:25:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:25:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2023-08-24 05:25:11,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4763819095477387 [2023-08-24 05:25:11,574 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 474 transitions. [2023-08-24 05:25:11,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 474 transitions. [2023-08-24 05:25:11,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:11,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 474 transitions. [2023-08-24 05:25:11,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:11,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:11,577 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:11,577 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 188 flow. Second operand 5 states and 474 transitions. [2023-08-24 05:25:11,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 446 flow [2023-08-24 05:25:11,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 358 flow, removed 23 selfloop flow, removed 7 redundant places. [2023-08-24 05:25:11,580 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 125 flow [2023-08-24 05:25:11,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2023-08-24 05:25:11,580 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-08-24 05:25:11,580 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 125 flow [2023-08-24 05:25:11,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:11,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:11,581 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] [2023-08-24 05:25:11,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:25:11,581 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:25:11,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:11,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1268886244, now seen corresponding path program 2 times [2023-08-24 05:25:11,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:11,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768972120] [2023-08-24 05:25:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:11,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:12,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:12,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768972120] [2023-08-24 05:25:12,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768972120] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:12,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:12,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:25:12,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120448735] [2023-08-24 05:25:12,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:12,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:25:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:12,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:25:12,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:25:12,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 199 [2023-08-24 05:25:12,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 125 flow. Second operand has 8 states, 8 states have (on average 84.375) internal successors, (675), 8 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:12,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:12,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 199 [2023-08-24 05:25:12,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:12,766 INFO L124 PetriNetUnfolderBase]: 38/104 cut-off events. [2023-08-24 05:25:12,766 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-08-24 05:25:12,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 104 events. 38/104 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 262 event pairs, 8 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 351. Up to 37 conditions per place. [2023-08-24 05:25:12,767 INFO L140 encePairwiseOnDemand]: 191/199 looper letters, 24 selfloop transitions, 5 changer transitions 17/48 dead transitions. [2023-08-24 05:25:12,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 328 flow [2023-08-24 05:25:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:25:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:25:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 771 transitions. [2023-08-24 05:25:12,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4304857621440536 [2023-08-24 05:25:12,770 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 771 transitions. [2023-08-24 05:25:12,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 771 transitions. [2023-08-24 05:25:12,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:12,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 771 transitions. [2023-08-24 05:25:12,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.66666666666667) internal successors, (771), 9 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:12,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:12,776 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:12,776 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 125 flow. Second operand 9 states and 771 transitions. [2023-08-24 05:25:12,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 328 flow [2023-08-24 05:25:12,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 301 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-08-24 05:25:12,779 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 126 flow [2023-08-24 05:25:12,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-08-24 05:25:12,781 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-08-24 05:25:12,781 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 126 flow [2023-08-24 05:25:12,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.375) internal successors, (675), 8 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:12,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:12,781 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] [2023-08-24 05:25:12,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:25:12,781 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:25:12,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1319344074, now seen corresponding path program 3 times [2023-08-24 05:25:12,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:12,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403751872] [2023-08-24 05:25:12,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:12,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:25:12,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:25:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:25:12,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:25:12,911 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:25:12,912 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 05:25:12,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-24 05:25:12,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-24 05:25:12,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-24 05:25:12,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-24 05:25:12,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 05:25:12,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:25:12,914 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:12,918 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:25:12,919 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:25:12,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:25:12 BasicIcfg [2023-08-24 05:25:12,964 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:25:12,973 INFO L158 Benchmark]: Toolchain (without parser) took 10397.65ms. Allocated memory was 383.8MB in the beginning and 616.6MB in the end (delta: 232.8MB). Free memory was 358.7MB in the beginning and 493.5MB in the end (delta: -134.8MB). Peak memory consumption was 99.5MB. Max. memory is 16.0GB. [2023-08-24 05:25:12,973 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 383.8MB. Free memory was 361.7MB in the beginning and 361.7MB in the end (delta: 91.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:25:12,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.06ms. Allocated memory is still 383.8MB. Free memory was 358.2MB in the beginning and 334.5MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:25:12,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.10ms. Allocated memory is still 383.8MB. Free memory was 334.5MB in the beginning and 331.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:25:12,974 INFO L158 Benchmark]: Boogie Preprocessor took 54.06ms. Allocated memory is still 383.8MB. Free memory was 331.9MB in the beginning and 330.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:25:12,974 INFO L158 Benchmark]: RCFGBuilder took 672.23ms. Allocated memory is still 383.8MB. Free memory was 330.0MB in the beginning and 291.6MB in the end (delta: 38.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-24 05:25:12,974 INFO L158 Benchmark]: TraceAbstraction took 9090.46ms. Allocated memory was 383.8MB in the beginning and 616.6MB in the end (delta: 232.8MB). Free memory was 291.1MB in the beginning and 493.5MB in the end (delta: -202.4MB). Peak memory consumption was 32.4MB. Max. memory is 16.0GB. [2023-08-24 05:25:12,976 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 383.8MB. Free memory was 361.7MB in the beginning and 361.7MB in the end (delta: 91.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 489.06ms. Allocated memory is still 383.8MB. Free memory was 358.2MB in the beginning and 334.5MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 79.10ms. Allocated memory is still 383.8MB. Free memory was 334.5MB in the beginning and 331.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.06ms. Allocated memory is still 383.8MB. Free memory was 331.9MB in the beginning and 330.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 672.23ms. Allocated memory is still 383.8MB. Free memory was 330.0MB in the beginning and 291.6MB in the end (delta: 38.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 9090.46ms. Allocated memory was 383.8MB in the beginning and 616.6MB in the end (delta: 232.8MB). Free memory was 291.1MB in the beginning and 493.5MB in the end (delta: -202.4MB). Peak memory consumption was 32.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 113 PlacesBefore, 34 PlacesAfterwards, 105 TransitionsBefore, 25 TransitionsAfterwards, 1758 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 4661 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2388, independent: 2214, independent conditional: 0, independent unconditional: 2214, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 975, independent: 941, independent conditional: 0, independent unconditional: 941, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2388, independent: 1273, independent conditional: 0, independent unconditional: 1273, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 975, unknown conditional: 0, unknown unconditional: 975] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t500; [L842] FCALL, FORK 0 pthread_create(&t500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t500, ((void *)0), P0, ((void *)0))=-2, t500={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t501; [L844] FCALL, FORK 0 pthread_create(&t501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t501, ((void *)0), P1, ((void *)0))=-1, t500={5:0}, t501={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t502; [L846] FCALL, FORK 0 pthread_create(&t502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t502, ((void *)0), P2, ((void *)0))=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L792] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L792] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L760] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 y$flush_delayed = weak$$choice2 [L766] 2 y$mem_tmp = y [L767] 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) [L768] 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)) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 2 __unbuffered_p1_EAX = y [L775] 2 y = y$flush_delayed ? y$mem_tmp : y [L776] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L819] 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) [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] 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 [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 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) [L853] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] 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 [L855] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice2=0, x=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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: 846]: 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: 844]: 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: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 833 IncrementalHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 15 mSDtfsCounter, 833 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=7, InterpolantAutomatonStates: 52, 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.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 05:25:12,999 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...