/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/mix018.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:24:43,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:24:44,051 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:24:44,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:24:44,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:24:44,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:24:44,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:24:44,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:24:44,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:24:44,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:24:44,075 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:24:44,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:24:44,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:24:44,076 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:24:44,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:24:44,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:24:44,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:24:44,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:24:44,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:24:44,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:24:44,078 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:24:44,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:24:44,079 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:24:44,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:24:44,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:24:44,080 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:24:44,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:24:44,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:24:44,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:24:44,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:24:44,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:24:44,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:24:44,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:24:44,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:24:44,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:24:44,083 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:24:44,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:24:44,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:24:44,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:24:44,403 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:24:44,403 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:24:44,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018.opt.i [2023-08-24 05:24:45,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:24:45,894 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:24:45,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018.opt.i [2023-08-24 05:24:45,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a3a46ed/028ff35a53af43d9a2ca373fa4ce1949/FLAGb2f560bf6 [2023-08-24 05:24:45,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83a3a46ed/028ff35a53af43d9a2ca373fa4ce1949 [2023-08-24 05:24:45,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:24:45,926 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:24:45,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:24:45,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:24:45,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:24:45,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:24:45" (1/1) ... [2023-08-24 05:24:45,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa61a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:24:45, skipping insertion in model container [2023-08-24 05:24:45,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:24:45" (1/1) ... [2023-08-24 05:24:45,983 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:24:46,131 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/mix018.opt.i[944,957] [2023-08-24 05:24:46,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:24:46,376 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:24:46,386 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/mix018.opt.i[944,957] [2023-08-24 05:24:46,402 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:24:46,404 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:24:46,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:24:46,491 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:24:46,491 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:24:46,497 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:24:46,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:24:46 WrapperNode [2023-08-24 05:24:46,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:24:46,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:24:46,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:24:46,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:24:46,507 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:24:46" (1/1) ... [2023-08-24 05:24:46,537 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:24:46" (1/1) ... [2023-08-24 05:24:46,579 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2023-08-24 05:24:46,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:24:46,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:24:46,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:24:46,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:24:46,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:24:46" (1/1) ... [2023-08-24 05:24:46,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:24:46" (1/1) ... [2023-08-24 05:24:46,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:24:46" (1/1) ... [2023-08-24 05:24:46,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:24:46" (1/1) ... [2023-08-24 05:24:46,613 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:24:46" (1/1) ... [2023-08-24 05:24:46,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:24:46" (1/1) ... [2023-08-24 05:24:46,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:24:46" (1/1) ... [2023-08-24 05:24:46,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:24:46" (1/1) ... [2023-08-24 05:24:46,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:24:46,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:24:46,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:24:46,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:24:46,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:24:46" (1/1) ... [2023-08-24 05:24:46,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:24:46,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:24:46,655 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:24:46,665 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:24:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:24:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:24:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:24:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:24:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:24:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:24:46,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:24:46,697 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:24:46,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:24:46,697 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:24:46,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:24:46,697 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 05:24:46,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 05:24:46,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:24:46,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:24:46,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:24:46,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:24:46,700 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:24:46,833 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:24:46,835 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:24:47,124 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:24:47,233 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:24:47,233 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:24:47,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:24:47 BoogieIcfgContainer [2023-08-24 05:24:47,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:24:47,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:24:47,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:24:47,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:24:47,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:24:45" (1/3) ... [2023-08-24 05:24:47,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f93c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:24:47, skipping insertion in model container [2023-08-24 05:24:47,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:24:46" (2/3) ... [2023-08-24 05:24:47,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f93c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:24:47, skipping insertion in model container [2023-08-24 05:24:47,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:24:47" (3/3) ... [2023-08-24 05:24:47,242 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018.opt.i [2023-08-24 05:24:47,257 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:24:47,257 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:24:47,257 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:24:47,306 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:24:47,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2023-08-24 05:24:47,396 INFO L124 PetriNetUnfolderBase]: 2/124 cut-off events. [2023-08-24 05:24:47,398 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:24:47,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-08-24 05:24:47,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2023-08-24 05:24:47,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2023-08-24 05:24:47,414 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:24:47,428 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2023-08-24 05:24:47,431 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2023-08-24 05:24:47,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2023-08-24 05:24:47,468 INFO L124 PetriNetUnfolderBase]: 2/124 cut-off events. [2023-08-24 05:24:47,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:24:47,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-08-24 05:24:47,474 INFO L119 LiptonReduction]: Number of co-enabled transitions 2718 [2023-08-24 05:24:51,327 INFO L134 LiptonReduction]: Checked pairs total: 6842 [2023-08-24 05:24:51,327 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-24 05:24:51,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:24:51,344 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;@1bddfaca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:24:51,344 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 05:24:51,362 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:24:51,362 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-08-24 05:24:51,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:24:51,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:24:51,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:24:51,364 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:24:51,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:24:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash 225750539, now seen corresponding path program 1 times [2023-08-24 05:24:51,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:24:51,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659293192] [2023-08-24 05:24:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:24:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:24:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:24:51,849 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:24:51,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:24:51,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659293192] [2023-08-24 05:24:51,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659293192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:24:51,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:24:51,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:24:51,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375239181] [2023-08-24 05:24:51,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:24:51,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:24:51,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:24:51,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:24:51,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:24:51,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 235 [2023-08-24 05:24:51,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:51,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:24:51,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 235 [2023-08-24 05:24:51,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:24:52,508 INFO L124 PetriNetUnfolderBase]: 3113/4511 cut-off events. [2023-08-24 05:24:52,509 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-24 05:24:52,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8905 conditions, 4511 events. 3113/4511 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24008 event pairs, 593 based on Foata normal form. 0/4327 useless extension candidates. Maximal degree in co-relation 8893. Up to 3385 conditions per place. [2023-08-24 05:24:52,537 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 32 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-08-24 05:24:52,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 162 flow [2023-08-24 05:24:52,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:24:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:24:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-08-24 05:24:52,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5404255319148936 [2023-08-24 05:24:52,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-08-24 05:24:52,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-08-24 05:24:52,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:24:52,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-08-24 05:24:52,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:52,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:52,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:52,564 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 381 transitions. [2023-08-24 05:24:52,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 162 flow [2023-08-24 05:24:52,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 05:24:52,570 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-08-24 05:24:52,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-24 05:24:52,574 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-24 05:24:52,574 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-08-24 05:24:52,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:52,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:24:52,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:24:52,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:24:52,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:24:52,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:24:52,576 INFO L85 PathProgramCache]: Analyzing trace with hash -582167020, now seen corresponding path program 1 times [2023-08-24 05:24:52,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:24:52,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138369277] [2023-08-24 05:24:52,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:24:52,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:24:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:24:52,824 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:24:52,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:24:52,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138369277] [2023-08-24 05:24:52,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138369277] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:24:52,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:24:52,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:24:52,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619845916] [2023-08-24 05:24:52,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:24:52,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:24:52,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:24:52,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:24:52,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:24:52,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-08-24 05:24:52,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:52,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:24:52,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-08-24 05:24:52,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:24:54,004 INFO L124 PetriNetUnfolderBase]: 9425/13038 cut-off events. [2023-08-24 05:24:54,004 INFO L125 PetriNetUnfolderBase]: For 500/500 co-relation queries the response was YES. [2023-08-24 05:24:54,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26854 conditions, 13038 events. 9425/13038 cut-off events. For 500/500 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 66800 event pairs, 3245 based on Foata normal form. 568/13606 useless extension candidates. Maximal degree in co-relation 26844. Up to 8141 conditions per place. [2023-08-24 05:24:54,072 INFO L140 encePairwiseOnDemand]: 226/235 looper letters, 40 selfloop transitions, 7 changer transitions 29/76 dead transitions. [2023-08-24 05:24:54,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 76 transitions, 326 flow [2023-08-24 05:24:54,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:24:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:24:54,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-08-24 05:24:54,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046808510638298 [2023-08-24 05:24:54,077 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-08-24 05:24:54,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-08-24 05:24:54,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:24:54,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-08-24 05:24:54,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:54,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:54,084 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:54,084 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 5 states and 593 transitions. [2023-08-24 05:24:54,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 76 transitions, 326 flow [2023-08-24 05:24:54,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:24:54,093 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 130 flow [2023-08-24 05:24:54,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-08-24 05:24:54,099 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-24 05:24:54,099 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 130 flow [2023-08-24 05:24:54,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:54,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:24:54,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:24:54,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:24:54,104 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:24:54,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:24:54,105 INFO L85 PathProgramCache]: Analyzing trace with hash -867327477, now seen corresponding path program 1 times [2023-08-24 05:24:54,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:24:54,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484581908] [2023-08-24 05:24:54,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:24:54,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:24:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:24:54,232 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:24:54,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:24:54,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484581908] [2023-08-24 05:24:54,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484581908] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:24:54,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:24:54,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:24:54,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706015469] [2023-08-24 05:24:54,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:24:54,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:24:54,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:24:54,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:24:54,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:24:54,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 235 [2023-08-24 05:24:54,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:54,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:24:54,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 235 [2023-08-24 05:24:54,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:24:55,038 INFO L124 PetriNetUnfolderBase]: 6051/8856 cut-off events. [2023-08-24 05:24:55,039 INFO L125 PetriNetUnfolderBase]: For 6283/6549 co-relation queries the response was YES. [2023-08-24 05:24:55,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23660 conditions, 8856 events. 6051/8856 cut-off events. For 6283/6549 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 49947 event pairs, 2041 based on Foata normal form. 484/9142 useless extension candidates. Maximal degree in co-relation 23646. Up to 4995 conditions per place. [2023-08-24 05:24:55,103 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 34 selfloop transitions, 3 changer transitions 24/67 dead transitions. [2023-08-24 05:24:55,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 380 flow [2023-08-24 05:24:55,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:24:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:24:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-24 05:24:55,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174468085106383 [2023-08-24 05:24:55,106 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-24 05:24:55,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-24 05:24:55,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:24:55,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-24 05:24:55,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:55,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:55,110 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:55,110 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 130 flow. Second operand 5 states and 608 transitions. [2023-08-24 05:24:55,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 380 flow [2023-08-24 05:24:55,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 67 transitions, 350 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 05:24:55,133 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 129 flow [2023-08-24 05:24:55,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-08-24 05:24:55,134 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2023-08-24 05:24:55,134 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 129 flow [2023-08-24 05:24:55,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:55,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:24:55,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:24:55,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:24:55,135 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:24:55,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:24:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1455448843, now seen corresponding path program 1 times [2023-08-24 05:24:55,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:24:55,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860910019] [2023-08-24 05:24:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:24:55,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:24:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:24:55,315 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:24:55,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:24:55,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860910019] [2023-08-24 05:24:55,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860910019] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:24:55,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:24:55,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:24:55,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765753051] [2023-08-24 05:24:55,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:24:55,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:24:55,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:24:55,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:24:55,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:24:55,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-08-24 05:24:55,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:55,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:24:55,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-08-24 05:24:55,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:24:56,243 INFO L124 PetriNetUnfolderBase]: 7483/10444 cut-off events. [2023-08-24 05:24:56,244 INFO L125 PetriNetUnfolderBase]: For 7554/7554 co-relation queries the response was YES. [2023-08-24 05:24:56,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28491 conditions, 10444 events. 7483/10444 cut-off events. For 7554/7554 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 52511 event pairs, 1905 based on Foata normal form. 380/10824 useless extension candidates. Maximal degree in co-relation 28474. Up to 6417 conditions per place. [2023-08-24 05:24:56,311 INFO L140 encePairwiseOnDemand]: 226/235 looper letters, 57 selfloop transitions, 11 changer transitions 32/100 dead transitions. [2023-08-24 05:24:56,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 100 transitions, 555 flow [2023-08-24 05:24:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:24:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:24:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 820 transitions. [2023-08-24 05:24:56,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49848024316109424 [2023-08-24 05:24:56,314 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 820 transitions. [2023-08-24 05:24:56,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 820 transitions. [2023-08-24 05:24:56,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:24:56,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 820 transitions. [2023-08-24 05:24:56,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:56,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:56,320 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:56,321 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 129 flow. Second operand 7 states and 820 transitions. [2023-08-24 05:24:56,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 100 transitions, 555 flow [2023-08-24 05:24:56,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 100 transitions, 535 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-24 05:24:56,342 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 193 flow [2023-08-24 05:24:56,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=193, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-08-24 05:24:56,343 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2023-08-24 05:24:56,343 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 193 flow [2023-08-24 05:24:56,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:56,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:24:56,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:24:56,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:24:56,344 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:24:56,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:24:56,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2125053244, now seen corresponding path program 1 times [2023-08-24 05:24:56,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:24:56,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915852167] [2023-08-24 05:24:56,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:24:56,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:24:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:24:56,542 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:24:56,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:24:56,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915852167] [2023-08-24 05:24:56,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915852167] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:24:56,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:24:56,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:24:56,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992394269] [2023-08-24 05:24:56,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:24:56,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:24:56,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:24:56,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:24:56,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:24:56,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-24 05:24:56,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:56,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:24:56,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-24 05:24:56,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:24:57,106 INFO L124 PetriNetUnfolderBase]: 4552/6701 cut-off events. [2023-08-24 05:24:57,106 INFO L125 PetriNetUnfolderBase]: For 8442/9001 co-relation queries the response was YES. [2023-08-24 05:24:57,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19849 conditions, 6701 events. 4552/6701 cut-off events. For 8442/9001 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 37814 event pairs, 972 based on Foata normal form. 606/7028 useless extension candidates. Maximal degree in co-relation 19830. Up to 4572 conditions per place. [2023-08-24 05:24:57,157 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 75 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2023-08-24 05:24:57,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 92 transitions, 615 flow [2023-08-24 05:24:57,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:24:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:24:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-08-24 05:24:57,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-08-24 05:24:57,160 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-08-24 05:24:57,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-08-24 05:24:57,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:24:57,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-08-24 05:24:57,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:57,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:57,164 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:57,164 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 193 flow. Second operand 5 states and 600 transitions. [2023-08-24 05:24:57,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 92 transitions, 615 flow [2023-08-24 05:24:57,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 92 transitions, 601 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-24 05:24:57,195 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 260 flow [2023-08-24 05:24:57,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-08-24 05:24:57,196 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2023-08-24 05:24:57,196 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 260 flow [2023-08-24 05:24:57,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:57,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:24:57,197 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:24:57,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:24:57,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:24:57,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:24:57,198 INFO L85 PathProgramCache]: Analyzing trace with hash 12403944, now seen corresponding path program 1 times [2023-08-24 05:24:57,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:24:57,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064467516] [2023-08-24 05:24:57,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:24:57,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:24:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:24:57,365 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:24:57,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:24:57,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064467516] [2023-08-24 05:24:57,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064467516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:24:57,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:24:57,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:24:57,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154051250] [2023-08-24 05:24:57,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:24:57,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:24:57,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:24:57,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:24:57,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:24:57,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-08-24 05:24:57,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:57,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:24:57,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-08-24 05:24:57,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:24:58,187 INFO L124 PetriNetUnfolderBase]: 6265/9454 cut-off events. [2023-08-24 05:24:58,188 INFO L125 PetriNetUnfolderBase]: For 13659/13918 co-relation queries the response was YES. [2023-08-24 05:24:58,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34325 conditions, 9454 events. 6265/9454 cut-off events. For 13659/13918 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 56972 event pairs, 2657 based on Foata normal form. 196/9347 useless extension candidates. Maximal degree in co-relation 34303. Up to 4332 conditions per place. [2023-08-24 05:24:58,232 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 55 selfloop transitions, 5 changer transitions 25/89 dead transitions. [2023-08-24 05:24:58,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 639 flow [2023-08-24 05:24:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:24:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:24:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2023-08-24 05:24:58,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157446808510638 [2023-08-24 05:24:58,234 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 606 transitions. [2023-08-24 05:24:58,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 606 transitions. [2023-08-24 05:24:58,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:24:58,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 606 transitions. [2023-08-24 05:24:58,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:58,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:58,238 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:58,238 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 260 flow. Second operand 5 states and 606 transitions. [2023-08-24 05:24:58,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 639 flow [2023-08-24 05:24:58,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 89 transitions, 628 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 05:24:58,266 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 250 flow [2023-08-24 05:24:58,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-24 05:24:58,267 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-24 05:24:58,267 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 250 flow [2023-08-24 05:24:58,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:58,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:24:58,267 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:24:58,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:24:58,268 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:24:58,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:24:58,268 INFO L85 PathProgramCache]: Analyzing trace with hash 71238541, now seen corresponding path program 1 times [2023-08-24 05:24:58,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:24:58,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29791302] [2023-08-24 05:24:58,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:24:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:24:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:24:58,410 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:24:58,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:24:58,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29791302] [2023-08-24 05:24:58,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29791302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:24:58,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:24:58,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:24:58,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065738999] [2023-08-24 05:24:58,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:24:58,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:24:58,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:24:58,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:24:58,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:24:58,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-24 05:24:58,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:58,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:24:58,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-24 05:24:58,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:24:58,895 INFO L124 PetriNetUnfolderBase]: 3333/5215 cut-off events. [2023-08-24 05:24:58,895 INFO L125 PetriNetUnfolderBase]: For 8414/8976 co-relation queries the response was YES. [2023-08-24 05:24:58,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19193 conditions, 5215 events. 3333/5215 cut-off events. For 8414/8976 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 30971 event pairs, 395 based on Foata normal form. 622/5651 useless extension candidates. Maximal degree in co-relation 19169. Up to 2129 conditions per place. [2023-08-24 05:24:58,919 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 100 selfloop transitions, 14 changer transitions 2/123 dead transitions. [2023-08-24 05:24:58,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 123 transitions, 938 flow [2023-08-24 05:24:58,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:24:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:24:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions. [2023-08-24 05:24:58,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5088145896656535 [2023-08-24 05:24:58,922 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 837 transitions. [2023-08-24 05:24:58,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions. [2023-08-24 05:24:58,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:24:58,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions. [2023-08-24 05:24:58,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:58,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:58,927 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:58,928 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 250 flow. Second operand 7 states and 837 transitions. [2023-08-24 05:24:58,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 123 transitions, 938 flow [2023-08-24 05:24:58,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 123 transitions, 905 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-24 05:24:58,951 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 349 flow [2023-08-24 05:24:58,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-08-24 05:24:58,952 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-08-24 05:24:58,952 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 349 flow [2023-08-24 05:24:58,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:58,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:24:58,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:24:58,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:24:58,953 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:24:58,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:24:58,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2067869032, now seen corresponding path program 1 times [2023-08-24 05:24:58,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:24:58,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467440288] [2023-08-24 05:24:58,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:24:58,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:24:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:24:59,117 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:24:59,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:24:59,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467440288] [2023-08-24 05:24:59,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467440288] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:24:59,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:24:59,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:24:59,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350553987] [2023-08-24 05:24:59,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:24:59,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:24:59,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:24:59,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:24:59,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:24:59,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-24 05:24:59,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:59,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:24:59,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-24 05:24:59,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:24:59,653 INFO L124 PetriNetUnfolderBase]: 2770/4416 cut-off events. [2023-08-24 05:24:59,653 INFO L125 PetriNetUnfolderBase]: For 9625/10318 co-relation queries the response was YES. [2023-08-24 05:24:59,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18824 conditions, 4416 events. 2770/4416 cut-off events. For 9625/10318 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 26546 event pairs, 230 based on Foata normal form. 452/4700 useless extension candidates. Maximal degree in co-relation 18799. Up to 1847 conditions per place. [2023-08-24 05:24:59,676 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 109 selfloop transitions, 22 changer transitions 15/153 dead transitions. [2023-08-24 05:24:59,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 153 transitions, 1239 flow [2023-08-24 05:24:59,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:24:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:24:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1075 transitions. [2023-08-24 05:24:59,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508274231678487 [2023-08-24 05:24:59,681 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1075 transitions. [2023-08-24 05:24:59,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1075 transitions. [2023-08-24 05:24:59,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:24:59,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1075 transitions. [2023-08-24 05:24:59,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.44444444444444) internal successors, (1075), 9 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:59,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:59,688 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:59,689 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 349 flow. Second operand 9 states and 1075 transitions. [2023-08-24 05:24:59,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 153 transitions, 1239 flow [2023-08-24 05:24:59,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 153 transitions, 1185 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-24 05:24:59,814 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 456 flow [2023-08-24 05:24:59,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=456, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2023-08-24 05:24:59,815 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2023-08-24 05:24:59,815 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 456 flow [2023-08-24 05:24:59,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:24:59,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:24:59,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:24:59,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:24:59,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:24:59,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:24:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1031539891, now seen corresponding path program 1 times [2023-08-24 05:24:59,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:24:59,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679294975] [2023-08-24 05:24:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:24:59,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:24:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:00,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:00,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679294975] [2023-08-24 05:25:00,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679294975] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:00,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:00,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:25:00,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677728082] [2023-08-24 05:25:00,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:00,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:25:00,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:00,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:25:00,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:25:00,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 235 [2023-08-24 05:25:00,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 456 flow. Second operand has 7 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:00,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:00,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 235 [2023-08-24 05:25:00,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:01,083 INFO L124 PetriNetUnfolderBase]: 5257/8205 cut-off events. [2023-08-24 05:25:01,083 INFO L125 PetriNetUnfolderBase]: For 27695/27695 co-relation queries the response was YES. [2023-08-24 05:25:01,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36399 conditions, 8205 events. 5257/8205 cut-off events. For 27695/27695 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 50315 event pairs, 270 based on Foata normal form. 16/8221 useless extension candidates. Maximal degree in co-relation 36372. Up to 3842 conditions per place. [2023-08-24 05:25:01,113 INFO L140 encePairwiseOnDemand]: 223/235 looper letters, 116 selfloop transitions, 38 changer transitions 75/229 dead transitions. [2023-08-24 05:25:01,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 229 transitions, 2341 flow [2023-08-24 05:25:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:25:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:25:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1007 transitions. [2023-08-24 05:25:01,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4761229314420804 [2023-08-24 05:25:01,117 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1007 transitions. [2023-08-24 05:25:01,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1007 transitions. [2023-08-24 05:25:01,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:01,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1007 transitions. [2023-08-24 05:25:01,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:01,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:01,123 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:01,123 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 456 flow. Second operand 9 states and 1007 transitions. [2023-08-24 05:25:01,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 229 transitions, 2341 flow [2023-08-24 05:25:01,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 229 transitions, 1952 flow, removed 148 selfloop flow, removed 3 redundant places. [2023-08-24 05:25:01,433 INFO L231 Difference]: Finished difference. Result has 78 places, 76 transitions, 662 flow [2023-08-24 05:25:01,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=662, PETRI_PLACES=78, PETRI_TRANSITIONS=76} [2023-08-24 05:25:01,435 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2023-08-24 05:25:01,435 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 76 transitions, 662 flow [2023-08-24 05:25:01,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:01,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:01,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:01,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:25:01,436 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:01,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:01,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1133163897, now seen corresponding path program 2 times [2023-08-24 05:25:01,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:01,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481630638] [2023-08-24 05:25:01,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:01,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:01,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:01,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481630638] [2023-08-24 05:25:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481630638] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:01,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:01,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:25:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103167246] [2023-08-24 05:25:01,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:01,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:25:01,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:01,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:25:01,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:25:01,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-24 05:25:01,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 76 transitions, 662 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:01,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:01,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-24 05:25:01,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:02,080 INFO L124 PetriNetUnfolderBase]: 1827/2953 cut-off events. [2023-08-24 05:25:02,080 INFO L125 PetriNetUnfolderBase]: For 10701/11148 co-relation queries the response was YES. [2023-08-24 05:25:02,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13018 conditions, 2953 events. 1827/2953 cut-off events. For 10701/11148 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 16961 event pairs, 144 based on Foata normal form. 271/3152 useless extension candidates. Maximal degree in co-relation 12989. Up to 1063 conditions per place. [2023-08-24 05:25:02,092 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 109 selfloop transitions, 18 changer transitions 36/174 dead transitions. [2023-08-24 05:25:02,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 174 transitions, 1772 flow [2023-08-24 05:25:02,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:25:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:25:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 938 transitions. [2023-08-24 05:25:02,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498936170212766 [2023-08-24 05:25:02,099 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 938 transitions. [2023-08-24 05:25:02,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 938 transitions. [2023-08-24 05:25:02,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:02,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 938 transitions. [2023-08-24 05:25:02,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.25) internal successors, (938), 8 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:02,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:02,104 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:02,105 INFO L175 Difference]: Start difference. First operand has 78 places, 76 transitions, 662 flow. Second operand 8 states and 938 transitions. [2023-08-24 05:25:02,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 174 transitions, 1772 flow [2023-08-24 05:25:02,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 174 transitions, 1641 flow, removed 46 selfloop flow, removed 7 redundant places. [2023-08-24 05:25:02,165 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 583 flow [2023-08-24 05:25:02,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=583, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2023-08-24 05:25:02,166 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2023-08-24 05:25:02,166 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 583 flow [2023-08-24 05:25:02,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:02,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:02,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:02,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:25:02,167 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:02,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:02,167 INFO L85 PathProgramCache]: Analyzing trace with hash -730202493, now seen corresponding path program 1 times [2023-08-24 05:25:02,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:02,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042949757] [2023-08-24 05:25:02,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:02,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:02,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:02,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042949757] [2023-08-24 05:25:02,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042949757] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:02,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:02,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:25:02,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970465657] [2023-08-24 05:25:02,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:02,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:25:02,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:02,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:25:02,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:25:02,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 235 [2023-08-24 05:25:02,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 583 flow. Second operand has 8 states, 8 states have (on average 100.25) internal successors, (802), 8 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:02,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:02,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 235 [2023-08-24 05:25:02,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:02,901 INFO L124 PetriNetUnfolderBase]: 1183/1891 cut-off events. [2023-08-24 05:25:02,901 INFO L125 PetriNetUnfolderBase]: For 6676/6676 co-relation queries the response was YES. [2023-08-24 05:25:02,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9110 conditions, 1891 events. 1183/1891 cut-off events. For 6676/6676 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8658 event pairs, 76 based on Foata normal form. 1/1892 useless extension candidates. Maximal degree in co-relation 9078. Up to 1109 conditions per place. [2023-08-24 05:25:02,911 INFO L140 encePairwiseOnDemand]: 224/235 looper letters, 89 selfloop transitions, 49 changer transitions 56/194 dead transitions. [2023-08-24 05:25:02,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 194 transitions, 1941 flow [2023-08-24 05:25:02,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 05:25:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 05:25:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1068 transitions. [2023-08-24 05:25:02,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.454468085106383 [2023-08-24 05:25:02,914 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1068 transitions. [2023-08-24 05:25:02,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1068 transitions. [2023-08-24 05:25:02,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:02,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1068 transitions. [2023-08-24 05:25:02,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.8) internal successors, (1068), 10 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:02,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:02,920 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:02,920 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 583 flow. Second operand 10 states and 1068 transitions. [2023-08-24 05:25:02,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 194 transitions, 1941 flow [2023-08-24 05:25:02,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 194 transitions, 1663 flow, removed 70 selfloop flow, removed 11 redundant places. [2023-08-24 05:25:02,942 INFO L231 Difference]: Finished difference. Result has 74 places, 93 transitions, 838 flow [2023-08-24 05:25:02,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=838, PETRI_PLACES=74, PETRI_TRANSITIONS=93} [2023-08-24 05:25:02,943 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2023-08-24 05:25:02,943 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 93 transitions, 838 flow [2023-08-24 05:25:02,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.25) internal successors, (802), 8 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:02,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:02,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:02,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:25:02,944 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:02,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:02,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1405403771, now seen corresponding path program 2 times [2023-08-24 05:25:02,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:02,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132156648] [2023-08-24 05:25:02,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:02,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:03,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:03,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132156648] [2023-08-24 05:25:03,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132156648] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:03,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:03,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:25:03,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708385206] [2023-08-24 05:25:03,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:03,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:25:03,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:03,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:25:03,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:25:03,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-08-24 05:25:03,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 93 transitions, 838 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:03,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:03,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-08-24 05:25:03,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:03,342 INFO L124 PetriNetUnfolderBase]: 871/1497 cut-off events. [2023-08-24 05:25:03,342 INFO L125 PetriNetUnfolderBase]: For 5969/6031 co-relation queries the response was YES. [2023-08-24 05:25:03,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6634 conditions, 1497 events. 871/1497 cut-off events. For 5969/6031 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7571 event pairs, 155 based on Foata normal form. 22/1496 useless extension candidates. Maximal degree in co-relation 6611. Up to 703 conditions per place. [2023-08-24 05:25:03,349 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 45 selfloop transitions, 1 changer transitions 84/134 dead transitions. [2023-08-24 05:25:03,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 134 transitions, 1335 flow [2023-08-24 05:25:03,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:25:03,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:25:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-08-24 05:25:03,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502127659574468 [2023-08-24 05:25:03,351 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-08-24 05:25:03,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-08-24 05:25:03,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:03,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-08-24 05:25:03,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:03,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:03,354 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:03,355 INFO L175 Difference]: Start difference. First operand has 74 places, 93 transitions, 838 flow. Second operand 5 states and 590 transitions. [2023-08-24 05:25:03,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 134 transitions, 1335 flow [2023-08-24 05:25:03,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 134 transitions, 1286 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-08-24 05:25:03,374 INFO L231 Difference]: Finished difference. Result has 74 places, 46 transitions, 309 flow [2023-08-24 05:25:03,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=309, PETRI_PLACES=74, PETRI_TRANSITIONS=46} [2023-08-24 05:25:03,375 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2023-08-24 05:25:03,375 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 46 transitions, 309 flow [2023-08-24 05:25:03,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:03,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:03,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:03,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:25:03,376 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:03,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:03,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1602658053, now seen corresponding path program 3 times [2023-08-24 05:25:03,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:03,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405072737] [2023-08-24 05:25:03,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:03,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:03,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:03,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405072737] [2023-08-24 05:25:03,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405072737] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:03,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:03,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:25:03,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25033560] [2023-08-24 05:25:03,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:03,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:25:03,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:03,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:25:03,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:25:03,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-08-24 05:25:03,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 46 transitions, 309 flow. Second operand has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:03,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:03,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-08-24 05:25:03,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:03,778 INFO L124 PetriNetUnfolderBase]: 321/584 cut-off events. [2023-08-24 05:25:03,778 INFO L125 PetriNetUnfolderBase]: For 1945/1945 co-relation queries the response was YES. [2023-08-24 05:25:03,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2579 conditions, 584 events. 321/584 cut-off events. For 1945/1945 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2506 event pairs, 36 based on Foata normal form. 1/585 useless extension candidates. Maximal degree in co-relation 2557. Up to 249 conditions per place. [2023-08-24 05:25:03,781 INFO L140 encePairwiseOnDemand]: 227/235 looper letters, 48 selfloop transitions, 5 changer transitions 42/95 dead transitions. [2023-08-24 05:25:03,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 95 transitions, 768 flow [2023-08-24 05:25:03,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:25:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:25:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 764 transitions. [2023-08-24 05:25:03,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4644376899696049 [2023-08-24 05:25:03,783 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 764 transitions. [2023-08-24 05:25:03,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 764 transitions. [2023-08-24 05:25:03,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:03,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 764 transitions. [2023-08-24 05:25:03,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:03,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:03,787 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:03,787 INFO L175 Difference]: Start difference. First operand has 74 places, 46 transitions, 309 flow. Second operand 7 states and 764 transitions. [2023-08-24 05:25:03,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 95 transitions, 768 flow [2023-08-24 05:25:03,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 95 transitions, 702 flow, removed 12 selfloop flow, removed 13 redundant places. [2023-08-24 05:25:03,793 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 207 flow [2023-08-24 05:25:03,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2023-08-24 05:25:03,795 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2023-08-24 05:25:03,795 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 207 flow [2023-08-24 05:25:03,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:03,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:03,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:03,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:25:03,796 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:03,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash 802981369, now seen corresponding path program 4 times [2023-08-24 05:25:03,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:03,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235584366] [2023-08-24 05:25:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:03,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:25:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:25:04,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:25:04,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235584366] [2023-08-24 05:25:04,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235584366] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:25:04,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:25:04,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:25:04,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376586799] [2023-08-24 05:25:04,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:25:04,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:25:04,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:25:04,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:25:04,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:25:04,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 235 [2023-08-24 05:25:04,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 38 transitions, 207 flow. Second operand has 8 states, 8 states have (on average 106.875) internal successors, (855), 8 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:04,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:25:04,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 235 [2023-08-24 05:25:04,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:25:04,737 INFO L124 PetriNetUnfolderBase]: 165/341 cut-off events. [2023-08-24 05:25:04,738 INFO L125 PetriNetUnfolderBase]: For 664/665 co-relation queries the response was YES. [2023-08-24 05:25:04,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 341 events. 165/341 cut-off events. For 664/665 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1442 event pairs, 25 based on Foata normal form. 1/337 useless extension candidates. Maximal degree in co-relation 1311. Up to 147 conditions per place. [2023-08-24 05:25:04,739 INFO L140 encePairwiseOnDemand]: 227/235 looper letters, 39 selfloop transitions, 5 changer transitions 24/71 dead transitions. [2023-08-24 05:25:04,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 71 transitions, 536 flow [2023-08-24 05:25:04,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:25:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:25:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 975 transitions. [2023-08-24 05:25:04,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46099290780141844 [2023-08-24 05:25:04,742 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 975 transitions. [2023-08-24 05:25:04,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 975 transitions. [2023-08-24 05:25:04,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:25:04,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 975 transitions. [2023-08-24 05:25:04,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 108.33333333333333) internal successors, (975), 9 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:04,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:04,747 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:04,747 INFO L175 Difference]: Start difference. First operand has 62 places, 38 transitions, 207 flow. Second operand 9 states and 975 transitions. [2023-08-24 05:25:04,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 71 transitions, 536 flow [2023-08-24 05:25:04,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 492 flow, removed 11 selfloop flow, removed 8 redundant places. [2023-08-24 05:25:04,750 INFO L231 Difference]: Finished difference. Result has 60 places, 38 transitions, 195 flow [2023-08-24 05:25:04,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=195, PETRI_PLACES=60, PETRI_TRANSITIONS=38} [2023-08-24 05:25:04,751 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2023-08-24 05:25:04,751 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 38 transitions, 195 flow [2023-08-24 05:25:04,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.875) internal successors, (855), 8 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:25:04,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:25:04,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:04,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 05:25:04,752 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:25:04,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:25:04,752 INFO L85 PathProgramCache]: Analyzing trace with hash 822612949, now seen corresponding path program 5 times [2023-08-24 05:25:04,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:25:04,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498369965] [2023-08-24 05:25:04,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:25:04,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:25:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:25:04,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:25:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:25:04,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:25:04,884 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:25:04,884 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 05:25:04,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 05:25:04,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 05:25:04,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 05:25:04,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 05:25:04,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 05:25:04,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 05:25:04,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 05:25:04,888 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:25:04,894 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:25:04,894 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:25:04,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:25:04 BasicIcfg [2023-08-24 05:25:04,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:25:04,986 INFO L158 Benchmark]: Toolchain (without parser) took 19060.82ms. Allocated memory was 377.5MB in the beginning and 977.3MB in the end (delta: 599.8MB). Free memory was 352.9MB in the beginning and 850.8MB in the end (delta: -497.9MB). Peak memory consumption was 102.2MB. Max. memory is 16.0GB. [2023-08-24 05:25:04,987 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 377.5MB. Free memory was 355.2MB in the beginning and 355.1MB in the end (delta: 78.6kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:25:04,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.02ms. Allocated memory is still 377.5MB. Free memory was 352.6MB in the beginning and 328.1MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:25:04,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.72ms. Allocated memory is still 377.5MB. Free memory was 327.8MB in the beginning and 325.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:25:04,988 INFO L158 Benchmark]: Boogie Preprocessor took 46.23ms. Allocated memory is still 377.5MB. Free memory was 325.0MB in the beginning and 323.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:25:04,988 INFO L158 Benchmark]: RCFGBuilder took 608.78ms. Allocated memory is still 377.5MB. Free memory was 322.9MB in the beginning and 333.5MB in the end (delta: -10.6MB). Peak memory consumption was 25.3MB. Max. memory is 16.0GB. [2023-08-24 05:25:04,988 INFO L158 Benchmark]: TraceAbstraction took 17748.98ms. Allocated memory was 377.5MB in the beginning and 977.3MB in the end (delta: 599.8MB). Free memory was 332.7MB in the beginning and 850.8MB in the end (delta: -518.2MB). Peak memory consumption was 81.1MB. Max. memory is 16.0GB. [2023-08-24 05:25:04,989 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 377.5MB. Free memory was 355.2MB in the beginning and 355.1MB in the end (delta: 78.6kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 573.02ms. Allocated memory is still 377.5MB. Free memory was 352.6MB in the beginning and 328.1MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 78.72ms. Allocated memory is still 377.5MB. Free memory was 327.8MB in the beginning and 325.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.23ms. Allocated memory is still 377.5MB. Free memory was 325.0MB in the beginning and 323.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 608.78ms. Allocated memory is still 377.5MB. Free memory was 322.9MB in the beginning and 333.5MB in the end (delta: -10.6MB). Peak memory consumption was 25.3MB. Max. memory is 16.0GB. * TraceAbstraction took 17748.98ms. Allocated memory was 377.5MB in the beginning and 977.3MB in the end (delta: 599.8MB). Free memory was 332.7MB in the beginning and 850.8MB in the end (delta: -518.2MB). Peak memory consumption was 81.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 135 PlacesBefore, 41 PlacesAfterwards, 124 TransitionsBefore, 29 TransitionsAfterwards, 2718 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 6842 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3154, independent: 2962, independent conditional: 0, independent unconditional: 2962, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1429, independent: 1399, independent conditional: 0, independent unconditional: 1399, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3154, independent: 1563, independent conditional: 0, independent unconditional: 1563, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1429, unknown conditional: 0, unknown unconditional: 1429] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t469; [L865] FCALL, FORK 0 pthread_create(&t469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t469, ((void *)0), P0, ((void *)0))=-4, t469={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t470; [L867] FCALL, FORK 0 pthread_create(&t470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t470, ((void *)0), P1, ((void *)0))=-3, t469={5:0}, t470={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t471; [L869] FCALL, FORK 0 pthread_create(&t471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t471, ((void *)0), P2, ((void *)0))=-2, t469={5:0}, t470={6:0}, t471={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L870] 0 pthread_t t472; [L871] FCALL, FORK 0 pthread_create(&t472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t472, ((void *)0), P3, ((void *)0))=-1, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: 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: 867]: 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: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 162 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 587 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 587 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1907 IncrementalHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 42 mSDtfsCounter, 1907 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=838occurred in iteration=11, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 05:25:05,014 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...