/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/safe011_power.opt_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:34:45,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:34:45,418 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:34:45,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:34:45,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:34:45,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:34:45,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:34:45,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:34:45,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:34:45,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:34:45,455 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:34:45,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:34:45,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:34:45,456 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:34:45,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:34:45,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:34:45,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:34:45,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:34:45,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:34:45,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:34:45,457 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:34:45,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:34:45,458 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:34:45,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:34:45,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:34:45,459 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:34:45,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:34:45,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:34:45,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:34:45,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:34:45,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:34:45,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:34:45,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:34:45,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:34:45,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:34:45,461 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:34:45,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:34:45,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:34:45,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:34:45,738 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:34:45,738 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:34:45,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2023-08-24 05:34:46,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:34:46,873 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:34:46,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2023-08-24 05:34:46,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1035e8e/877f9038562d4bf5a0ef0d6be6bf4cd5/FLAGacf40f8f5 [2023-08-24 05:34:46,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1035e8e/877f9038562d4bf5a0ef0d6be6bf4cd5 [2023-08-24 05:34:46,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:34:46,906 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:34:46,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:34:46,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:34:46,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:34:46,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:34:46" (1/1) ... [2023-08-24 05:34:46,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@95f53f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:46, skipping insertion in model container [2023-08-24 05:34:46,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:34:46" (1/1) ... [2023-08-24 05:34:46,949 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:34:47,083 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/safe011_power.opt_pso.opt.i[959,972] [2023-08-24 05:34:47,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:34:47,263 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:34:47,272 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/safe011_power.opt_pso.opt.i[959,972] [2023-08-24 05:34:47,291 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:34:47,293 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:34:47,324 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:34:47,343 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:34:47,343 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:34:47,347 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:34:47,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:47 WrapperNode [2023-08-24 05:34:47,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:34:47,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:34:47,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:34:47,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:34:47,354 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:34:47" (1/1) ... [2023-08-24 05:34:47,378 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:34:47" (1/1) ... [2023-08-24 05:34:47,405 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-24 05:34:47,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:34:47,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:34:47,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:34:47,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:34:47,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:47" (1/1) ... [2023-08-24 05:34:47,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:47" (1/1) ... [2023-08-24 05:34:47,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:47" (1/1) ... [2023-08-24 05:34:47,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:47" (1/1) ... [2023-08-24 05:34:47,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:47" (1/1) ... [2023-08-24 05:34:47,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:47" (1/1) ... [2023-08-24 05:34:47,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:47" (1/1) ... [2023-08-24 05:34:47,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:47" (1/1) ... [2023-08-24 05:34:47,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:34:47,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:34:47,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:34:47,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:34:47,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:47" (1/1) ... [2023-08-24 05:34:47,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:34:47,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:34:47,452 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:34:47,466 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:34:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:34:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:34:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:34:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:34:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:34:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:34:47,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:34:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:34:47,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:34:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:34:47,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:34:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:34:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:34:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:34:47,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:34:47,483 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:34:47,572 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:34:47,573 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:34:47,768 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:34:47,899 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:34:47,899 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:34:47,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:34:47 BoogieIcfgContainer [2023-08-24 05:34:47,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:34:47,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:34:47,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:34:47,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:34:47,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:34:46" (1/3) ... [2023-08-24 05:34:47,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e08c00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:34:47, skipping insertion in model container [2023-08-24 05:34:47,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:47" (2/3) ... [2023-08-24 05:34:47,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e08c00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:34:47, skipping insertion in model container [2023-08-24 05:34:47,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:34:47" (3/3) ... [2023-08-24 05:34:47,909 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2023-08-24 05:34:47,920 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:34:47,921 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:34:47,922 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:34:47,972 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:34:47,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-08-24 05:34:48,043 INFO L124 PetriNetUnfolderBase]: 2/104 cut-off events. [2023-08-24 05:34:48,043 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:34:48,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-24 05:34:48,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-08-24 05:34:48,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-08-24 05:34:48,052 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:34:48,063 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-08-24 05:34:48,066 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-08-24 05:34:48,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-08-24 05:34:48,091 INFO L124 PetriNetUnfolderBase]: 2/104 cut-off events. [2023-08-24 05:34:48,091 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:34:48,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-24 05:34:48,093 INFO L119 LiptonReduction]: Number of co-enabled transitions 1906 [2023-08-24 05:34:51,208 INFO L134 LiptonReduction]: Checked pairs total: 5104 [2023-08-24 05:34:51,209 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-24 05:34:51,217 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:34:51,221 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;@3db95679, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:34:51,221 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 05:34:51,223 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:34:51,223 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-24 05:34:51,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:34:51,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:51,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-24 05:34:51,224 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:51,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash 451426509, now seen corresponding path program 1 times [2023-08-24 05:34:51,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:51,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163490752] [2023-08-24 05:34:51,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:51,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:51,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:51,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163490752] [2023-08-24 05:34:51,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163490752] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:51,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:51,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:34:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141593421] [2023-08-24 05:34:51,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:51,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:34:51,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:51,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:34:51,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:34:51,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 201 [2023-08-24 05:34:51,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:51,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:51,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 201 [2023-08-24 05:34:51,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:51,741 INFO L124 PetriNetUnfolderBase]: 711/1166 cut-off events. [2023-08-24 05:34:51,741 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-24 05:34:51,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 1166 events. 711/1166 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5931 event pairs, 117 based on Foata normal form. 0/1097 useless extension candidates. Maximal degree in co-relation 2274. Up to 859 conditions per place. [2023-08-24 05:34:51,750 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 27 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-08-24 05:34:51,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 142 flow [2023-08-24 05:34:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:34:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:34:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-08-24 05:34:51,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157545605306799 [2023-08-24 05:34:51,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-08-24 05:34:51,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-08-24 05:34:51,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:51,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-08-24 05:34:51,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:51,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:51,777 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:51,778 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 311 transitions. [2023-08-24 05:34:51,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 142 flow [2023-08-24 05:34:51,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 05:34:51,781 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-08-24 05:34:51,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-24 05:34:51,785 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-08-24 05:34:51,785 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-08-24 05:34:51,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:51,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:51,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:51,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:34:51,786 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:51,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1972991679, now seen corresponding path program 1 times [2023-08-24 05:34:51,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:51,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354247815] [2023-08-24 05:34:51,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:51,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:52,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:52,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354247815] [2023-08-24 05:34:52,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354247815] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:52,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:52,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:34:52,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930702628] [2023-08-24 05:34:52,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:52,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:34:52,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:52,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:34:52,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:34:52,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-08-24 05:34:52,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:52,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:52,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-08-24 05:34:52,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:52,348 INFO L124 PetriNetUnfolderBase]: 1040/1565 cut-off events. [2023-08-24 05:34:52,349 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-08-24 05:34:52,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 1565 events. 1040/1565 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6998 event pairs, 223 based on Foata normal form. 28/1592 useless extension candidates. Maximal degree in co-relation 3293. Up to 1347 conditions per place. [2023-08-24 05:34:52,356 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 32 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2023-08-24 05:34:52,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 188 flow [2023-08-24 05:34:52,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:34:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:34:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 368 transitions. [2023-08-24 05:34:52,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4577114427860697 [2023-08-24 05:34:52,359 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 368 transitions. [2023-08-24 05:34:52,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 368 transitions. [2023-08-24 05:34:52,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:52,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 368 transitions. [2023-08-24 05:34:52,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:52,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:52,363 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:52,363 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 368 transitions. [2023-08-24 05:34:52,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 188 flow [2023-08-24 05:34:52,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:34:52,365 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 111 flow [2023-08-24 05:34:52,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2023-08-24 05:34:52,366 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-08-24 05:34:52,367 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 111 flow [2023-08-24 05:34:52,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:52,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:52,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:52,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:34:52,373 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:52,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:52,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1033201268, now seen corresponding path program 1 times [2023-08-24 05:34:52,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:52,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591629940] [2023-08-24 05:34:52,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:52,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:52,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:52,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591629940] [2023-08-24 05:34:52,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591629940] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:52,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:52,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:34:52,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925896719] [2023-08-24 05:34:52,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:52,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:34:52,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:52,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:34:52,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:34:52,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-08-24 05:34:52,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:52,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:52,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-08-24 05:34:52,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:52,848 INFO L124 PetriNetUnfolderBase]: 1000/1513 cut-off events. [2023-08-24 05:34:52,848 INFO L125 PetriNetUnfolderBase]: For 490/495 co-relation queries the response was YES. [2023-08-24 05:34:52,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4219 conditions, 1513 events. 1000/1513 cut-off events. For 490/495 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6532 event pairs, 180 based on Foata normal form. 16/1524 useless extension candidates. Maximal degree in co-relation 4207. Up to 1100 conditions per place. [2023-08-24 05:34:52,855 INFO L140 encePairwiseOnDemand]: 191/201 looper letters, 31 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2023-08-24 05:34:52,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 230 flow [2023-08-24 05:34:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:34:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:34:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2023-08-24 05:34:52,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527363184079602 [2023-08-24 05:34:52,856 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 364 transitions. [2023-08-24 05:34:52,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 364 transitions. [2023-08-24 05:34:52,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:52,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 364 transitions. [2023-08-24 05:34:52,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:52,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:52,859 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:52,859 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 111 flow. Second operand 4 states and 364 transitions. [2023-08-24 05:34:52,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 230 flow [2023-08-24 05:34:52,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 230 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 05:34:52,861 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 135 flow [2023-08-24 05:34:52,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-08-24 05:34:52,862 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2023-08-24 05:34:52,862 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 135 flow [2023-08-24 05:34:52,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:52,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:52,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:52,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:34:52,862 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:52,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:52,863 INFO L85 PathProgramCache]: Analyzing trace with hash -497160512, now seen corresponding path program 1 times [2023-08-24 05:34:52,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:52,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75046710] [2023-08-24 05:34:52,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:53,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:53,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75046710] [2023-08-24 05:34:53,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75046710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:53,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:53,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:34:53,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59326653] [2023-08-24 05:34:53,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:53,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:34:53,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:53,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:34:53,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:34:53,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 201 [2023-08-24 05:34:53,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:53,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:53,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 201 [2023-08-24 05:34:53,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:53,377 INFO L124 PetriNetUnfolderBase]: 1385/2052 cut-off events. [2023-08-24 05:34:53,377 INFO L125 PetriNetUnfolderBase]: For 1456/1456 co-relation queries the response was YES. [2023-08-24 05:34:53,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6229 conditions, 2052 events. 1385/2052 cut-off events. For 1456/1456 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9116 event pairs, 166 based on Foata normal form. 12/2064 useless extension candidates. Maximal degree in co-relation 6214. Up to 1102 conditions per place. [2023-08-24 05:34:53,388 INFO L140 encePairwiseOnDemand]: 190/201 looper letters, 47 selfloop transitions, 26 changer transitions 0/73 dead transitions. [2023-08-24 05:34:53,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 73 transitions, 469 flow [2023-08-24 05:34:53,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:34:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:34:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2023-08-24 05:34:53,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537313432835821 [2023-08-24 05:34:53,390 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 456 transitions. [2023-08-24 05:34:53,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 456 transitions. [2023-08-24 05:34:53,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:53,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 456 transitions. [2023-08-24 05:34:53,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:53,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:53,392 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:53,392 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 135 flow. Second operand 5 states and 456 transitions. [2023-08-24 05:34:53,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 73 transitions, 469 flow [2023-08-24 05:34:53,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 73 transitions, 425 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 05:34:53,398 INFO L231 Difference]: Finished difference. Result has 42 places, 47 transitions, 330 flow [2023-08-24 05:34:53,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=330, PETRI_PLACES=42, PETRI_TRANSITIONS=47} [2023-08-24 05:34:53,399 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2023-08-24 05:34:53,399 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 47 transitions, 330 flow [2023-08-24 05:34:53,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:53,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:53,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:53,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:34:53,400 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:53,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2002719538, now seen corresponding path program 2 times [2023-08-24 05:34:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:53,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800733223] [2023-08-24 05:34:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:53,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:53,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:34:53,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:53,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800733223] [2023-08-24 05:34:53,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800733223] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:53,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:53,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:34:53,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016941904] [2023-08-24 05:34:53,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:53,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:34:53,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:53,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:34:53,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:34:53,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-08-24 05:34:53,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 47 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:53,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:53,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-08-24 05:34:53,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:54,041 INFO L124 PetriNetUnfolderBase]: 1325/2054 cut-off events. [2023-08-24 05:34:54,042 INFO L125 PetriNetUnfolderBase]: For 3506/3517 co-relation queries the response was YES. [2023-08-24 05:34:54,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7870 conditions, 2054 events. 1325/2054 cut-off events. For 3506/3517 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10041 event pairs, 163 based on Foata normal form. 33/2087 useless extension candidates. Maximal degree in co-relation 7851. Up to 1495 conditions per place. [2023-08-24 05:34:54,053 INFO L140 encePairwiseOnDemand]: 190/201 looper letters, 63 selfloop transitions, 33 changer transitions 0/98 dead transitions. [2023-08-24 05:34:54,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 98 transitions, 832 flow [2023-08-24 05:34:54,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:34:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:34:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions. [2023-08-24 05:34:54,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46766169154228854 [2023-08-24 05:34:54,055 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 376 transitions. [2023-08-24 05:34:54,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 376 transitions. [2023-08-24 05:34:54,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:54,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 376 transitions. [2023-08-24 05:34:54,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:54,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:54,058 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:54,058 INFO L175 Difference]: Start difference. First operand has 42 places, 47 transitions, 330 flow. Second operand 4 states and 376 transitions. [2023-08-24 05:34:54,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 98 transitions, 832 flow [2023-08-24 05:34:54,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 98 transitions, 832 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 05:34:54,066 INFO L231 Difference]: Finished difference. Result has 48 places, 72 transitions, 700 flow [2023-08-24 05:34:54,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=700, PETRI_PLACES=48, PETRI_TRANSITIONS=72} [2023-08-24 05:34:54,067 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places. [2023-08-24 05:34:54,067 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 72 transitions, 700 flow [2023-08-24 05:34:54,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:54,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:54,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:54,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:34:54,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:54,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:54,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1992400757, now seen corresponding path program 1 times [2023-08-24 05:34:54,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:54,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455604308] [2023-08-24 05:34:54,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:54,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:54,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:54,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455604308] [2023-08-24 05:34:54,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455604308] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:54,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:54,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:34:54,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112391910] [2023-08-24 05:34:54,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:54,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:34:54,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:54,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:34:54,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:34:54,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 201 [2023-08-24 05:34:54,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 72 transitions, 700 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:34:54,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:54,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 201 [2023-08-24 05:34:54,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:54,478 INFO L124 PetriNetUnfolderBase]: 1713/2606 cut-off events. [2023-08-24 05:34:54,478 INFO L125 PetriNetUnfolderBase]: For 10315/10359 co-relation queries the response was YES. [2023-08-24 05:34:54,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12711 conditions, 2606 events. 1713/2606 cut-off events. For 10315/10359 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13142 event pairs, 202 based on Foata normal form. 117/2664 useless extension candidates. Maximal degree in co-relation 12687. Up to 1419 conditions per place. [2023-08-24 05:34:54,489 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 49 selfloop transitions, 4 changer transitions 46/103 dead transitions. [2023-08-24 05:34:54,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 103 transitions, 1117 flow [2023-08-24 05:34:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:34:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:34:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 400 transitions. [2023-08-24 05:34:54,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975124378109453 [2023-08-24 05:34:54,491 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 400 transitions. [2023-08-24 05:34:54,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 400 transitions. [2023-08-24 05:34:54,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:54,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 400 transitions. [2023-08-24 05:34:54,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:54,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:54,493 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:54,493 INFO L175 Difference]: Start difference. First operand has 48 places, 72 transitions, 700 flow. Second operand 4 states and 400 transitions. [2023-08-24 05:34:54,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 103 transitions, 1117 flow [2023-08-24 05:34:54,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 103 transitions, 1117 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 05:34:54,501 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 361 flow [2023-08-24 05:34:54,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=361, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-08-24 05:34:54,501 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2023-08-24 05:34:54,501 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 361 flow [2023-08-24 05:34:54,502 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:34:54,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:54,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:54,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:34:54,502 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:54,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:54,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1059459853, now seen corresponding path program 1 times [2023-08-24 05:34:54,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:54,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106534601] [2023-08-24 05:34:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:54,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106534601] [2023-08-24 05:34:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106534601] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:54,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:34:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818230754] [2023-08-24 05:34:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:54,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:34:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:34:54,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:34:54,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-08-24 05:34:54,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 361 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:54,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:54,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-08-24 05:34:54,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:54,951 INFO L124 PetriNetUnfolderBase]: 1159/1858 cut-off events. [2023-08-24 05:34:54,951 INFO L125 PetriNetUnfolderBase]: For 6758/6819 co-relation queries the response was YES. [2023-08-24 05:34:54,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8897 conditions, 1858 events. 1159/1858 cut-off events. For 6758/6819 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9221 event pairs, 235 based on Foata normal form. 39/1862 useless extension candidates. Maximal degree in co-relation 8869. Up to 1465 conditions per place. [2023-08-24 05:34:54,960 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 47 selfloop transitions, 20 changer transitions 6/76 dead transitions. [2023-08-24 05:34:54,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 775 flow [2023-08-24 05:34:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:34:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:34:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions. [2023-08-24 05:34:54,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4767827529021559 [2023-08-24 05:34:54,961 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 575 transitions. [2023-08-24 05:34:54,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions. [2023-08-24 05:34:54,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:54,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions. [2023-08-24 05:34:54,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:54,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:54,964 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:54,964 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 361 flow. Second operand 6 states and 575 transitions. [2023-08-24 05:34:54,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 775 flow [2023-08-24 05:34:54,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 673 flow, removed 19 selfloop flow, removed 6 redundant places. [2023-08-24 05:34:54,973 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 482 flow [2023-08-24 05:34:54,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=482, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2023-08-24 05:34:54,974 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2023-08-24 05:34:54,974 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 482 flow [2023-08-24 05:34:54,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:54,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:54,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:54,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:34:54,974 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:54,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:54,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1029698004, now seen corresponding path program 1 times [2023-08-24 05:34:54,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:54,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933197823] [2023-08-24 05:34:54,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:54,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:55,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:55,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933197823] [2023-08-24 05:34:55,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933197823] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:55,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:55,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:34:55,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947223953] [2023-08-24 05:34:55,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:55,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:34:55,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:55,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:34:55,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:34:55,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-08-24 05:34:55,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 482 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:55,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:55,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-08-24 05:34:55,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:55,456 INFO L124 PetriNetUnfolderBase]: 828/1324 cut-off events. [2023-08-24 05:34:55,456 INFO L125 PetriNetUnfolderBase]: For 4718/4748 co-relation queries the response was YES. [2023-08-24 05:34:55,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6559 conditions, 1324 events. 828/1324 cut-off events. For 4718/4748 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5727 event pairs, 234 based on Foata normal form. 5/1329 useless extension candidates. Maximal degree in co-relation 6533. Up to 1163 conditions per place. [2023-08-24 05:34:55,467 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 60 selfloop transitions, 10 changer transitions 0/73 dead transitions. [2023-08-24 05:34:55,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 772 flow [2023-08-24 05:34:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:34:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:34:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 390 transitions. [2023-08-24 05:34:55,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48507462686567165 [2023-08-24 05:34:55,468 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 390 transitions. [2023-08-24 05:34:55,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 390 transitions. [2023-08-24 05:34:55,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:55,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 390 transitions. [2023-08-24 05:34:55,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:55,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:55,491 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:55,491 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 482 flow. Second operand 4 states and 390 transitions. [2023-08-24 05:34:55,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 772 flow [2023-08-24 05:34:55,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 707 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-08-24 05:34:55,496 INFO L231 Difference]: Finished difference. Result has 52 places, 56 transitions, 508 flow [2023-08-24 05:34:55,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=508, PETRI_PLACES=52, PETRI_TRANSITIONS=56} [2023-08-24 05:34:55,496 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2023-08-24 05:34:55,496 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 56 transitions, 508 flow [2023-08-24 05:34:55,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:55,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:55,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:55,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:34:55,497 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:55,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash -566960269, now seen corresponding path program 2 times [2023-08-24 05:34:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43045377] [2023-08-24 05:34:55,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:55,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:55,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43045377] [2023-08-24 05:34:55,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43045377] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:55,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:55,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:34:55,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239903539] [2023-08-24 05:34:55,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:55,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:34:55,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:55,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:34:55,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:34:55,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 201 [2023-08-24 05:34:55,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 56 transitions, 508 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:55,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:55,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 201 [2023-08-24 05:34:55,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:55,949 INFO L124 PetriNetUnfolderBase]: 863/1355 cut-off events. [2023-08-24 05:34:55,949 INFO L125 PetriNetUnfolderBase]: For 4867/4979 co-relation queries the response was YES. [2023-08-24 05:34:55,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6734 conditions, 1355 events. 863/1355 cut-off events. For 4867/4979 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5879 event pairs, 176 based on Foata normal form. 23/1361 useless extension candidates. Maximal degree in co-relation 6709. Up to 1206 conditions per place. [2023-08-24 05:34:55,956 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 63 selfloop transitions, 19 changer transitions 0/85 dead transitions. [2023-08-24 05:34:55,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 85 transitions, 881 flow [2023-08-24 05:34:55,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:34:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:34:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2023-08-24 05:34:55,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48656716417910445 [2023-08-24 05:34:55,958 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 489 transitions. [2023-08-24 05:34:55,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 489 transitions. [2023-08-24 05:34:55,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:55,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 489 transitions. [2023-08-24 05:34:55,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:55,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:55,961 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:55,961 INFO L175 Difference]: Start difference. First operand has 52 places, 56 transitions, 508 flow. Second operand 5 states and 489 transitions. [2023-08-24 05:34:55,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 85 transitions, 881 flow [2023-08-24 05:34:55,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 867 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 05:34:55,965 INFO L231 Difference]: Finished difference. Result has 55 places, 67 transitions, 689 flow [2023-08-24 05:34:55,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=689, PETRI_PLACES=55, PETRI_TRANSITIONS=67} [2023-08-24 05:34:55,966 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2023-08-24 05:34:55,966 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 67 transitions, 689 flow [2023-08-24 05:34:55,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:55,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:55,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:55,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:34:55,967 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:55,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:55,967 INFO L85 PathProgramCache]: Analyzing trace with hash -523895689, now seen corresponding path program 3 times [2023-08-24 05:34:55,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:55,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409632110] [2023-08-24 05:34:55,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:55,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:56,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:56,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409632110] [2023-08-24 05:34:56,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409632110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:56,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:56,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:34:56,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837740946] [2023-08-24 05:34:56,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:56,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:34:56,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:56,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:34:56,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:34:56,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 201 [2023-08-24 05:34:56,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 67 transitions, 689 flow. Second operand has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:56,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:56,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 201 [2023-08-24 05:34:56,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:56,607 INFO L124 PetriNetUnfolderBase]: 869/1364 cut-off events. [2023-08-24 05:34:56,607 INFO L125 PetriNetUnfolderBase]: For 6290/6402 co-relation queries the response was YES. [2023-08-24 05:34:56,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7233 conditions, 1364 events. 869/1364 cut-off events. For 6290/6402 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5925 event pairs, 175 based on Foata normal form. 22/1369 useless extension candidates. Maximal degree in co-relation 7207. Up to 1216 conditions per place. [2023-08-24 05:34:56,614 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 67 selfloop transitions, 21 changer transitions 0/91 dead transitions. [2023-08-24 05:34:56,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 1034 flow [2023-08-24 05:34:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:34:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:34:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2023-08-24 05:34:56,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47064676616915424 [2023-08-24 05:34:56,616 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 473 transitions. [2023-08-24 05:34:56,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 473 transitions. [2023-08-24 05:34:56,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:56,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 473 transitions. [2023-08-24 05:34:56,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:56,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:56,618 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:56,618 INFO L175 Difference]: Start difference. First operand has 55 places, 67 transitions, 689 flow. Second operand 5 states and 473 transitions. [2023-08-24 05:34:56,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 91 transitions, 1034 flow [2023-08-24 05:34:56,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 91 transitions, 996 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-24 05:34:56,625 INFO L231 Difference]: Finished difference. Result has 57 places, 76 transitions, 835 flow [2023-08-24 05:34:56,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=835, PETRI_PLACES=57, PETRI_TRANSITIONS=76} [2023-08-24 05:34:56,625 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places. [2023-08-24 05:34:56,625 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 76 transitions, 835 flow [2023-08-24 05:34:56,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:56,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:56,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:56,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:34:56,626 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:56,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:56,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1103997701, now seen corresponding path program 4 times [2023-08-24 05:34:56,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:56,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562622281] [2023-08-24 05:34:56,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:56,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:56,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:56,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562622281] [2023-08-24 05:34:56,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562622281] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:56,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:56,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:34:56,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493480015] [2023-08-24 05:34:56,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:56,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:34:56,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:56,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:34:56,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:34:56,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-08-24 05:34:56,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 76 transitions, 835 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:56,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:56,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-08-24 05:34:56,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:57,139 INFO L124 PetriNetUnfolderBase]: 916/1431 cut-off events. [2023-08-24 05:34:57,139 INFO L125 PetriNetUnfolderBase]: For 8331/8443 co-relation queries the response was YES. [2023-08-24 05:34:57,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7969 conditions, 1431 events. 916/1431 cut-off events. For 8331/8443 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6373 event pairs, 132 based on Foata normal form. 49/1447 useless extension candidates. Maximal degree in co-relation 7942. Up to 1145 conditions per place. [2023-08-24 05:34:57,147 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 66 selfloop transitions, 46 changer transitions 0/115 dead transitions. [2023-08-24 05:34:57,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 115 transitions, 1425 flow [2023-08-24 05:34:57,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:34:57,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:34:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2023-08-24 05:34:57,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855721393034826 [2023-08-24 05:34:57,148 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 488 transitions. [2023-08-24 05:34:57,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 488 transitions. [2023-08-24 05:34:57,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:57,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 488 transitions. [2023-08-24 05:34:57,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,151 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,151 INFO L175 Difference]: Start difference. First operand has 57 places, 76 transitions, 835 flow. Second operand 5 states and 488 transitions. [2023-08-24 05:34:57,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 115 transitions, 1425 flow [2023-08-24 05:34:57,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 115 transitions, 1405 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-24 05:34:57,159 INFO L231 Difference]: Finished difference. Result has 62 places, 91 transitions, 1154 flow [2023-08-24 05:34:57,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1154, PETRI_PLACES=62, PETRI_TRANSITIONS=91} [2023-08-24 05:34:57,159 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2023-08-24 05:34:57,159 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 91 transitions, 1154 flow [2023-08-24 05:34:57,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:57,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:57,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:34:57,160 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:57,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:57,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1855869686, now seen corresponding path program 1 times [2023-08-24 05:34:57,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:57,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238320288] [2023-08-24 05:34:57,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:57,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:57,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:57,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238320288] [2023-08-24 05:34:57,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238320288] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:57,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:57,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:34:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739382156] [2023-08-24 05:34:57,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:57,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:34:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:57,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:34:57,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:34:57,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-08-24 05:34:57,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 91 transitions, 1154 flow. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:57,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-08-24 05:34:57,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:57,422 INFO L124 PetriNetUnfolderBase]: 642/1050 cut-off events. [2023-08-24 05:34:57,422 INFO L125 PetriNetUnfolderBase]: For 10879/11050 co-relation queries the response was YES. [2023-08-24 05:34:57,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6413 conditions, 1050 events. 642/1050 cut-off events. For 10879/11050 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4872 event pairs, 80 based on Foata normal form. 255/1297 useless extension candidates. Maximal degree in co-relation 6383. Up to 625 conditions per place. [2023-08-24 05:34:57,427 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 82 selfloop transitions, 4 changer transitions 70/162 dead transitions. [2023-08-24 05:34:57,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 162 transitions, 2313 flow [2023-08-24 05:34:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:34:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:34:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-08-24 05:34:57,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845771144278607 [2023-08-24 05:34:57,429 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-08-24 05:34:57,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-08-24 05:34:57,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:57,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-08-24 05:34:57,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,431 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,431 INFO L175 Difference]: Start difference. First operand has 62 places, 91 transitions, 1154 flow. Second operand 5 states and 487 transitions. [2023-08-24 05:34:57,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 162 transitions, 2313 flow [2023-08-24 05:34:57,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 162 transitions, 2077 flow, removed 98 selfloop flow, removed 4 redundant places. [2023-08-24 05:34:57,442 INFO L231 Difference]: Finished difference. Result has 65 places, 69 transitions, 766 flow [2023-08-24 05:34:57,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=766, PETRI_PLACES=65, PETRI_TRANSITIONS=69} [2023-08-24 05:34:57,442 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 32 predicate places. [2023-08-24 05:34:57,442 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 69 transitions, 766 flow [2023-08-24 05:34:57,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:57,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:57,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:34:57,443 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:57,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:57,443 INFO L85 PathProgramCache]: Analyzing trace with hash -237318165, now seen corresponding path program 1 times [2023-08-24 05:34:57,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:57,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965316733] [2023-08-24 05:34:57,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:57,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:57,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:57,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965316733] [2023-08-24 05:34:57,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965316733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:57,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:57,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:34:57,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432411368] [2023-08-24 05:34:57,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:57,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:34:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:57,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:34:57,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:34:57,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-08-24 05:34:57,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 69 transitions, 766 flow. Second operand has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:57,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-08-24 05:34:57,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:57,663 INFO L124 PetriNetUnfolderBase]: 320/569 cut-off events. [2023-08-24 05:34:57,663 INFO L125 PetriNetUnfolderBase]: For 4131/4192 co-relation queries the response was YES. [2023-08-24 05:34:57,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3282 conditions, 569 events. 320/569 cut-off events. For 4131/4192 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2430 event pairs, 34 based on Foata normal form. 99/660 useless extension candidates. Maximal degree in co-relation 3249. Up to 304 conditions per place. [2023-08-24 05:34:57,665 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 89 selfloop transitions, 7 changer transitions 33/135 dead transitions. [2023-08-24 05:34:57,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 135 transitions, 1682 flow [2023-08-24 05:34:57,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:34:57,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:34:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 583 transitions. [2023-08-24 05:34:57,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4834162520729685 [2023-08-24 05:34:57,667 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 583 transitions. [2023-08-24 05:34:57,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 583 transitions. [2023-08-24 05:34:57,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:57,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 583 transitions. [2023-08-24 05:34:57,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,670 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,670 INFO L175 Difference]: Start difference. First operand has 65 places, 69 transitions, 766 flow. Second operand 6 states and 583 transitions. [2023-08-24 05:34:57,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 135 transitions, 1682 flow [2023-08-24 05:34:57,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 135 transitions, 1649 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-24 05:34:57,676 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 773 flow [2023-08-24 05:34:57,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=773, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2023-08-24 05:34:57,676 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 34 predicate places. [2023-08-24 05:34:57,676 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 773 flow [2023-08-24 05:34:57,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:57,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:57,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:34:57,677 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:57,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:57,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1812949505, now seen corresponding path program 1 times [2023-08-24 05:34:57,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:57,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817415184] [2023-08-24 05:34:57,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:57,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:57,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:57,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817415184] [2023-08-24 05:34:57,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817415184] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:57,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:57,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:34:57,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116072018] [2023-08-24 05:34:57,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:57,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:34:57,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:57,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:34:57,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:34:57,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-08-24 05:34:57,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 773 flow. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:57,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:57,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-08-24 05:34:57,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:58,001 INFO L124 PetriNetUnfolderBase]: 344/642 cut-off events. [2023-08-24 05:34:58,002 INFO L125 PetriNetUnfolderBase]: For 3440/3454 co-relation queries the response was YES. [2023-08-24 05:34:58,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3749 conditions, 642 events. 344/642 cut-off events. For 3440/3454 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2698 event pairs, 56 based on Foata normal form. 9/651 useless extension candidates. Maximal degree in co-relation 3715. Up to 413 conditions per place. [2023-08-24 05:34:58,004 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 62 selfloop transitions, 7 changer transitions 24/94 dead transitions. [2023-08-24 05:34:58,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 94 transitions, 1178 flow [2023-08-24 05:34:58,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:34:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:34:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 361 transitions. [2023-08-24 05:34:58,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4490049751243781 [2023-08-24 05:34:58,006 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 361 transitions. [2023-08-24 05:34:58,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 361 transitions. [2023-08-24 05:34:58,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:58,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 361 transitions. [2023-08-24 05:34:58,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:58,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:58,008 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:58,008 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 773 flow. Second operand 4 states and 361 transitions. [2023-08-24 05:34:58,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 94 transitions, 1178 flow [2023-08-24 05:34:58,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 1058 flow, removed 53 selfloop flow, removed 4 redundant places. [2023-08-24 05:34:58,014 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 524 flow [2023-08-24 05:34:58,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=524, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2023-08-24 05:34:58,015 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 32 predicate places. [2023-08-24 05:34:58,015 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 524 flow [2023-08-24 05:34:58,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:58,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:58,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:58,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 05:34:58,015 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:58,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash 404768233, now seen corresponding path program 1 times [2023-08-24 05:34:58,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:58,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908821609] [2023-08-24 05:34:58,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:58,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:58,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908821609] [2023-08-24 05:34:58,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908821609] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:58,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:58,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:34:58,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802833436] [2023-08-24 05:34:58,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:58,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:34:58,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:58,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:34:58,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:34:58,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-08-24 05:34:58,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 524 flow. Second operand has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:58,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:58,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-08-24 05:34:58,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:58,238 INFO L124 PetriNetUnfolderBase]: 240/463 cut-off events. [2023-08-24 05:34:58,238 INFO L125 PetriNetUnfolderBase]: For 2143/2180 co-relation queries the response was YES. [2023-08-24 05:34:58,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 463 events. 240/463 cut-off events. For 2143/2180 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2011 event pairs, 33 based on Foata normal form. 37/492 useless extension candidates. Maximal degree in co-relation 2361. Up to 222 conditions per place. [2023-08-24 05:34:58,240 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 45 selfloop transitions, 10 changer transitions 34/93 dead transitions. [2023-08-24 05:34:58,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 93 transitions, 1010 flow [2023-08-24 05:34:58,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:34:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:34:58,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 661 transitions. [2023-08-24 05:34:58,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46979388770433544 [2023-08-24 05:34:58,242 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 661 transitions. [2023-08-24 05:34:58,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 661 transitions. [2023-08-24 05:34:58,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:58,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 661 transitions. [2023-08-24 05:34:58,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:58,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:58,245 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:58,245 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 524 flow. Second operand 7 states and 661 transitions. [2023-08-24 05:34:58,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 93 transitions, 1010 flow [2023-08-24 05:34:58,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 93 transitions, 942 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-08-24 05:34:58,249 INFO L231 Difference]: Finished difference. Result has 70 places, 42 transitions, 359 flow [2023-08-24 05:34:58,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=359, PETRI_PLACES=70, PETRI_TRANSITIONS=42} [2023-08-24 05:34:58,249 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 37 predicate places. [2023-08-24 05:34:58,249 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 42 transitions, 359 flow [2023-08-24 05:34:58,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:58,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:58,250 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:34:58,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 05:34:58,250 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:58,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash 156620360, now seen corresponding path program 1 times [2023-08-24 05:34:58,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:58,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5581068] [2023-08-24 05:34:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:58,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:34:58,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:34:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:34:58,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:34:58,327 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:34:58,328 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 05:34:58,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-24 05:34:58,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-24 05:34:58,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-24 05:34:58,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-24 05:34:58,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 05:34:58,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 05:34:58,330 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:58,333 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:34:58,333 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:34:58,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:34:58 BasicIcfg [2023-08-24 05:34:58,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:34:58,365 INFO L158 Benchmark]: Toolchain (without parser) took 11459.30ms. Allocated memory was 381.7MB in the beginning and 729.8MB in the end (delta: 348.1MB). Free memory was 356.8MB in the beginning and 415.0MB in the end (delta: -58.2MB). Peak memory consumption was 290.6MB. Max. memory is 16.0GB. [2023-08-24 05:34:58,365 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 381.7MB. Free memory is still 359.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:34:58,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.24ms. Allocated memory is still 381.7MB. Free memory was 356.3MB in the beginning and 333.4MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:34:58,365 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.76ms. Allocated memory is still 381.7MB. Free memory was 332.9MB in the beginning and 330.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:34:58,365 INFO L158 Benchmark]: Boogie Preprocessor took 24.21ms. Allocated memory is still 381.7MB. Free memory was 330.2MB in the beginning and 328.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:34:58,365 INFO L158 Benchmark]: RCFGBuilder took 471.40ms. Allocated memory is still 381.7MB. Free memory was 328.6MB in the beginning and 352.6MB in the end (delta: -24.0MB). Peak memory consumption was 40.5MB. Max. memory is 16.0GB. [2023-08-24 05:34:58,366 INFO L158 Benchmark]: TraceAbstraction took 10460.24ms. Allocated memory was 381.7MB in the beginning and 729.8MB in the end (delta: 348.1MB). Free memory was 351.3MB in the beginning and 415.0MB in the end (delta: -63.7MB). Peak memory consumption was 283.7MB. Max. memory is 16.0GB. [2023-08-24 05:34:58,366 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.10ms. Allocated memory is still 381.7MB. Free memory is still 359.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 440.24ms. Allocated memory is still 381.7MB. Free memory was 356.3MB in the beginning and 333.4MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.76ms. Allocated memory is still 381.7MB. Free memory was 332.9MB in the beginning and 330.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.21ms. Allocated memory is still 381.7MB. Free memory was 330.2MB in the beginning and 328.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 471.40ms. Allocated memory is still 381.7MB. Free memory was 328.6MB in the beginning and 352.6MB in the end (delta: -24.0MB). Peak memory consumption was 40.5MB. Max. memory is 16.0GB. * TraceAbstraction took 10460.24ms. Allocated memory was 381.7MB in the beginning and 729.8MB in the end (delta: 348.1MB). Free memory was 351.3MB in the beginning and 415.0MB in the end (delta: -63.7MB). Peak memory consumption was 283.7MB. 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.1s, 112 PlacesBefore, 33 PlacesAfterwards, 104 TransitionsBefore, 23 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 5104 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2368, independent: 2189, independent conditional: 0, independent unconditional: 2189, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1043, independent: 999, independent conditional: 0, independent unconditional: 999, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2368, independent: 1190, independent conditional: 0, independent unconditional: 1190, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 1043, unknown conditional: 0, unknown unconditional: 1043] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028; [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2028, ((void *)0), P0, ((void *)0))=-1, t2028={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L820] 0 pthread_t t2029; [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2029, ((void *)0), P1, ((void *)0))=0, t2028={5:0}, t2029={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t2030; [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2030, ((void *)0), P2, ((void *)0))=1, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 823]: 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: 821]: 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: 10.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1091 IncrementalHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 23 mSDtfsCounter, 1091 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1154occurred in iteration=11, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 1961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 05:34:58,383 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...