/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/mix051_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:44:27,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:44:27,933 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:27,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:44:27,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:44:27,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:44:27,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:44:27,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:44:27,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:44:27,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:44:27,980 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:44:27,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:44:27,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:44:27,981 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:44:27,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:44:27,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:44:27,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:44:27,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:44:27,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:44:27,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:44:27,983 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:44:27,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:44:27,984 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:44:27,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:44:27,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:44:27,985 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:44:27,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:44:27,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:44:27,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:44:27,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:44:27,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:44:27,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:44:27,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:44:27,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:44:27,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:44:27,988 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:28,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:44:28,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:44:28,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:44:28,368 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:44:28,369 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:44:28,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2023-08-24 11:44:29,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:44:29,869 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:44:29,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2023-08-24 11:44:29,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a26eb545/c706bfdf73ff48d58b627f84816d30b3/FLAG13dff9f0e [2023-08-24 11:44:29,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a26eb545/c706bfdf73ff48d58b627f84816d30b3 [2023-08-24 11:44:29,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:44:29,903 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:44:29,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:44:29,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:44:29,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:44:29,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:44:29" (1/1) ... [2023-08-24 11:44:29,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6e12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:29, skipping insertion in model container [2023-08-24 11:44:29,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:44:29" (1/1) ... [2023-08-24 11:44:29,967 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:44:30,090 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/mix051_tso.oepc.i[949,962] [2023-08-24 11:44:30,289 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:44:30,304 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:44:30,316 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/mix051_tso.oepc.i[949,962] [2023-08-24 11:44:30,333 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:44:30,334 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:44:30,390 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:44:30,425 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:44:30,425 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:44:30,432 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:44:30,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:30 WrapperNode [2023-08-24 11:44:30,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:44:30,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:44:30,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:44:30,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:44:30,440 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:30" (1/1) ... [2023-08-24 11:44:30,481 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:30" (1/1) ... [2023-08-24 11:44:30,513 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-08-24 11:44:30,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:44:30,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:44:30,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:44:30,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:44:30,523 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:30" (1/1) ... [2023-08-24 11:44:30,523 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:30" (1/1) ... [2023-08-24 11:44:30,534 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:30" (1/1) ... [2023-08-24 11:44:30,535 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:30" (1/1) ... [2023-08-24 11:44:30,542 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:30" (1/1) ... [2023-08-24 11:44:30,544 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:30" (1/1) ... [2023-08-24 11:44:30,558 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:30" (1/1) ... [2023-08-24 11:44:30,560 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:30" (1/1) ... [2023-08-24 11:44:30,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:44:30,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:44:30,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:44:30,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:44:30,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:30" (1/1) ... [2023-08-24 11:44:30,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:44:30,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:44:30,602 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:30,633 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:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:44:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 11:44:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:44:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:44:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:44:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 11:44:30,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 11:44:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 11:44:30,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 11:44:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 11:44:30,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 11:44:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 11:44:30,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 11:44:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:44:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 11:44:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:44:30,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:44:30,654 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:30,817 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:44:30,819 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:44:31,158 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:44:31,305 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:44:31,305 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 11:44:31,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:44:31 BoogieIcfgContainer [2023-08-24 11:44:31,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:44:31,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:44:31,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:44:31,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:44:31,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:44:29" (1/3) ... [2023-08-24 11:44:31,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10bb50bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:44:31, skipping insertion in model container [2023-08-24 11:44:31,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:30" (2/3) ... [2023-08-24 11:44:31,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10bb50bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:44:31, skipping insertion in model container [2023-08-24 11:44:31,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:44:31" (3/3) ... [2023-08-24 11:44:31,315 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2023-08-24 11:44:31,331 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:44:31,331 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 11:44:31,332 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:44:31,388 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:44:31,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-08-24 11:44:31,475 INFO L124 PetriNetUnfolderBase]: 2/125 cut-off events. [2023-08-24 11:44:31,475 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:44:31,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-24 11:44:31,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-08-24 11:44:31,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-08-24 11:44:31,488 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:44:31,496 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-08-24 11:44:31,498 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-08-24 11:44:31,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-08-24 11:44:31,553 INFO L124 PetriNetUnfolderBase]: 2/125 cut-off events. [2023-08-24 11:44:31,554 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:44:31,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-24 11:44:31,557 INFO L119 LiptonReduction]: Number of co-enabled transitions 3044 [2023-08-24 11:44:35,510 INFO L134 LiptonReduction]: Checked pairs total: 7779 [2023-08-24 11:44:35,510 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-24 11:44:35,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:44:35,529 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;@5cd34c0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:44:35,529 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 11:44:35,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:44:35,534 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-24 11:44:35,534 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:44:35,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:35,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-24 11:44:35,535 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:35,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash 518892560, now seen corresponding path program 1 times [2023-08-24 11:44:35,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:35,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111292182] [2023-08-24 11:44:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:35,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:35,975 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:35,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:35,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111292182] [2023-08-24 11:44:35,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111292182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:35,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:35,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:44:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393567410] [2023-08-24 11:44:35,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:35,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:44:35,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:36,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:44:36,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:44:36,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 233 [2023-08-24 11:44:36,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have 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:36,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:36,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 233 [2023-08-24 11:44:36,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:37,088 INFO L124 PetriNetUnfolderBase]: 5463/7582 cut-off events. [2023-08-24 11:44:37,088 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-08-24 11:44:37,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15182 conditions, 7582 events. 5463/7582 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 38512 event pairs, 2045 based on Foata normal form. 256/7297 useless extension candidates. Maximal degree in co-relation 15170. Up to 5923 conditions per place. [2023-08-24 11:44:37,131 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 39 selfloop transitions, 2 changer transitions 4/49 dead transitions. [2023-08-24 11:44:37,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 206 flow [2023-08-24 11:44:37,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:44:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:44:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-08-24 11:44:37,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5536480686695279 [2023-08-24 11:44:37,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-08-24 11:44:37,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-08-24 11:44:37,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:37,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-08-24 11:44:37,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have 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:37,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have 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:37,156 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have 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:37,157 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 387 transitions. [2023-08-24 11:44:37,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 206 flow [2023-08-24 11:44:37,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 11:44:37,162 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-24 11:44:37,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-24 11:44:37,166 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-24 11:44:37,166 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-24 11:44:37,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have 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:37,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:37,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:37,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:44:37,167 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:37,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1056021053, now seen corresponding path program 1 times [2023-08-24 11:44:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:37,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789328713] [2023-08-24 11:44:37,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:37,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:37,865 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:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:37,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789328713] [2023-08-24 11:44:37,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789328713] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:37,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:37,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:44:37,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76366061] [2023-08-24 11:44:37,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:37,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:44:37,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:37,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:44:37,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:44:37,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-08-24 11:44:37,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have 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:37,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:37,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-08-24 11:44:37,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:38,763 INFO L124 PetriNetUnfolderBase]: 5207/7373 cut-off events. [2023-08-24 11:44:38,763 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2023-08-24 11:44:38,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15137 conditions, 7373 events. 5207/7373 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 38187 event pairs, 1931 based on Foata normal form. 320/7673 useless extension candidates. Maximal degree in co-relation 15127. Up to 5271 conditions per place. [2023-08-24 11:44:38,818 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 39 selfloop transitions, 2 changer transitions 24/68 dead transitions. [2023-08-24 11:44:38,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 68 transitions, 284 flow [2023-08-24 11:44:38,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:44:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:44:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2023-08-24 11:44:38,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503862660944206 [2023-08-24 11:44:38,822 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 587 transitions. [2023-08-24 11:44:38,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 587 transitions. [2023-08-24 11:44:38,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:38,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 587 transitions. [2023-08-24 11:44:38,824 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:44:38,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have 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:38,827 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have 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:38,827 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 587 transitions. [2023-08-24 11:44:38,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 68 transitions, 284 flow [2023-08-24 11:44:38,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 68 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:44:38,829 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 76 flow [2023-08-24 11:44:38,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-24 11:44:38,830 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2023-08-24 11:44:38,831 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 76 flow [2023-08-24 11:44:38,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have 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:38,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:38,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:38,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:44:38,832 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:38,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1623145420, now seen corresponding path program 1 times [2023-08-24 11:44:38,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:38,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985709545] [2023-08-24 11:44:38,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:39,307 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:39,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:39,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985709545] [2023-08-24 11:44:39,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985709545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:39,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:39,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:44:39,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673001469] [2023-08-24 11:44:39,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:39,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:44:39,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:39,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:44:39,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:44:39,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-08-24 11:44:39,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have 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:39,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:39,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-08-24 11:44:39,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:40,389 INFO L124 PetriNetUnfolderBase]: 5727/8213 cut-off events. [2023-08-24 11:44:40,389 INFO L125 PetriNetUnfolderBase]: For 1508/1508 co-relation queries the response was YES. [2023-08-24 11:44:40,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17706 conditions, 8213 events. 5727/8213 cut-off events. For 1508/1508 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 45725 event pairs, 779 based on Foata normal form. 308/8501 useless extension candidates. Maximal degree in co-relation 17693. Up to 5105 conditions per place. [2023-08-24 11:44:40,440 INFO L140 encePairwiseOnDemand]: 225/233 looper letters, 52 selfloop transitions, 6 changer transitions 24/85 dead transitions. [2023-08-24 11:44:40,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 85 transitions, 364 flow [2023-08-24 11:44:40,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:44:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:44:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 708 transitions. [2023-08-24 11:44:40,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064377682403434 [2023-08-24 11:44:40,443 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 708 transitions. [2023-08-24 11:44:40,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 708 transitions. [2023-08-24 11:44:40,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:40,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 708 transitions. [2023-08-24 11:44:40,446 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:44:40,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have 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:40,449 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have 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:40,449 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 76 flow. Second operand 6 states and 708 transitions. [2023-08-24 11:44:40,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 85 transitions, 364 flow [2023-08-24 11:44:40,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 85 transitions, 356 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-24 11:44:40,512 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 115 flow [2023-08-24 11:44:40,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-08-24 11:44:40,514 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-08-24 11:44:40,516 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 115 flow [2023-08-24 11:44:40,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have 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:40,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:40,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:40,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:44:40,517 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:40,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:40,518 INFO L85 PathProgramCache]: Analyzing trace with hash -772698027, now seen corresponding path program 1 times [2023-08-24 11:44:40,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:40,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635254328] [2023-08-24 11:44:40,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:40,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:40,748 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:40,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635254328] [2023-08-24 11:44:40,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635254328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:40,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:40,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:44:40,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632922102] [2023-08-24 11:44:40,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:40,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:44:40,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:40,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:44:40,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:44:40,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 233 [2023-08-24 11:44:40,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have 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:40,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:40,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 233 [2023-08-24 11:44:40,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:41,219 INFO L124 PetriNetUnfolderBase]: 2813/4097 cut-off events. [2023-08-24 11:44:41,219 INFO L125 PetriNetUnfolderBase]: For 3262/3262 co-relation queries the response was YES. [2023-08-24 11:44:41,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11561 conditions, 4097 events. 2813/4097 cut-off events. For 3262/3262 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 20685 event pairs, 613 based on Foata normal form. 100/4180 useless extension candidates. Maximal degree in co-relation 11547. Up to 3510 conditions per place. [2023-08-24 11:44:41,248 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 45 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2023-08-24 11:44:41,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 297 flow [2023-08-24 11:44:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:44:41,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:44:41,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-24 11:44:41,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525035765379113 [2023-08-24 11:44:41,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-24 11:44:41,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-24 11:44:41,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:41,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-24 11:44:41,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have 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:41,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have 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:41,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have 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:41,254 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 115 flow. Second operand 3 states and 367 transitions. [2023-08-24 11:44:41,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 297 flow [2023-08-24 11:44:41,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 283 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-24 11:44:41,260 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 139 flow [2023-08-24 11:44:41,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-08-24 11:44:41,261 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2023-08-24 11:44:41,262 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 139 flow [2023-08-24 11:44:41,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have 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:41,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:41,262 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:44:41,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:44:41,262 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:41,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:41,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1353820629, now seen corresponding path program 1 times [2023-08-24 11:44:41,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:41,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13614756] [2023-08-24 11:44:41,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:41,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:41,470 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:41,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:41,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13614756] [2023-08-24 11:44:41,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13614756] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:41,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:41,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:44:41,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139010732] [2023-08-24 11:44:41,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:41,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:44:41,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:41,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:44:41,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:44:41,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 233 [2023-08-24 11:44:41,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have 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:41,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:41,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 233 [2023-08-24 11:44:41,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:41,836 INFO L124 PetriNetUnfolderBase]: 1517/2369 cut-off events. [2023-08-24 11:44:41,836 INFO L125 PetriNetUnfolderBase]: For 1849/1849 co-relation queries the response was YES. [2023-08-24 11:44:41,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7338 conditions, 2369 events. 1517/2369 cut-off events. For 1849/1849 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11872 event pairs, 329 based on Foata normal form. 135/2487 useless extension candidates. Maximal degree in co-relation 7324. Up to 1102 conditions per place. [2023-08-24 11:44:41,849 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 61 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2023-08-24 11:44:41,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 74 transitions, 427 flow [2023-08-24 11:44:41,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:44:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:44:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-08-24 11:44:41,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526824034334764 [2023-08-24 11:44:41,851 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-08-24 11:44:41,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-08-24 11:44:41,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:41,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-08-24 11:44:41,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:44:41,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have 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:41,855 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have 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:41,855 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 139 flow. Second operand 4 states and 491 transitions. [2023-08-24 11:44:41,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 74 transitions, 427 flow [2023-08-24 11:44:41,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 74 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:44:41,858 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 186 flow [2023-08-24 11:44:41,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-24 11:44:41,860 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-08-24 11:44:41,860 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 186 flow [2023-08-24 11:44:41,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have 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:41,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:41,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:41,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:44:41,861 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:41,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:41,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1618159530, now seen corresponding path program 1 times [2023-08-24 11:44:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:41,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841657924] [2023-08-24 11:44:41,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:42,110 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:42,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:42,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841657924] [2023-08-24 11:44:42,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841657924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:42,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:42,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:44:42,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495412184] [2023-08-24 11:44:42,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:42,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:44:42,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:42,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:44:42,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:44:42,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 233 [2023-08-24 11:44:42,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have 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:42,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:42,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 233 [2023-08-24 11:44:42,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:42,395 INFO L124 PetriNetUnfolderBase]: 1085/1721 cut-off events. [2023-08-24 11:44:42,395 INFO L125 PetriNetUnfolderBase]: For 2343/2343 co-relation queries the response was YES. [2023-08-24 11:44:42,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5785 conditions, 1721 events. 1085/1721 cut-off events. For 2343/2343 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8383 event pairs, 276 based on Foata normal form. 63/1767 useless extension candidates. Maximal degree in co-relation 5769. Up to 680 conditions per place. [2023-08-24 11:44:42,407 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 72 selfloop transitions, 13 changer transitions 0/89 dead transitions. [2023-08-24 11:44:42,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 89 transitions, 557 flow [2023-08-24 11:44:42,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:44:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:44:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2023-08-24 11:44:42,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261802575107296 [2023-08-24 11:44:42,409 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 613 transitions. [2023-08-24 11:44:42,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 613 transitions. [2023-08-24 11:44:42,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:42,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 613 transitions. [2023-08-24 11:44:42,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have 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:42,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have 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:42,413 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have 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:42,413 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 186 flow. Second operand 5 states and 613 transitions. [2023-08-24 11:44:42,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 89 transitions, 557 flow [2023-08-24 11:44:42,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 539 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 11:44:42,418 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 236 flow [2023-08-24 11:44:42,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-24 11:44:42,419 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-08-24 11:44:42,419 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 236 flow [2023-08-24 11:44:42,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have 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:42,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:42,420 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] [2023-08-24 11:44:42,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:44:42,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:42,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:42,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1459317569, now seen corresponding path program 1 times [2023-08-24 11:44:42,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:42,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312104280] [2023-08-24 11:44:42,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:42,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:42,681 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:42,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:42,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312104280] [2023-08-24 11:44:42,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312104280] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:42,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:42,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:44:42,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725651159] [2023-08-24 11:44:42,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:42,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:44:42,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:42,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:44:42,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:44:42,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 233 [2023-08-24 11:44:42,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have 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:42,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:42,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 233 [2023-08-24 11:44:42,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:42,956 INFO L124 PetriNetUnfolderBase]: 1037/1625 cut-off events. [2023-08-24 11:44:42,956 INFO L125 PetriNetUnfolderBase]: For 2472/2472 co-relation queries the response was YES. [2023-08-24 11:44:42,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5607 conditions, 1625 events. 1037/1625 cut-off events. For 2472/2472 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7939 event pairs, 272 based on Foata normal form. 13/1621 useless extension candidates. Maximal degree in co-relation 5590. Up to 680 conditions per place. [2023-08-24 11:44:42,966 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 68 selfloop transitions, 17 changer transitions 0/89 dead transitions. [2023-08-24 11:44:42,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 583 flow [2023-08-24 11:44:42,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:44:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:44:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 721 transitions. [2023-08-24 11:44:42,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157367668097281 [2023-08-24 11:44:42,969 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 721 transitions. [2023-08-24 11:44:42,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 721 transitions. [2023-08-24 11:44:42,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:42,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 721 transitions. [2023-08-24 11:44:42,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have 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:42,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have 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:42,973 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have 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:42,975 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 236 flow. Second operand 6 states and 721 transitions. [2023-08-24 11:44:42,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 583 flow [2023-08-24 11:44:42,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 89 transitions, 538 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-24 11:44:42,989 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 238 flow [2023-08-24 11:44:42,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-08-24 11:44:42,990 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2023-08-24 11:44:42,990 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 238 flow [2023-08-24 11:44:42,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have 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:42,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:42,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:42,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:44:42,991 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:42,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2112776354, now seen corresponding path program 1 times [2023-08-24 11:44:42,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:42,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444577974] [2023-08-24 11:44:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:42,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:43,453 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:43,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:43,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444577974] [2023-08-24 11:44:43,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444577974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:43,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:43,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:44:43,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848278963] [2023-08-24 11:44:43,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:43,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:44:43,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:43,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:44:43,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:44:43,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 233 [2023-08-24 11:44:43,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have 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:43,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:43,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 233 [2023-08-24 11:44:43,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:44,139 INFO L124 PetriNetUnfolderBase]: 3501/5120 cut-off events. [2023-08-24 11:44:44,139 INFO L125 PetriNetUnfolderBase]: For 7164/7164 co-relation queries the response was YES. [2023-08-24 11:44:44,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16709 conditions, 5120 events. 3501/5120 cut-off events. For 7164/7164 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 25164 event pairs, 488 based on Foata normal form. 1/5121 useless extension candidates. Maximal degree in co-relation 16692. Up to 3146 conditions per place. [2023-08-24 11:44:44,160 INFO L140 encePairwiseOnDemand]: 225/233 looper letters, 67 selfloop transitions, 5 changer transitions 54/126 dead transitions. [2023-08-24 11:44:44,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 126 transitions, 887 flow [2023-08-24 11:44:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:44:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:44:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 744 transitions. [2023-08-24 11:44:44,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45616186388718577 [2023-08-24 11:44:44,162 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 744 transitions. [2023-08-24 11:44:44,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 744 transitions. [2023-08-24 11:44:44,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:44,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 744 transitions. [2023-08-24 11:44:44,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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:44,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have 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:44,167 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have 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:44,167 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 238 flow. Second operand 7 states and 744 transitions. [2023-08-24 11:44:44,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 126 transitions, 887 flow [2023-08-24 11:44:44,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 126 transitions, 750 flow, removed 36 selfloop flow, removed 5 redundant places. [2023-08-24 11:44:44,215 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 223 flow [2023-08-24 11:44:44,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-08-24 11:44:44,216 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2023-08-24 11:44:44,216 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 223 flow [2023-08-24 11:44:44,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have 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:44,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:44,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:44,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:44:44,217 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:44,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:44,218 INFO L85 PathProgramCache]: Analyzing trace with hash 48907476, now seen corresponding path program 2 times [2023-08-24 11:44:44,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:44,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146533774] [2023-08-24 11:44:44,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:44,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:44,600 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:44,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:44,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146533774] [2023-08-24 11:44:44,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146533774] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:44,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:44,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:44:44,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964720706] [2023-08-24 11:44:44,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:44,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:44:44,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:44,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:44:44,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:44:44,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 233 [2023-08-24 11:44:44,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have 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:44,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:44,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 233 [2023-08-24 11:44:44,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:45,310 INFO L124 PetriNetUnfolderBase]: 3097/4628 cut-off events. [2023-08-24 11:44:45,310 INFO L125 PetriNetUnfolderBase]: For 5765/5765 co-relation queries the response was YES. [2023-08-24 11:44:45,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14970 conditions, 4628 events. 3097/4628 cut-off events. For 5765/5765 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 23208 event pairs, 691 based on Foata normal form. 1/4629 useless extension candidates. Maximal degree in co-relation 14954. Up to 1951 conditions per place. [2023-08-24 11:44:45,336 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 57 selfloop transitions, 4 changer transitions 48/109 dead transitions. [2023-08-24 11:44:45,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 109 transitions, 739 flow [2023-08-24 11:44:45,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:44:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:44:45,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 727 transitions. [2023-08-24 11:44:45,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4457388105456775 [2023-08-24 11:44:45,340 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 727 transitions. [2023-08-24 11:44:45,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 727 transitions. [2023-08-24 11:44:45,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:45,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 727 transitions. [2023-08-24 11:44:45,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have 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:45,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have 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:45,345 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have 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:45,345 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 223 flow. Second operand 7 states and 727 transitions. [2023-08-24 11:44:45,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 109 transitions, 739 flow [2023-08-24 11:44:45,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 109 transitions, 733 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-24 11:44:45,393 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 229 flow [2023-08-24 11:44:45,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2023-08-24 11:44:45,394 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places. [2023-08-24 11:44:45,394 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 229 flow [2023-08-24 11:44:45,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have 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:45,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:45,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:45,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:44:45,395 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:45,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:45,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1709494426, now seen corresponding path program 3 times [2023-08-24 11:44:45,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:45,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334738845] [2023-08-24 11:44:45,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:45,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:44:45,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:45,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334738845] [2023-08-24 11:44:45,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334738845] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:45,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:45,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:44:45,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518169778] [2023-08-24 11:44:45,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:45,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:44:45,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:45,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:44:45,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:44:45,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 233 [2023-08-24 11:44:45,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have 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:45,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:45,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 233 [2023-08-24 11:44:45,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:46,056 INFO L124 PetriNetUnfolderBase]: 2035/3199 cut-off events. [2023-08-24 11:44:46,057 INFO L125 PetriNetUnfolderBase]: For 4743/4751 co-relation queries the response was YES. [2023-08-24 11:44:46,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10658 conditions, 3199 events. 2035/3199 cut-off events. For 4743/4751 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 17686 event pairs, 433 based on Foata normal form. 2/3173 useless extension candidates. Maximal degree in co-relation 10640. Up to 1531 conditions per place. [2023-08-24 11:44:46,071 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 44 selfloop transitions, 1 changer transitions 50/98 dead transitions. [2023-08-24 11:44:46,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 98 transitions, 678 flow [2023-08-24 11:44:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:44:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:44:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2023-08-24 11:44:46,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5004291845493563 [2023-08-24 11:44:46,074 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 583 transitions. [2023-08-24 11:44:46,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 583 transitions. [2023-08-24 11:44:46,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:46,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 583 transitions. [2023-08-24 11:44:46,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:44:46,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have 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:46,078 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have 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:46,078 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 229 flow. Second operand 5 states and 583 transitions. [2023-08-24 11:44:46,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 98 transitions, 678 flow [2023-08-24 11:44:46,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 98 transitions, 668 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-24 11:44:46,129 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 217 flow [2023-08-24 11:44:46,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2023-08-24 11:44:46,130 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2023-08-24 11:44:46,130 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 217 flow [2023-08-24 11:44:46,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have 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:46,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:46,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:46,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 11:44:46,131 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:46,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:46,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1352036114, now seen corresponding path program 4 times [2023-08-24 11:44:46,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:46,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881397817] [2023-08-24 11:44:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:46,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:47,372 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:47,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881397817] [2023-08-24 11:44:47,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881397817] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:47,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:47,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 11:44:47,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777066432] [2023-08-24 11:44:47,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:47,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 11:44:47,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:47,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 11:44:47,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-24 11:44:47,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 233 [2023-08-24 11:44:47,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 217 flow. Second operand has 9 states, 9 states have (on average 100.77777777777777) internal successors, (907), 9 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have 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:47,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:47,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 233 [2023-08-24 11:44:47,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:47,913 INFO L124 PetriNetUnfolderBase]: 1543/2493 cut-off events. [2023-08-24 11:44:47,913 INFO L125 PetriNetUnfolderBase]: For 3458/3477 co-relation queries the response was YES. [2023-08-24 11:44:47,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8470 conditions, 2493 events. 1543/2493 cut-off events. For 3458/3477 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13123 event pairs, 327 based on Foata normal form. 13/2426 useless extension candidates. Maximal degree in co-relation 8450. Up to 1402 conditions per place. [2023-08-24 11:44:47,928 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 62 selfloop transitions, 7 changer transitions 8/80 dead transitions. [2023-08-24 11:44:47,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 80 transitions, 539 flow [2023-08-24 11:44:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:44:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:44:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2023-08-24 11:44:47,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563662374821173 [2023-08-24 11:44:47,931 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 638 transitions. [2023-08-24 11:44:47,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 638 transitions. [2023-08-24 11:44:47,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:47,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 638 transitions. [2023-08-24 11:44:47,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have 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:47,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have 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:47,935 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have 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:47,935 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 217 flow. Second operand 6 states and 638 transitions. [2023-08-24 11:44:47,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 80 transitions, 539 flow [2023-08-24 11:44:47,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 526 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-24 11:44:47,965 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 253 flow [2023-08-24 11:44:47,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=253, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2023-08-24 11:44:47,966 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2023-08-24 11:44:47,966 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 253 flow [2023-08-24 11:44:47,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 100.77777777777777) internal successors, (907), 9 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have 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:47,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:47,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:47,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 11:44:47,967 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:47,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1071311290, now seen corresponding path program 5 times [2023-08-24 11:44:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:47,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838301406] [2023-08-24 11:44:47,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:47,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:44:48,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:44:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:44:48,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:44:48,154 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:44:48,155 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 11:44:48,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 11:44:48,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 11:44:48,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 11:44:48,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 11:44:48,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 11:44:48,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 11:44:48,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 11:44:48,158 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:48,163 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:44:48,163 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:44:48,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:44:48 BasicIcfg [2023-08-24 11:44:48,260 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:44:48,261 INFO L158 Benchmark]: Toolchain (without parser) took 18357.92ms. Allocated memory was 339.7MB in the beginning and 866.1MB in the end (delta: 526.4MB). Free memory was 314.4MB in the beginning and 634.6MB in the end (delta: -320.2MB). Peak memory consumption was 208.3MB. Max. memory is 16.0GB. [2023-08-24 11:44:48,261 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 339.7MB. Free memory was 317.4MB in the beginning and 317.3MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:44:48,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.07ms. Allocated memory is still 339.7MB. Free memory was 314.4MB in the beginning and 290.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 11:44:48,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.69ms. Allocated memory is still 339.7MB. Free memory was 290.3MB in the beginning and 287.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 11:44:48,261 INFO L158 Benchmark]: Boogie Preprocessor took 48.45ms. Allocated memory is still 339.7MB. Free memory was 287.3MB in the beginning and 285.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:44:48,262 INFO L158 Benchmark]: RCFGBuilder took 744.40ms. Allocated memory is still 339.7MB. Free memory was 285.2MB in the beginning and 244.5MB in the end (delta: 40.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-24 11:44:48,262 INFO L158 Benchmark]: TraceAbstraction took 16950.46ms. Allocated memory was 339.7MB in the beginning and 866.1MB in the end (delta: 526.4MB). Free memory was 243.3MB in the beginning and 634.6MB in the end (delta: -391.3MB). Peak memory consumption was 137.0MB. Max. memory is 16.0GB. [2023-08-24 11:44:48,263 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.18ms. Allocated memory is still 339.7MB. Free memory was 317.4MB in the beginning and 317.3MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 527.07ms. Allocated memory is still 339.7MB. Free memory was 314.4MB in the beginning and 290.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 80.69ms. Allocated memory is still 339.7MB. Free memory was 290.3MB in the beginning and 287.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 48.45ms. Allocated memory is still 339.7MB. Free memory was 287.3MB in the beginning and 285.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 744.40ms. Allocated memory is still 339.7MB. Free memory was 285.2MB in the beginning and 244.5MB in the end (delta: 40.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 16950.46ms. Allocated memory was 339.7MB in the beginning and 866.1MB in the end (delta: 526.4MB). Free memory was 243.3MB in the beginning and 634.6MB in the end (delta: -391.3MB). Peak memory consumption was 137.0MB. 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.0s, 136 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 32 TransitionsAfterwards, 3044 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 104 TotalNumberOfCompositions, 7779 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2904, independent: 2704, independent conditional: 0, independent unconditional: 2704, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1536, independent: 1503, independent conditional: 0, independent unconditional: 1503, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2904, independent: 1201, independent conditional: 0, independent unconditional: 1201, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 1536, unknown conditional: 0, unknown unconditional: 1536] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1377, ((void *)0), P0, ((void *)0))=-1, t1377={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1378, ((void *)0), P1, ((void *)0))=0, t1377={5:0}, t1378={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1379, ((void *)0), P2, ((void *)0))=1, t1377={5:0}, t1378={6:0}, t1379={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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(&t1380, ((void *)0), P3, ((void *)0))=2, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_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, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 855]: 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: 853]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 372 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1300 IncrementalHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 24 mSDtfsCounter, 1300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=11, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 2099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:44:48,284 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...