/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 PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:44:50,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:44:50,740 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 11:44:50,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:44:50,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:44:50,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:44:50,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:44:50,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:44:50,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:44:50,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:44:50,782 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:44:50,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:44:50,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:44:50,783 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:44:50,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:44:50,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:44:50,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:44:50,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:44:50,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:44:50,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:44:50,785 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:44:50,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:44:50,786 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:44:50,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:44:50,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:44:50,787 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:44:50,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:44:50,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:44:50,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:44:50,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:44:50,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:44:50,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:44:50,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:44:50,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:44:50,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:44:50,789 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 -> PROGRAM_FIRST [2023-08-24 11:44:51,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:44:51,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:44:51,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:44:51,106 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:44:51,106 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:44:51,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2023-08-24 11:44:52,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:44:52,560 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:44:52,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2023-08-24 11:44:52,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6652730dc/54c43bfd7e804f2e970c0e9cfd3bb8f2/FLAG0c0ab0462 [2023-08-24 11:44:52,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6652730dc/54c43bfd7e804f2e970c0e9cfd3bb8f2 [2023-08-24 11:44:52,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:44:52,600 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:44:52,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:44:52,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:44:52,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:44:52,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:44:52" (1/1) ... [2023-08-24 11:44:52,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f151090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:52, skipping insertion in model container [2023-08-24 11:44:52,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:44:52" (1/1) ... [2023-08-24 11:44:52,648 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:44:52,819 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/mix055.opt.i[944,957] [2023-08-24 11:44:53,042 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:44:53,059 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:44:53,070 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/mix055.opt.i[944,957] [2023-08-24 11:44:53,090 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:44:53,092 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:44:53,138 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:44:53,173 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:44:53,173 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:44:53,179 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:44:53,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:53 WrapperNode [2023-08-24 11:44:53,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:44:53,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:44:53,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:44:53,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:44:53,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:53" (1/1) ... [2023-08-24 11:44:53,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:53" (1/1) ... [2023-08-24 11:44:53,251 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-08-24 11:44:53,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:44:53,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:44:53,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:44:53,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:44:53,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:53" (1/1) ... [2023-08-24 11:44:53,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:53" (1/1) ... [2023-08-24 11:44:53,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:53" (1/1) ... [2023-08-24 11:44:53,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:53" (1/1) ... [2023-08-24 11:44:53,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:53" (1/1) ... [2023-08-24 11:44:53,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:53" (1/1) ... [2023-08-24 11:44:53,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:53" (1/1) ... [2023-08-24 11:44:53,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:53" (1/1) ... [2023-08-24 11:44:53,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:44:53,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:44:53,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:44:53,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:44:53,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:53" (1/1) ... [2023-08-24 11:44:53,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:44:53,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:44:53,338 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 11:44:53,352 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 11:44:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:44:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 11:44:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:44:53,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:44:53,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:44:53,380 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 11:44:53,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 11:44:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 11:44:53,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 11:44:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 11:44:53,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 11:44:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 11:44:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 11:44:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:44:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 11:44:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:44:53,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:44:53,384 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 11:44:53,545 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:44:53,547 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:44:53,877 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:44:53,995 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:44:53,995 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 11:44:53,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:44:53 BoogieIcfgContainer [2023-08-24 11:44:53,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:44:54,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:44:54,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:44:54,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:44:54,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:44:52" (1/3) ... [2023-08-24 11:44:54,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ceb5e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:44:54, skipping insertion in model container [2023-08-24 11:44:54,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:53" (2/3) ... [2023-08-24 11:44:54,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ceb5e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:44:54, skipping insertion in model container [2023-08-24 11:44:54,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:44:53" (3/3) ... [2023-08-24 11:44:54,008 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2023-08-24 11:44:54,025 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:44:54,025 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 11:44:54,025 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:44:54,074 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:44:54,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 272 flow [2023-08-24 11:44:54,149 INFO L124 PetriNetUnfolderBase]: 2/122 cut-off events. [2023-08-24 11:44:54,150 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:44:54,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-08-24 11:44:54,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 126 transitions, 272 flow [2023-08-24 11:44:54,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 122 transitions, 256 flow [2023-08-24 11:44:54,162 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:44:54,170 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 122 transitions, 256 flow [2023-08-24 11:44:54,173 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 122 transitions, 256 flow [2023-08-24 11:44:54,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 122 transitions, 256 flow [2023-08-24 11:44:54,222 INFO L124 PetriNetUnfolderBase]: 2/122 cut-off events. [2023-08-24 11:44:54,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:44:54,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-08-24 11:44:54,227 INFO L119 LiptonReduction]: Number of co-enabled transitions 2736 [2023-08-24 11:44:58,851 INFO L134 LiptonReduction]: Checked pairs total: 6937 [2023-08-24 11:44:58,851 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-08-24 11:44:58,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:44:58,878 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;@60287525, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:44:58,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 11:44:58,895 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:44:58,895 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2023-08-24 11:44:58,896 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:44:58,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:58,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:58,897 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 11:44:58,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:58,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1113147127, now seen corresponding path program 1 times [2023-08-24 11:44:58,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:58,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055999884] [2023-08-24 11:44:58,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:58,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:59,418 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 11:44:59,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:59,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055999884] [2023-08-24 11:44:59,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055999884] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:59,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:59,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:44:59,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818595499] [2023-08-24 11:44:59,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:59,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:44:59,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:59,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:44:59,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:44:59,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 235 [2023-08-24 11:44:59,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:44:59,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:59,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 235 [2023-08-24 11:44:59,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:59,924 INFO L124 PetriNetUnfolderBase]: 2075/3094 cut-off events. [2023-08-24 11:44:59,924 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-08-24 11:44:59,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6090 conditions, 3094 events. 2075/3094 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16319 event pairs, 518 based on Foata normal form. 0/2937 useless extension candidates. Maximal degree in co-relation 6078. Up to 2098 conditions per place. [2023-08-24 11:44:59,946 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 29 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-24 11:44:59,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 152 flow [2023-08-24 11:44:59,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:44:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:44:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-24 11:44:59,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2023-08-24 11:44:59,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-24 11:44:59,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-24 11:44:59,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:59,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-24 11:44:59,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:44:59,971 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 11:44:59,972 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 11:44:59,974 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 3 states and 370 transitions. [2023-08-24 11:44:59,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 152 flow [2023-08-24 11:44:59,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 11:44:59,979 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-08-24 11:44:59,981 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-24 11:44:59,984 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-24 11:44:59,984 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-08-24 11:44:59,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:44:59,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:59,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:59,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:44:59,986 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 11:44:59,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:59,986 INFO L85 PathProgramCache]: Analyzing trace with hash -287467971, now seen corresponding path program 1 times [2023-08-24 11:44:59,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:59,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185710115] [2023-08-24 11:44:59,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:59,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:00,878 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 11:45:00,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:00,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185710115] [2023-08-24 11:45:00,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185710115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:00,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:00,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:45:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392470629] [2023-08-24 11:45:00,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:00,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:45:00,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:00,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:45:00,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:45:00,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 235 [2023-08-24 11:45:00,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:00,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:00,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 235 [2023-08-24 11:45:00,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:01,766 INFO L124 PetriNetUnfolderBase]: 6684/9253 cut-off events. [2023-08-24 11:45:01,767 INFO L125 PetriNetUnfolderBase]: For 444/444 co-relation queries the response was YES. [2023-08-24 11:45:01,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19240 conditions, 9253 events. 6684/9253 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 47083 event pairs, 506 based on Foata normal form. 250/9503 useless extension candidates. Maximal degree in co-relation 19230. Up to 6757 conditions per place. [2023-08-24 11:45:01,828 INFO L140 encePairwiseOnDemand]: 225/235 looper letters, 51 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2023-08-24 11:45:01,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 62 transitions, 274 flow [2023-08-24 11:45:01,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2023-08-24 11:45:01,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851063829787234 [2023-08-24 11:45:01,834 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 456 transitions. [2023-08-24 11:45:01,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 456 transitions. [2023-08-24 11:45:01,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:01,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 456 transitions. [2023-08-24 11:45:01,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:01,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:01,840 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:01,840 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 4 states and 456 transitions. [2023-08-24 11:45:01,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 62 transitions, 274 flow [2023-08-24 11:45:01,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 62 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:45:01,844 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 128 flow [2023-08-24 11:45:01,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2023-08-24 11:45:01,847 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-08-24 11:45:01,848 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 128 flow [2023-08-24 11:45:01,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:01,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:01,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:01,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:45:01,853 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 11:45:01,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:01,854 INFO L85 PathProgramCache]: Analyzing trace with hash -321574632, now seen corresponding path program 1 times [2023-08-24 11:45:01,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:01,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390947392] [2023-08-24 11:45:01,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:01,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:02,250 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 11:45:02,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:02,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390947392] [2023-08-24 11:45:02,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390947392] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:02,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:02,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:45:02,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613068144] [2023-08-24 11:45:02,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:02,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:45:02,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:02,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:45:02,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:45:02,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-24 11:45:02,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:02,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:02,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-24 11:45:02,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:02,952 INFO L124 PetriNetUnfolderBase]: 5106/7424 cut-off events. [2023-08-24 11:45:02,952 INFO L125 PetriNetUnfolderBase]: For 2630/2659 co-relation queries the response was YES. [2023-08-24 11:45:02,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19410 conditions, 7424 events. 5106/7424 cut-off events. For 2630/2659 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 39904 event pairs, 1437 based on Foata normal form. 39/7296 useless extension candidates. Maximal degree in co-relation 19398. Up to 5940 conditions per place. [2023-08-24 11:45:03,015 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 39 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-08-24 11:45:03,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 264 flow [2023-08-24 11:45:03,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:45:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:45:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-08-24 11:45:03,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2023-08-24 11:45:03,017 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-08-24 11:45:03,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-08-24 11:45:03,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:03,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-08-24 11:45:03,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:03,021 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 11:45:03,021 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 11:45:03,021 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 128 flow. Second operand 3 states and 355 transitions. [2023-08-24 11:45:03,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 264 flow [2023-08-24 11:45:03,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:45:03,025 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 159 flow [2023-08-24 11:45:03,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2023-08-24 11:45:03,026 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-08-24 11:45:03,029 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 159 flow [2023-08-24 11:45:03,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:03,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:03,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:03,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:45:03,030 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 11:45:03,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1406657115, now seen corresponding path program 1 times [2023-08-24 11:45:03,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:03,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466032137] [2023-08-24 11:45:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45: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 11:45:03,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:03,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466032137] [2023-08-24 11:45:03,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466032137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:03,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:03,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:03,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058326128] [2023-08-24 11:45:03,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:03,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:45:03,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:03,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:45:03,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:45:03,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-24 11:45:03,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:03,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:03,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-24 11:45:03,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:04,312 INFO L124 PetriNetUnfolderBase]: 4886/7124 cut-off events. [2023-08-24 11:45:04,312 INFO L125 PetriNetUnfolderBase]: For 3968/4005 co-relation queries the response was YES. [2023-08-24 11:45:04,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19824 conditions, 7124 events. 4886/7124 cut-off events. For 3968/4005 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 38234 event pairs, 1369 based on Foata normal form. 77/7050 useless extension candidates. Maximal degree in co-relation 19809. Up to 5184 conditions per place. [2023-08-24 11:45:04,424 INFO L140 encePairwiseOnDemand]: 230/235 looper letters, 49 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-08-24 11:45:04,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 356 flow [2023-08-24 11:45:04,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-08-24 11:45:04,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010638297872341 [2023-08-24 11:45:04,426 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-08-24 11:45:04,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-08-24 11:45:04,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:04,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-08-24 11:45:04,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:04,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:04,430 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:04,430 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 159 flow. Second operand 4 states and 471 transitions. [2023-08-24 11:45:04,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 356 flow [2023-08-24 11:45:04,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:45:04,436 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 195 flow [2023-08-24 11:45:04,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-24 11:45:04,438 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-24 11:45:04,438 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 195 flow [2023-08-24 11:45:04,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:04,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:04,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:04,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:45:04,439 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 11:45:04,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:04,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1865560878, now seen corresponding path program 1 times [2023-08-24 11:45:04,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:04,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139571157] [2023-08-24 11:45:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:04,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:05,055 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 11:45:05,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:05,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139571157] [2023-08-24 11:45:05,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139571157] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:05,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:05,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:45:05,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022881557] [2023-08-24 11:45:05,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:05,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:45:05,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:05,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:45:05,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:45:05,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-24 11:45:05,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:05,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:05,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-24 11:45:05,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:06,299 INFO L124 PetriNetUnfolderBase]: 8552/12021 cut-off events. [2023-08-24 11:45:06,299 INFO L125 PetriNetUnfolderBase]: For 9456/9456 co-relation queries the response was YES. [2023-08-24 11:45:06,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35495 conditions, 12021 events. 8552/12021 cut-off events. For 9456/9456 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 63597 event pairs, 1133 based on Foata normal form. 136/12157 useless extension candidates. Maximal degree in co-relation 35478. Up to 5245 conditions per place. [2023-08-24 11:45:06,377 INFO L140 encePairwiseOnDemand]: 224/235 looper letters, 78 selfloop transitions, 31 changer transitions 11/120 dead transitions. [2023-08-24 11:45:06,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 120 transitions, 795 flow [2023-08-24 11:45:06,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:45:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:45:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 666 transitions. [2023-08-24 11:45:06,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723404255319149 [2023-08-24 11:45:06,380 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 666 transitions. [2023-08-24 11:45:06,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 666 transitions. [2023-08-24 11:45:06,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:06,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 666 transitions. [2023-08-24 11:45:06,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:06,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:06,385 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:06,386 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 195 flow. Second operand 6 states and 666 transitions. [2023-08-24 11:45:06,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 120 transitions, 795 flow [2023-08-24 11:45:06,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 120 transitions, 764 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-24 11:45:06,398 INFO L231 Difference]: Finished difference. Result has 53 places, 64 transitions, 474 flow [2023-08-24 11:45:06,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=53, PETRI_TRANSITIONS=64} [2023-08-24 11:45:06,400 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2023-08-24 11:45:06,401 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 64 transitions, 474 flow [2023-08-24 11:45:06,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:06,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:06,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:06,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:45:06,401 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 11:45:06,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:06,402 INFO L85 PathProgramCache]: Analyzing trace with hash 130203404, now seen corresponding path program 1 times [2023-08-24 11:45:06,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:06,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207507057] [2023-08-24 11:45:06,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:06,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:06,609 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 11:45:06,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:06,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207507057] [2023-08-24 11:45:06,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207507057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:06,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:06,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:45:06,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919184568] [2023-08-24 11:45:06,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:06,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:45:06,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:06,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:45:06,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:45:06,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-08-24 11:45:06,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 64 transitions, 474 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:06,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:06,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-08-24 11:45:06,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:07,634 INFO L124 PetriNetUnfolderBase]: 6719/10003 cut-off events. [2023-08-24 11:45:07,635 INFO L125 PetriNetUnfolderBase]: For 19460/19718 co-relation queries the response was YES. [2023-08-24 11:45:07,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35118 conditions, 10003 events. 6719/10003 cut-off events. For 19460/19718 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 59087 event pairs, 1445 based on Foata normal form. 136/9996 useless extension candidates. Maximal degree in co-relation 35096. Up to 6626 conditions per place. [2023-08-24 11:45:07,726 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 66 selfloop transitions, 21 changer transitions 0/101 dead transitions. [2023-08-24 11:45:07,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 101 transitions, 881 flow [2023-08-24 11:45:07,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-08-24 11:45:07,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-08-24 11:45:07,729 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-08-24 11:45:07,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-08-24 11:45:07,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:07,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-08-24 11:45:07,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:07,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:07,733 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:07,733 INFO L175 Difference]: Start difference. First operand has 53 places, 64 transitions, 474 flow. Second operand 4 states and 480 transitions. [2023-08-24 11:45:07,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 101 transitions, 881 flow [2023-08-24 11:45:07,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 101 transitions, 881 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:45:07,775 INFO L231 Difference]: Finished difference. Result has 57 places, 73 transitions, 617 flow [2023-08-24 11:45:07,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=617, PETRI_PLACES=57, PETRI_TRANSITIONS=73} [2023-08-24 11:45:07,778 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2023-08-24 11:45:07,778 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 73 transitions, 617 flow [2023-08-24 11:45:07,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:07,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:07,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:07,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:45:07,779 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 11:45:07,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1174200464, now seen corresponding path program 2 times [2023-08-24 11:45:07,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:07,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798449465] [2023-08-24 11:45:07,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:07,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:08,167 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 11:45:08,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:08,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798449465] [2023-08-24 11:45:08,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798449465] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:08,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:08,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:08,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365020208] [2023-08-24 11:45:08,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:08,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:45:08,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:08,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:45:08,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:45:08,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-24 11:45:08,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 73 transitions, 617 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:08,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:08,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-24 11:45:08,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:09,087 INFO L124 PetriNetUnfolderBase]: 7148/10559 cut-off events. [2023-08-24 11:45:09,087 INFO L125 PetriNetUnfolderBase]: For 28382/28803 co-relation queries the response was YES. [2023-08-24 11:45:09,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40348 conditions, 10559 events. 7148/10559 cut-off events. For 28382/28803 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 62507 event pairs, 1440 based on Foata normal form. 208/10543 useless extension candidates. Maximal degree in co-relation 40323. Up to 6906 conditions per place. [2023-08-24 11:45:09,168 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 73 selfloop transitions, 31 changer transitions 1/119 dead transitions. [2023-08-24 11:45:09,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 119 transitions, 1136 flow [2023-08-24 11:45:09,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:45:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:45:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2023-08-24 11:45:09,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49957446808510636 [2023-08-24 11:45:09,171 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 587 transitions. [2023-08-24 11:45:09,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 587 transitions. [2023-08-24 11:45:09,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:09,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 587 transitions. [2023-08-24 11:45:09,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:09,174 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 11:45:09,175 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 11:45:09,175 INFO L175 Difference]: Start difference. First operand has 57 places, 73 transitions, 617 flow. Second operand 5 states and 587 transitions. [2023-08-24 11:45:09,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 119 transitions, 1136 flow [2023-08-24 11:45:09,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 119 transitions, 1112 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-24 11:45:09,227 INFO L231 Difference]: Finished difference. Result has 62 places, 86 transitions, 832 flow [2023-08-24 11:45:09,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=832, PETRI_PLACES=62, PETRI_TRANSITIONS=86} [2023-08-24 11:45:09,228 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2023-08-24 11:45:09,228 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 86 transitions, 832 flow [2023-08-24 11:45:09,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:09,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:09,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:09,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:45:09,229 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 11:45:09,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:09,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1449931395, now seen corresponding path program 1 times [2023-08-24 11:45:09,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:09,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271000899] [2023-08-24 11:45:09,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:09,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:09,704 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 11:45:09,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:09,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271000899] [2023-08-24 11:45:09,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271000899] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:09,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:09,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:45:09,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37302087] [2023-08-24 11:45:09,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:09,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:45:09,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:09,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:45:09,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:45:09,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-24 11:45:09,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 86 transitions, 832 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:09,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:09,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-24 11:45:09,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:10,740 INFO L124 PetriNetUnfolderBase]: 7130/10549 cut-off events. [2023-08-24 11:45:10,740 INFO L125 PetriNetUnfolderBase]: For 40646/41078 co-relation queries the response was YES. [2023-08-24 11:45:10,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43640 conditions, 10549 events. 7130/10549 cut-off events. For 40646/41078 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 62300 event pairs, 1129 based on Foata normal form. 230/10557 useless extension candidates. Maximal degree in co-relation 43612. Up to 7234 conditions per place. [2023-08-24 11:45:10,803 INFO L140 encePairwiseOnDemand]: 230/235 looper letters, 77 selfloop transitions, 25 changer transitions 0/116 dead transitions. [2023-08-24 11:45:10,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 116 transitions, 1232 flow [2023-08-24 11:45:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2023-08-24 11:45:10,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5031914893617021 [2023-08-24 11:45:10,806 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 473 transitions. [2023-08-24 11:45:10,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions. [2023-08-24 11:45:10,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:10,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions. [2023-08-24 11:45:10,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:10,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:10,809 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:10,809 INFO L175 Difference]: Start difference. First operand has 62 places, 86 transitions, 832 flow. Second operand 4 states and 473 transitions. [2023-08-24 11:45:10,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 116 transitions, 1232 flow [2023-08-24 11:45:10,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 116 transitions, 1212 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-24 11:45:10,919 INFO L231 Difference]: Finished difference. Result has 67 places, 91 transitions, 963 flow [2023-08-24 11:45:10,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=963, PETRI_PLACES=67, PETRI_TRANSITIONS=91} [2023-08-24 11:45:10,919 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-08-24 11:45:10,920 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 91 transitions, 963 flow [2023-08-24 11:45:10,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:10,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:10,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:10,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:45:10,921 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 11:45:10,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:10,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2040400547, now seen corresponding path program 1 times [2023-08-24 11:45:10,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:10,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283108076] [2023-08-24 11:45:10,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:10,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:11,260 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 11:45:11,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:11,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283108076] [2023-08-24 11:45:11,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283108076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:11,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:11,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:45:11,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069714200] [2023-08-24 11:45:11,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:11,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:45:11,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:11,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:45:11,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:45:11,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-24 11:45:11,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 91 transitions, 963 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:11,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:11,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-24 11:45:11,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:12,280 INFO L124 PetriNetUnfolderBase]: 7469/11019 cut-off events. [2023-08-24 11:45:12,280 INFO L125 PetriNetUnfolderBase]: For 54638/55176 co-relation queries the response was YES. [2023-08-24 11:45:12,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48432 conditions, 11019 events. 7469/11019 cut-off events. For 54638/55176 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 65688 event pairs, 1579 based on Foata normal form. 243/10979 useless extension candidates. Maximal degree in co-relation 48400. Up to 7221 conditions per place. [2023-08-24 11:45:12,359 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 81 selfloop transitions, 37 changer transitions 1/133 dead transitions. [2023-08-24 11:45:12,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 133 transitions, 1483 flow [2023-08-24 11:45:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:45:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:45:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2023-08-24 11:45:12,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49872340425531914 [2023-08-24 11:45:12,362 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 586 transitions. [2023-08-24 11:45:12,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 586 transitions. [2023-08-24 11:45:12,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:12,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 586 transitions. [2023-08-24 11:45:12,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:12,370 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 11:45:12,371 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 11:45:12,371 INFO L175 Difference]: Start difference. First operand has 67 places, 91 transitions, 963 flow. Second operand 5 states and 586 transitions. [2023-08-24 11:45:12,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 133 transitions, 1483 flow [2023-08-24 11:45:12,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 133 transitions, 1431 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-24 11:45:12,492 INFO L231 Difference]: Finished difference. Result has 70 places, 101 transitions, 1128 flow [2023-08-24 11:45:12,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1128, PETRI_PLACES=70, PETRI_TRANSITIONS=101} [2023-08-24 11:45:12,492 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-08-24 11:45:12,493 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 101 transitions, 1128 flow [2023-08-24 11:45:12,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:12,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:12,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:12,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:45:12,494 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 11:45:12,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1142468247, now seen corresponding path program 1 times [2023-08-24 11:45:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:12,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062843494] [2023-08-24 11:45:12,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:12,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:12,826 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 11:45:12,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:12,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062843494] [2023-08-24 11:45:12,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062843494] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:12,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:12,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:45:12,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490051727] [2023-08-24 11:45:12,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:12,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:45:12,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:12,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:45:12,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:45:12,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-24 11:45:12,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 101 transitions, 1128 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:12,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:12,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-24 11:45:12,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:13,853 INFO L124 PetriNetUnfolderBase]: 7849/11583 cut-off events. [2023-08-24 11:45:13,854 INFO L125 PetriNetUnfolderBase]: For 64790/65350 co-relation queries the response was YES. [2023-08-24 11:45:13,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52669 conditions, 11583 events. 7849/11583 cut-off events. For 64790/65350 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 69684 event pairs, 1463 based on Foata normal form. 347/11682 useless extension candidates. Maximal degree in co-relation 52636. Up to 6558 conditions per place. [2023-08-24 11:45:13,918 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 77 selfloop transitions, 49 changer transitions 1/141 dead transitions. [2023-08-24 11:45:13,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 141 transitions, 1657 flow [2023-08-24 11:45:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:45:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:45:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2023-08-24 11:45:13,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48723404255319147 [2023-08-24 11:45:13,920 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 687 transitions. [2023-08-24 11:45:13,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 687 transitions. [2023-08-24 11:45:13,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:13,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 687 transitions. [2023-08-24 11:45:13,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:13,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:13,925 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:13,925 INFO L175 Difference]: Start difference. First operand has 70 places, 101 transitions, 1128 flow. Second operand 6 states and 687 transitions. [2023-08-24 11:45:13,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 141 transitions, 1657 flow [2023-08-24 11:45:14,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 141 transitions, 1587 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-24 11:45:14,063 INFO L231 Difference]: Finished difference. Result has 73 places, 106 transitions, 1264 flow [2023-08-24 11:45:14,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1264, PETRI_PLACES=73, PETRI_TRANSITIONS=106} [2023-08-24 11:45:14,064 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2023-08-24 11:45:14,064 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 106 transitions, 1264 flow [2023-08-24 11:45:14,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:14,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:14,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:14,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 11:45:14,065 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 11:45:14,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:14,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1506342812, now seen corresponding path program 1 times [2023-08-24 11:45:14,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:14,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655736825] [2023-08-24 11:45:14,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:14,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:14,201 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 11:45:14,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655736825] [2023-08-24 11:45:14,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655736825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:14,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:14,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:14,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894431954] [2023-08-24 11:45:14,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:14,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:45:14,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:14,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:45:14,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:45:14,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-24 11:45:14,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 106 transitions, 1264 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:14,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:14,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-24 11:45:14,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:15,042 INFO L124 PetriNetUnfolderBase]: 6160/9293 cut-off events. [2023-08-24 11:45:15,042 INFO L125 PetriNetUnfolderBase]: For 83121/84607 co-relation queries the response was YES. [2023-08-24 11:45:15,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45387 conditions, 9293 events. 6160/9293 cut-off events. For 83121/84607 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 59917 event pairs, 685 based on Foata normal form. 1713/10586 useless extension candidates. Maximal degree in co-relation 45353. Up to 4119 conditions per place. [2023-08-24 11:45:15,090 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 163 selfloop transitions, 6 changer transitions 8/194 dead transitions. [2023-08-24 11:45:15,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 194 transitions, 2658 flow [2023-08-24 11:45:15,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2023-08-24 11:45:15,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-24 11:45:15,092 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 470 transitions. [2023-08-24 11:45:15,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 470 transitions. [2023-08-24 11:45:15,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:15,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 470 transitions. [2023-08-24 11:45:15,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:15,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:15,095 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:15,095 INFO L175 Difference]: Start difference. First operand has 73 places, 106 transitions, 1264 flow. Second operand 4 states and 470 transitions. [2023-08-24 11:45:15,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 194 transitions, 2658 flow [2023-08-24 11:45:15,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 194 transitions, 2540 flow, removed 26 selfloop flow, removed 3 redundant places. [2023-08-24 11:45:15,202 INFO L231 Difference]: Finished difference. Result has 75 places, 104 transitions, 1198 flow [2023-08-24 11:45:15,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1198, PETRI_PLACES=75, PETRI_TRANSITIONS=104} [2023-08-24 11:45:15,203 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2023-08-24 11:45:15,203 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 104 transitions, 1198 flow [2023-08-24 11:45:15,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:15,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:15,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:15,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 11:45:15,204 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 11:45:15,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash 420506672, now seen corresponding path program 1 times [2023-08-24 11:45:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:15,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401747226] [2023-08-24 11:45:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:15,346 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 11:45:15,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:15,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401747226] [2023-08-24 11:45:15,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401747226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:15,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:15,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:45:15,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447619737] [2023-08-24 11:45:15,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:15,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:45:15,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:15,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:45:15,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:45:15,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-24 11:45:15,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 104 transitions, 1198 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:15,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:15,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-24 11:45:15,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:16,074 INFO L124 PetriNetUnfolderBase]: 4961/7677 cut-off events. [2023-08-24 11:45:16,075 INFO L125 PetriNetUnfolderBase]: For 62899/64569 co-relation queries the response was YES. [2023-08-24 11:45:16,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39604 conditions, 7677 events. 4961/7677 cut-off events. For 62899/64569 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 49961 event pairs, 501 based on Foata normal form. 1487/8801 useless extension candidates. Maximal degree in co-relation 39568. Up to 3142 conditions per place. [2023-08-24 11:45:16,112 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 180 selfloop transitions, 10 changer transitions 24/231 dead transitions. [2023-08-24 11:45:16,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 231 transitions, 3057 flow [2023-08-24 11:45:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:45:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:45:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-08-24 11:45:16,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502127659574468 [2023-08-24 11:45:16,114 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-08-24 11:45:16,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-08-24 11:45:16,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:16,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-08-24 11:45:16,116 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 11:45:16,118 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 11:45:16,118 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 11:45:16,118 INFO L175 Difference]: Start difference. First operand has 75 places, 104 transitions, 1198 flow. Second operand 5 states and 590 transitions. [2023-08-24 11:45:16,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 231 transitions, 3057 flow [2023-08-24 11:45:16,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 231 transitions, 3054 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:45:16,180 INFO L231 Difference]: Finished difference. Result has 80 places, 100 transitions, 1158 flow [2023-08-24 11:45:16,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1158, PETRI_PLACES=80, PETRI_TRANSITIONS=100} [2023-08-24 11:45:16,181 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 40 predicate places. [2023-08-24 11:45:16,181 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 100 transitions, 1158 flow [2023-08-24 11:45:16,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:16,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:16,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:16,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 11:45:16,182 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 11:45:16,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:16,182 INFO L85 PathProgramCache]: Analyzing trace with hash 972097988, now seen corresponding path program 1 times [2023-08-24 11:45:16,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:16,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960910843] [2023-08-24 11:45:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:16,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:16,299 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 11:45:16,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:16,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960910843] [2023-08-24 11:45:16,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960910843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:16,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:16,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:45:16,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912800625] [2023-08-24 11:45:16,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:16,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:45:16,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:16,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:45:16,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:45:16,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 235 [2023-08-24 11:45:16,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 100 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:16,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:16,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 235 [2023-08-24 11:45:16,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:17,332 INFO L124 PetriNetUnfolderBase]: 6576/10551 cut-off events. [2023-08-24 11:45:17,332 INFO L125 PetriNetUnfolderBase]: For 76398/77498 co-relation queries the response was YES. [2023-08-24 11:45:17,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58683 conditions, 10551 events. 6576/10551 cut-off events. For 76398/77498 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 73855 event pairs, 1945 based on Foata normal form. 744/10872 useless extension candidates. Maximal degree in co-relation 58644. Up to 5078 conditions per place. [2023-08-24 11:45:17,371 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 104 selfloop transitions, 9 changer transitions 23/145 dead transitions. [2023-08-24 11:45:17,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 145 transitions, 1873 flow [2023-08-24 11:45:17,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:45:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:45:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-24 11:45:17,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2023-08-24 11:45:17,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-24 11:45:17,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-24 11:45:17,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:17,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-24 11:45:17,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:17,375 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 11:45:17,375 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 11:45:17,375 INFO L175 Difference]: Start difference. First operand has 80 places, 100 transitions, 1158 flow. Second operand 3 states and 370 transitions. [2023-08-24 11:45:17,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 145 transitions, 1873 flow [2023-08-24 11:45:17,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 145 transitions, 1845 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-24 11:45:17,500 INFO L231 Difference]: Finished difference. Result has 81 places, 90 transitions, 1023 flow [2023-08-24 11:45:17,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1023, PETRI_PLACES=81, PETRI_TRANSITIONS=90} [2023-08-24 11:45:17,500 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 41 predicate places. [2023-08-24 11:45:17,501 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 90 transitions, 1023 flow [2023-08-24 11:45:17,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:17,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:17,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:17,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 11:45:17,501 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 11:45:17,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:17,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1575703774, now seen corresponding path program 1 times [2023-08-24 11:45:17,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:17,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976544459] [2023-08-24 11:45:17,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:17,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:17,647 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 11:45:17,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:17,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976544459] [2023-08-24 11:45:17,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976544459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:17,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:17,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:45:17,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944614534] [2023-08-24 11:45:17,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:17,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:45:17,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:17,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:45:17,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:45:17,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-24 11:45:17,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 90 transitions, 1023 flow. Second operand has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:17,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:17,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-24 11:45:17,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:18,653 INFO L124 PetriNetUnfolderBase]: 5411/8612 cut-off events. [2023-08-24 11:45:18,653 INFO L125 PetriNetUnfolderBase]: For 65944/67903 co-relation queries the response was YES. [2023-08-24 11:45:18,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45887 conditions, 8612 events. 5411/8612 cut-off events. For 65944/67903 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 61014 event pairs, 520 based on Foata normal form. 1387/9581 useless extension candidates. Maximal degree in co-relation 45848. Up to 3202 conditions per place. [2023-08-24 11:45:18,688 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 139 selfloop transitions, 14 changer transitions 25/191 dead transitions. [2023-08-24 11:45:18,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 191 transitions, 2429 flow [2023-08-24 11:45:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:45:18,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:45:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 708 transitions. [2023-08-24 11:45:18,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502127659574468 [2023-08-24 11:45:18,690 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 708 transitions. [2023-08-24 11:45:18,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 708 transitions. [2023-08-24 11:45:18,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:18,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 708 transitions. [2023-08-24 11:45:18,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:18,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:18,695 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:18,695 INFO L175 Difference]: Start difference. First operand has 81 places, 90 transitions, 1023 flow. Second operand 6 states and 708 transitions. [2023-08-24 11:45:18,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 191 transitions, 2429 flow [2023-08-24 11:45:18,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 191 transitions, 2346 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-24 11:45:18,755 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 893 flow [2023-08-24 11:45:18,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=893, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2023-08-24 11:45:18,756 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2023-08-24 11:45:18,756 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 893 flow [2023-08-24 11:45:18,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:18,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:18,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:18,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 11:45:18,757 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 11:45:18,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:18,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1106614667, now seen corresponding path program 1 times [2023-08-24 11:45:18,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:18,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547008445] [2023-08-24 11:45:18,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:18,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:18,915 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 11:45:18,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:18,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547008445] [2023-08-24 11:45:18,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547008445] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:18,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:18,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:18,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273138844] [2023-08-24 11:45:18,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:18,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:45:18,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:18,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:45:18,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:45:18,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-08-24 11:45:18,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 893 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:18,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:18,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-08-24 11:45:18,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:20,148 INFO L124 PetriNetUnfolderBase]: 8019/12982 cut-off events. [2023-08-24 11:45:20,148 INFO L125 PetriNetUnfolderBase]: For 95917/96717 co-relation queries the response was YES. [2023-08-24 11:45:20,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73745 conditions, 12982 events. 8019/12982 cut-off events. For 95917/96717 co-relation queries the response was YES. Maximal size of possible extension queue 949. Compared 96634 event pairs, 1273 based on Foata normal form. 656/13408 useless extension candidates. Maximal degree in co-relation 73705. Up to 6476 conditions per place. [2023-08-24 11:45:20,235 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 101 selfloop transitions, 2 changer transitions 53/166 dead transitions. [2023-08-24 11:45:20,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 166 transitions, 2079 flow [2023-08-24 11:45:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:20,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-08-24 11:45:20,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180851063829788 [2023-08-24 11:45:20,238 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-08-24 11:45:20,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-08-24 11:45:20,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:20,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-08-24 11:45:20,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:20,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:20,241 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:20,241 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 893 flow. Second operand 4 states and 487 transitions. [2023-08-24 11:45:20,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 166 transitions, 2079 flow [2023-08-24 11:45:20,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 166 transitions, 1997 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-24 11:45:20,582 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 789 flow [2023-08-24 11:45:20,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=789, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2023-08-24 11:45:20,582 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 45 predicate places. [2023-08-24 11:45:20,582 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 789 flow [2023-08-24 11:45:20,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:20,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:20,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:20,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 11:45:20,583 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:20,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:20,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1662989261, now seen corresponding path program 2 times [2023-08-24 11:45:20,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:20,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491719971] [2023-08-24 11:45:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:20,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:20,783 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 11:45:20,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:20,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491719971] [2023-08-24 11:45:20,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491719971] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:20,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:20,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:45:20,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235110788] [2023-08-24 11:45:20,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:20,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:45:20,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:20,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:45:20,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:45:20,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-24 11:45:20,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 789 flow. Second operand has 7 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:20,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:20,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-24 11:45:20,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:21,740 INFO L124 PetriNetUnfolderBase]: 6300/10045 cut-off events. [2023-08-24 11:45:21,741 INFO L125 PetriNetUnfolderBase]: For 73150/74720 co-relation queries the response was YES. [2023-08-24 11:45:21,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54991 conditions, 10045 events. 6300/10045 cut-off events. For 73150/74720 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 74089 event pairs, 555 based on Foata normal form. 1076/10605 useless extension candidates. Maximal degree in co-relation 54950. Up to 3685 conditions per place. [2023-08-24 11:45:21,796 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 44 selfloop transitions, 18 changer transitions 86/153 dead transitions. [2023-08-24 11:45:21,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 153 transitions, 1844 flow [2023-08-24 11:45:21,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:45:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:45:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 803 transitions. [2023-08-24 11:45:21,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48814589665653496 [2023-08-24 11:45:21,799 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 803 transitions. [2023-08-24 11:45:21,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 803 transitions. [2023-08-24 11:45:21,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:21,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 803 transitions. [2023-08-24 11:45:21,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:21,803 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 11:45:21,803 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 11:45:21,803 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 789 flow. Second operand 7 states and 803 transitions. [2023-08-24 11:45:21,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 153 transitions, 1844 flow [2023-08-24 11:45:22,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 153 transitions, 1774 flow, removed 17 selfloop flow, removed 5 redundant places. [2023-08-24 11:45:22,625 INFO L231 Difference]: Finished difference. Result has 88 places, 45 transitions, 393 flow [2023-08-24 11:45:22,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=393, PETRI_PLACES=88, PETRI_TRANSITIONS=45} [2023-08-24 11:45:22,625 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 48 predicate places. [2023-08-24 11:45:22,625 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 45 transitions, 393 flow [2023-08-24 11:45:22,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:22,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:22,626 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] [2023-08-24 11:45:22,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 11:45:22,626 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:22,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash 560999063, now seen corresponding path program 1 times [2023-08-24 11:45:22,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:22,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220428843] [2023-08-24 11:45:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:22,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:45:22,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:45:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:45:22,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:45:22,740 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:45:22,741 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 11:45:22,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 11:45:22,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 11:45:22,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 11:45:22,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 11:45:22,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 11:45:22,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 11:45:22,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 11:45:22,747 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:22,752 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:45:22,752 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:45:22,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:45:22 BasicIcfg [2023-08-24 11:45:22,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:45:22,834 INFO L158 Benchmark]: Toolchain (without parser) took 30233.88ms. Allocated memory was 406.8MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 381.7MB in the beginning and 1.1GB in the end (delta: -738.9MB). Peak memory consumption was 940.4MB. Max. memory is 16.0GB. [2023-08-24 11:45:22,834 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 406.8MB. Free memory was 384.3MB in the beginning and 384.2MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:45:22,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.54ms. Allocated memory is still 406.8MB. Free memory was 381.2MB in the beginning and 357.9MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 11:45:22,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.73ms. Allocated memory is still 406.8MB. Free memory was 357.9MB in the beginning and 355.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:45:22,835 INFO L158 Benchmark]: Boogie Preprocessor took 40.17ms. Allocated memory is still 406.8MB. Free memory was 355.4MB in the beginning and 353.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:45:22,835 INFO L158 Benchmark]: RCFGBuilder took 704.15ms. Allocated memory is still 406.8MB. Free memory was 353.3MB in the beginning and 316.7MB in the end (delta: 36.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-24 11:45:22,835 INFO L158 Benchmark]: TraceAbstraction took 28833.39ms. Allocated memory was 406.8MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 316.1MB in the beginning and 1.1GB in the end (delta: -804.5MB). Peak memory consumption was 875.4MB. Max. memory is 16.0GB. [2023-08-24 11:45:22,836 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.16ms. Allocated memory is still 406.8MB. Free memory was 384.3MB in the beginning and 384.2MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 577.54ms. Allocated memory is still 406.8MB. Free memory was 381.2MB in the beginning and 357.9MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.73ms. Allocated memory is still 406.8MB. Free memory was 357.9MB in the beginning and 355.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.17ms. Allocated memory is still 406.8MB. Free memory was 355.4MB in the beginning and 353.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 704.15ms. Allocated memory is still 406.8MB. Free memory was 353.3MB in the beginning and 316.7MB in the end (delta: 36.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 28833.39ms. Allocated memory was 406.8MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 316.1MB in the beginning and 1.1GB in the end (delta: -804.5MB). Peak memory consumption was 875.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 133 PlacesBefore, 40 PlacesAfterwards, 122 TransitionsBefore, 27 TransitionsAfterwards, 2736 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 109 TotalNumberOfCompositions, 6937 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3620, independent: 3421, independent conditional: 0, independent unconditional: 3421, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1487, independent: 1442, independent conditional: 0, independent unconditional: 1442, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3620, independent: 1979, independent conditional: 0, independent unconditional: 1979, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 1487, unknown conditional: 0, unknown unconditional: 1487] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1461, ((void *)0), P0, ((void *)0))=-4, t1461={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] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1462, ((void *)0), P1, ((void *)0))=-3, t1461={5:0}, t1462={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] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1463, ((void *)0), P2, ((void *)0))=-2, t1461={5:0}, t1462={6:0}, t1463={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] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1464, ((void *)0), P3, ((void *)0))=-1, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={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] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L814] 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) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 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 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 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) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 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 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 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_p3_EAX=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, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L871] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 843]: 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: 839]: 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: 837]: 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, 160 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: 28.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1342 IncrementalHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 26 mSDtfsCounter, 1342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1264occurred in iteration=10, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 1810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 11:45:22,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...