/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:29:04,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:29:04,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 05:29:04,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:29:04,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:29:04,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:29:04,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:29:04,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:29:04,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:29:04,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:29:04,796 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:29:04,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:29:04,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:29:04,797 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:29:04,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:29:04,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:29:04,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:29:04,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:29:04,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:29:04,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:29:04,798 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:29:04,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:29:04,799 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:29:04,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:29:04,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:29:04,799 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:29:04,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:29:04,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:29:04,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:29:04,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:29:04,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:29:04,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:29:04,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:29:04,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:29:04,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:29:04,801 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:29:05,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:29:05,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:29:05,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:29:05,067 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:29:05,067 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:29:05,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i [2023-08-24 05:29:06,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:29:06,316 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:29:06,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i [2023-08-24 05:29:06,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312c4ca7d/0ebd58097e6f4f67bab3439c48b05cc4/FLAG5ba246bf3 [2023-08-24 05:29:06,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312c4ca7d/0ebd58097e6f4f67bab3439c48b05cc4 [2023-08-24 05:29:06,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:29:06,337 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:29:06,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:29:06,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:29:06,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:29:06,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:29:06" (1/1) ... [2023-08-24 05:29:06,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a86d246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:06, skipping insertion in model container [2023-08-24 05:29:06,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:29:06" (1/1) ... [2023-08-24 05:29:06,376 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:29:06,492 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/mix036_power.opt_rmo.opt.i[958,971] [2023-08-24 05:29:06,657 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:29:06,666 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:29:06,674 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/mix036_power.opt_rmo.opt.i[958,971] [2023-08-24 05:29:06,691 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:29:06,693 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:29:06,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:29:06,748 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:29:06,748 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:29:06,752 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:29:06,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:06 WrapperNode [2023-08-24 05:29:06,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:29:06,755 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:29:06,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:29:06,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:29:06,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:06" (1/1) ... [2023-08-24 05:29:06,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:06" (1/1) ... [2023-08-24 05:29:06,795 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-08-24 05:29:06,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:29:06,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:29:06,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:29:06,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:29:06,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:06" (1/1) ... [2023-08-24 05:29:06,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:06" (1/1) ... [2023-08-24 05:29:06,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:06" (1/1) ... [2023-08-24 05:29:06,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:06" (1/1) ... [2023-08-24 05:29:06,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:06" (1/1) ... [2023-08-24 05:29:06,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:06" (1/1) ... [2023-08-24 05:29:06,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:06" (1/1) ... [2023-08-24 05:29:06,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:06" (1/1) ... [2023-08-24 05:29:06,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:29:06,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:29:06,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:29:06,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:29:06,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:06" (1/1) ... [2023-08-24 05:29:06,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:29:06,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:29:06,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 05:29:06,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 05:29:06,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:29:06,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:29:06,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:29:06,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:29:06,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:29:06,909 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:29:06,909 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:29:06,909 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:29:06,910 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:29:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:29:06,910 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:29:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 05:29:06,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 05:29:06,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:29:06,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:29:06,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:29:06,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:29:06,913 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:29:07,020 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:29:07,021 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:29:07,243 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:29:07,309 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:29:07,310 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:29:07,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:29:07 BoogieIcfgContainer [2023-08-24 05:29:07,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:29:07,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:29:07,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:29:07,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:29:07,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:29:06" (1/3) ... [2023-08-24 05:29:07,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50083d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:29:07, skipping insertion in model container [2023-08-24 05:29:07,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:06" (2/3) ... [2023-08-24 05:29:07,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50083d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:29:07, skipping insertion in model container [2023-08-24 05:29:07,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:29:07" (3/3) ... [2023-08-24 05:29:07,318 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_power.opt_rmo.opt.i [2023-08-24 05:29:07,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:29:07,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:29:07,329 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:29:07,380 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:29:07,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-08-24 05:29:07,461 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-08-24 05:29:07,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:07,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-24 05:29:07,466 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-08-24 05:29:07,469 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-08-24 05:29:07,471 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:29:07,477 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-24 05:29:07,478 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-24 05:29:07,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-08-24 05:29:07,497 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-08-24 05:29:07,497 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:07,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-24 05:29:07,500 INFO L119 LiptonReduction]: Number of co-enabled transitions 2954 [2023-08-24 05:29:11,018 INFO L134 LiptonReduction]: Checked pairs total: 7582 [2023-08-24 05:29:11,018 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-24 05:29:11,026 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:29:11,030 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;@f89cbb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:29:11,030 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 05:29:11,033 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:29:11,033 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-24 05:29:11,033 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:11,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:11,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:11,034 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:11,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:11,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1667245551, now seen corresponding path program 1 times [2023-08-24 05:29:11,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:11,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941277600] [2023-08-24 05:29:11,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:11,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:11,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941277600] [2023-08-24 05:29:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941277600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:11,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:29:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552749055] [2023-08-24 05:29:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:11,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:29:11,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:11,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:29:11,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:29:11,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 245 [2023-08-24 05:29:11,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:11,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 245 [2023-08-24 05:29:11,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:11,739 INFO L124 PetriNetUnfolderBase]: 2855/4135 cut-off events. [2023-08-24 05:29:11,740 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-08-24 05:29:11,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8211 conditions, 4135 events. 2855/4135 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 20995 event pairs, 785 based on Foata normal form. 0/3894 useless extension candidates. Maximal degree in co-relation 8199. Up to 3103 conditions per place. [2023-08-24 05:29:11,761 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-24 05:29:11,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 171 flow [2023-08-24 05:29:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:29:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:29:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-24 05:29:11,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5360544217687074 [2023-08-24 05:29:11,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-24 05:29:11,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-24 05:29:11,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:11,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-24 05:29:11,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,788 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,789 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 394 transitions. [2023-08-24 05:29:11,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 171 flow [2023-08-24 05:29:11,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 05:29:11,794 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-08-24 05:29:11,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-24 05:29:11,798 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-24 05:29:11,798 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-08-24 05:29:11,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:11,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:11,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:29:11,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:11,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:11,800 INFO L85 PathProgramCache]: Analyzing trace with hash 964707134, now seen corresponding path program 1 times [2023-08-24 05:29:11,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:11,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93065115] [2023-08-24 05:29:11,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:11,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:11,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:11,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93065115] [2023-08-24 05:29:11,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93065115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:11,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:11,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:29:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110856391] [2023-08-24 05:29:11,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:11,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:29:11,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:11,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:29:11,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:29:11,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 245 [2023-08-24 05:29:11,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:12,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 245 [2023-08-24 05:29:12,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:12,305 INFO L124 PetriNetUnfolderBase]: 2551/3705 cut-off events. [2023-08-24 05:29:12,306 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2023-08-24 05:29:12,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7619 conditions, 3705 events. 2551/3705 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18182 event pairs, 1015 based on Foata normal form. 96/3785 useless extension candidates. Maximal degree in co-relation 7609. Up to 2209 conditions per place. [2023-08-24 05:29:12,319 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 31 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-08-24 05:29:12,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 152 flow [2023-08-24 05:29:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:29:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:29:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-24 05:29:12,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197278911564626 [2023-08-24 05:29:12,321 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-24 05:29:12,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-24 05:29:12,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:12,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-24 05:29:12,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,324 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 382 transitions. [2023-08-24 05:29:12,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 152 flow [2023-08-24 05:29:12,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:29:12,325 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 68 flow [2023-08-24 05:29:12,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-24 05:29:12,326 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-24 05:29:12,326 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 68 flow [2023-08-24 05:29:12,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:12,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:12,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:29:12,327 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:12,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:12,327 INFO L85 PathProgramCache]: Analyzing trace with hash -630592877, now seen corresponding path program 1 times [2023-08-24 05:29:12,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:12,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424615113] [2023-08-24 05:29:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:12,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:12,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:12,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424615113] [2023-08-24 05:29:12,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424615113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:12,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:12,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:29:12,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967872436] [2023-08-24 05:29:12,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:12,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:12,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:12,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:12,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245 [2023-08-24 05:29:12,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:12,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245 [2023-08-24 05:29:12,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:12,728 INFO L124 PetriNetUnfolderBase]: 1989/2933 cut-off events. [2023-08-24 05:29:12,729 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-08-24 05:29:12,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6094 conditions, 2933 events. 1989/2933 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14712 event pairs, 392 based on Foata normal form. 192/3101 useless extension candidates. Maximal degree in co-relation 6083. Up to 2000 conditions per place. [2023-08-24 05:29:12,738 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 34 selfloop transitions, 5 changer transitions 23/66 dead transitions. [2023-08-24 05:29:12,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 66 transitions, 278 flow [2023-08-24 05:29:12,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:29:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:29:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-08-24 05:29:12,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053061224489795 [2023-08-24 05:29:12,740 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-08-24 05:29:12,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-08-24 05:29:12,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:12,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-08-24 05:29:12,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,744 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,744 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 68 flow. Second operand 5 states and 619 transitions. [2023-08-24 05:29:12,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 66 transitions, 278 flow [2023-08-24 05:29:12,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:29:12,746 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 109 flow [2023-08-24 05:29:12,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-24 05:29:12,746 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-24 05:29:12,746 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 109 flow [2023-08-24 05:29:12,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:12,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:12,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:29:12,747 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:12,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:12,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1093710854, now seen corresponding path program 1 times [2023-08-24 05:29:12,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:12,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622556690] [2023-08-24 05:29:12,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:12,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:12,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:12,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622556690] [2023-08-24 05:29:12,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622556690] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:12,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:12,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:29:12,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712530797] [2023-08-24 05:29:12,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:12,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:29:12,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:12,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:29:12,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:29:12,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245 [2023-08-24 05:29:12,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:12,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245 [2023-08-24 05:29:12,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:13,152 INFO L124 PetriNetUnfolderBase]: 1188/1856 cut-off events. [2023-08-24 05:29:13,153 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES. [2023-08-24 05:29:13,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5195 conditions, 1856 events. 1188/1856 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9068 event pairs, 204 based on Foata normal form. 138/1980 useless extension candidates. Maximal degree in co-relation 5181. Up to 712 conditions per place. [2023-08-24 05:29:13,160 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 45 selfloop transitions, 9 changer transitions 23/81 dead transitions. [2023-08-24 05:29:13,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 81 transitions, 425 flow [2023-08-24 05:29:13,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:29:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:29:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-08-24 05:29:13,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068027210884354 [2023-08-24 05:29:13,162 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-08-24 05:29:13,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-08-24 05:29:13,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:13,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-08-24 05:29:13,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:13,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:13,166 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:13,166 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 109 flow. Second operand 6 states and 745 transitions. [2023-08-24 05:29:13,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 81 transitions, 425 flow [2023-08-24 05:29:13,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 81 transitions, 418 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 05:29:13,175 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 174 flow [2023-08-24 05:29:13,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-24 05:29:13,176 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-24 05:29:13,176 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 174 flow [2023-08-24 05:29:13,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:13,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:13,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:13,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:29:13,178 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:13,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:13,178 INFO L85 PathProgramCache]: Analyzing trace with hash -804687682, now seen corresponding path program 1 times [2023-08-24 05:29:13,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:13,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038523156] [2023-08-24 05:29:13,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:13,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:13,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:13,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038523156] [2023-08-24 05:29:13,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038523156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:13,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:13,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:29:13,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811838866] [2023-08-24 05:29:13,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:13,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:29:13,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:13,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:29:13,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:29:13,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245 [2023-08-24 05:29:13,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:13,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:13,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245 [2023-08-24 05:29:13,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:13,550 INFO L124 PetriNetUnfolderBase]: 736/1196 cut-off events. [2023-08-24 05:29:13,550 INFO L125 PetriNetUnfolderBase]: For 1212/1212 co-relation queries the response was YES. [2023-08-24 05:29:13,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3803 conditions, 1196 events. 736/1196 cut-off events. For 1212/1212 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5410 event pairs, 167 based on Foata normal form. 57/1239 useless extension candidates. Maximal degree in co-relation 3786. Up to 411 conditions per place. [2023-08-24 05:29:13,556 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 54 selfloop transitions, 13 changer transitions 23/94 dead transitions. [2023-08-24 05:29:13,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 586 flow [2023-08-24 05:29:13,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:29:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:29:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 869 transitions. [2023-08-24 05:29:13,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067055393586006 [2023-08-24 05:29:13,558 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 869 transitions. [2023-08-24 05:29:13,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 869 transitions. [2023-08-24 05:29:13,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:13,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 869 transitions. [2023-08-24 05:29:13,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:13,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:13,562 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:13,562 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 174 flow. Second operand 7 states and 869 transitions. [2023-08-24 05:29:13,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 586 flow [2023-08-24 05:29:13,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 94 transitions, 524 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-24 05:29:13,571 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 224 flow [2023-08-24 05:29:13,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-24 05:29:13,571 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2023-08-24 05:29:13,572 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 224 flow [2023-08-24 05:29:13,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:13,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:13,572 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] [2023-08-24 05:29:13,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:29:13,572 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:13,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:13,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1644929836, now seen corresponding path program 1 times [2023-08-24 05:29:13,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:13,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878035604] [2023-08-24 05:29:13,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:13,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:13,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:13,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878035604] [2023-08-24 05:29:13,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878035604] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:13,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:13,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:29:13,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188084862] [2023-08-24 05:29:13,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:13,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:13,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:13,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:13,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:13,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-08-24 05:29:13,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:13,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:13,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-08-24 05:29:13,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:13,901 INFO L124 PetriNetUnfolderBase]: 931/1537 cut-off events. [2023-08-24 05:29:13,901 INFO L125 PetriNetUnfolderBase]: For 2243/2243 co-relation queries the response was YES. [2023-08-24 05:29:13,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4769 conditions, 1537 events. 931/1537 cut-off events. For 2243/2243 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7445 event pairs, 180 based on Foata normal form. 10/1542 useless extension candidates. Maximal degree in co-relation 4751. Up to 839 conditions per place. [2023-08-24 05:29:13,907 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 60 selfloop transitions, 2 changer transitions 21/86 dead transitions. [2023-08-24 05:29:13,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 86 transitions, 698 flow [2023-08-24 05:29:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:29:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:29:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 510 transitions. [2023-08-24 05:29:13,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204081632653061 [2023-08-24 05:29:13,909 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 510 transitions. [2023-08-24 05:29:13,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 510 transitions. [2023-08-24 05:29:13,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:13,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 510 transitions. [2023-08-24 05:29:13,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:13,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:13,911 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:13,911 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 224 flow. Second operand 4 states and 510 transitions. [2023-08-24 05:29:13,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 86 transitions, 698 flow [2023-08-24 05:29:13,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 86 transitions, 558 flow, removed 47 selfloop flow, removed 5 redundant places. [2023-08-24 05:29:13,919 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 183 flow [2023-08-24 05:29:13,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-08-24 05:29:13,920 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-08-24 05:29:13,920 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 183 flow [2023-08-24 05:29:13,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:13,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:13,921 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] [2023-08-24 05:29:13,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:29:13,921 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:13,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:13,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1606579362, now seen corresponding path program 2 times [2023-08-24 05:29:13,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:13,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898766544] [2023-08-24 05:29:13,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:13,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:14,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:14,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898766544] [2023-08-24 05:29:14,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898766544] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:14,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:14,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:29:14,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597210776] [2023-08-24 05:29:14,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:14,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:14,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:14,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:14,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:14,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 245 [2023-08-24 05:29:14,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:14,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:14,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 245 [2023-08-24 05:29:14,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:14,391 INFO L124 PetriNetUnfolderBase]: 2494/3818 cut-off events. [2023-08-24 05:29:14,391 INFO L125 PetriNetUnfolderBase]: For 3001/3001 co-relation queries the response was YES. [2023-08-24 05:29:14,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10997 conditions, 3818 events. 2494/3818 cut-off events. For 3001/3001 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 18954 event pairs, 321 based on Foata normal form. 11/3829 useless extension candidates. Maximal degree in co-relation 10980. Up to 2287 conditions per place. [2023-08-24 05:29:14,407 INFO L140 encePairwiseOnDemand]: 237/245 looper letters, 95 selfloop transitions, 10 changer transitions 5/110 dead transitions. [2023-08-24 05:29:14,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 110 transitions, 703 flow [2023-08-24 05:29:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:29:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:29:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2023-08-24 05:29:14,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012244897959184 [2023-08-24 05:29:14,409 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2023-08-24 05:29:14,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2023-08-24 05:29:14,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:14,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2023-08-24 05:29:14,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:14,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:14,411 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:14,411 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 183 flow. Second operand 5 states and 614 transitions. [2023-08-24 05:29:14,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 110 transitions, 703 flow [2023-08-24 05:29:14,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 110 transitions, 699 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:29:14,431 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 253 flow [2023-08-24 05:29:14,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-08-24 05:29:14,432 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2023-08-24 05:29:14,432 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 253 flow [2023-08-24 05:29:14,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:14,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:14,432 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] [2023-08-24 05:29:14,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:29:14,432 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:14,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:14,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1347163394, now seen corresponding path program 3 times [2023-08-24 05:29:14,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:14,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744533331] [2023-08-24 05:29:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:14,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:14,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:14,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744533331] [2023-08-24 05:29:14,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744533331] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:14,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:14,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:29:14,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824037008] [2023-08-24 05:29:14,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:14,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:29:14,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:14,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:29:14,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:29:14,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245 [2023-08-24 05:29:14,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 253 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:14,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:14,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245 [2023-08-24 05:29:14,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:14,859 INFO L124 PetriNetUnfolderBase]: 1711/2730 cut-off events. [2023-08-24 05:29:14,859 INFO L125 PetriNetUnfolderBase]: For 3131/3254 co-relation queries the response was YES. [2023-08-24 05:29:14,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8742 conditions, 2730 events. 1711/2730 cut-off events. For 3131/3254 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 14890 event pairs, 276 based on Foata normal form. 113/2730 useless extension candidates. Maximal degree in co-relation 8721. Up to 1015 conditions per place. [2023-08-24 05:29:14,868 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 45 selfloop transitions, 18 changer transitions 24/96 dead transitions. [2023-08-24 05:29:14,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 96 transitions, 615 flow [2023-08-24 05:29:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:29:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:29:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 969 transitions. [2023-08-24 05:29:14,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943877551020408 [2023-08-24 05:29:14,870 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 969 transitions. [2023-08-24 05:29:14,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 969 transitions. [2023-08-24 05:29:14,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:14,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 969 transitions. [2023-08-24 05:29:14,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.125) internal successors, (969), 8 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:14,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:14,874 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:14,874 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 253 flow. Second operand 8 states and 969 transitions. [2023-08-24 05:29:14,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 96 transitions, 615 flow [2023-08-24 05:29:14,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 96 transitions, 593 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-24 05:29:14,903 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 286 flow [2023-08-24 05:29:14,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=286, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2023-08-24 05:29:14,904 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-24 05:29:14,904 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 286 flow [2023-08-24 05:29:14,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:14,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:14,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:14,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:29:14,905 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:14,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:14,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1368415273, now seen corresponding path program 1 times [2023-08-24 05:29:14,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:14,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335826748] [2023-08-24 05:29:14,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:14,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:15,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:15,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335826748] [2023-08-24 05:29:15,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335826748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:15,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:15,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:29:15,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975518955] [2023-08-24 05:29:15,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:15,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:15,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:15,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:15,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:15,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-08-24 05:29:15,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:15,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:15,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-08-24 05:29:15,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:15,274 INFO L124 PetriNetUnfolderBase]: 1677/2726 cut-off events. [2023-08-24 05:29:15,274 INFO L125 PetriNetUnfolderBase]: For 4607/4612 co-relation queries the response was YES. [2023-08-24 05:29:15,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9778 conditions, 2726 events. 1677/2726 cut-off events. For 4607/4612 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14717 event pairs, 207 based on Foata normal form. 3/2643 useless extension candidates. Maximal degree in co-relation 9758. Up to 1210 conditions per place. [2023-08-24 05:29:15,282 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 53 selfloop transitions, 2 changer transitions 33/95 dead transitions. [2023-08-24 05:29:15,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 769 flow [2023-08-24 05:29:15,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:29:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:29:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-08-24 05:29:15,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5193877551020408 [2023-08-24 05:29:15,283 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-08-24 05:29:15,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-08-24 05:29:15,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:15,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-08-24 05:29:15,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:15,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:15,286 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:15,286 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 286 flow. Second operand 4 states and 509 transitions. [2023-08-24 05:29:15,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 769 flow [2023-08-24 05:29:15,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 95 transitions, 628 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-24 05:29:15,306 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 222 flow [2023-08-24 05:29:15,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2023-08-24 05:29:15,307 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-08-24 05:29:15,307 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 222 flow [2023-08-24 05:29:15,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:15,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:15,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:15,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:29:15,307 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:15,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:15,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1844741059, now seen corresponding path program 2 times [2023-08-24 05:29:15,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:15,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563254540] [2023-08-24 05:29:15,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:15,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:15,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:15,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563254540] [2023-08-24 05:29:15,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563254540] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:15,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:15,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:29:15,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774355961] [2023-08-24 05:29:15,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:15,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:29:15,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:15,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:29:15,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:29:15,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 245 [2023-08-24 05:29:15,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:15,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:15,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 245 [2023-08-24 05:29:15,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:16,266 INFO L124 PetriNetUnfolderBase]: 923/1556 cut-off events. [2023-08-24 05:29:16,266 INFO L125 PetriNetUnfolderBase]: For 2481/2507 co-relation queries the response was YES. [2023-08-24 05:29:16,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5080 conditions, 1556 events. 923/1556 cut-off events. For 2481/2507 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7799 event pairs, 106 based on Foata normal form. 2/1516 useless extension candidates. Maximal degree in co-relation 5061. Up to 599 conditions per place. [2023-08-24 05:29:16,270 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 58 selfloop transitions, 4 changer transitions 35/103 dead transitions. [2023-08-24 05:29:16,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 103 transitions, 715 flow [2023-08-24 05:29:16,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:29:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:29:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 819 transitions. [2023-08-24 05:29:16,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2023-08-24 05:29:16,273 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 819 transitions. [2023-08-24 05:29:16,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 819 transitions. [2023-08-24 05:29:16,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:16,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 819 transitions. [2023-08-24 05:29:16,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:16,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:16,277 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:16,277 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 222 flow. Second operand 7 states and 819 transitions. [2023-08-24 05:29:16,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 103 transitions, 715 flow [2023-08-24 05:29:16,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 699 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-24 05:29:16,287 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 207 flow [2023-08-24 05:29:16,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2023-08-24 05:29:16,289 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-24 05:29:16,289 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 207 flow [2023-08-24 05:29:16,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:16,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:16,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:16,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:29:16,290 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:16,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:16,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1914289653, now seen corresponding path program 3 times [2023-08-24 05:29:16,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:16,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426455843] [2023-08-24 05:29:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:16,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:16,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426455843] [2023-08-24 05:29:16,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426455843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:16,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:16,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:29:16,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870682520] [2023-08-24 05:29:16,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:16,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:29:16,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:16,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:29:16,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:29:16,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 245 [2023-08-24 05:29:16,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:16,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:16,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 245 [2023-08-24 05:29:16,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:16,659 INFO L124 PetriNetUnfolderBase]: 1245/2054 cut-off events. [2023-08-24 05:29:16,660 INFO L125 PetriNetUnfolderBase]: For 3215/3215 co-relation queries the response was YES. [2023-08-24 05:29:16,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7234 conditions, 2054 events. 1245/2054 cut-off events. For 3215/3215 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10321 event pairs, 256 based on Foata normal form. 1/2055 useless extension candidates. Maximal degree in co-relation 7216. Up to 971 conditions per place. [2023-08-24 05:29:16,663 INFO L140 encePairwiseOnDemand]: 240/245 looper letters, 37 selfloop transitions, 3 changer transitions 51/91 dead transitions. [2023-08-24 05:29:16,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 655 flow [2023-08-24 05:29:16,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:29:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:29:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2023-08-24 05:29:16,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2023-08-24 05:29:16,665 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 702 transitions. [2023-08-24 05:29:16,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 702 transitions. [2023-08-24 05:29:16,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:16,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 702 transitions. [2023-08-24 05:29:16,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:16,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:16,669 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:16,669 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 207 flow. Second operand 6 states and 702 transitions. [2023-08-24 05:29:16,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 655 flow [2023-08-24 05:29:16,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 91 transitions, 640 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-24 05:29:16,681 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 190 flow [2023-08-24 05:29:16,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2023-08-24 05:29:16,682 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2023-08-24 05:29:16,682 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 190 flow [2023-08-24 05:29:16,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:16,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:16,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:16,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:29:16,682 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 05:29:16,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1192610685, now seen corresponding path program 4 times [2023-08-24 05:29:16,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:16,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107107959] [2023-08-24 05:29:16,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:16,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:29:16,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:29:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:29:16,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:29:16,779 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:29:16,780 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 05:29:16,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 05:29:16,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 05:29:16,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 05:29:16,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 05:29:16,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 05:29:16,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 05:29:16,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:29:16,782 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2023-08-24 05:29:16,786 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:29:16,786 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:29:16,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:29:16 BasicIcfg [2023-08-24 05:29:16,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:29:16,858 INFO L158 Benchmark]: Toolchain (without parser) took 10520.78ms. Allocated memory was 408.9MB in the beginning and 815.8MB in the end (delta: 406.8MB). Free memory was 384.0MB in the beginning and 722.1MB in the end (delta: -338.1MB). Peak memory consumption was 68.3MB. Max. memory is 16.0GB. [2023-08-24 05:29:16,858 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 408.9MB. Free memory is still 386.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:29:16,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.20ms. Allocated memory is still 408.9MB. Free memory was 384.0MB in the beginning and 360.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:29:16,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.44ms. Allocated memory is still 408.9MB. Free memory was 360.4MB in the beginning and 358.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:29:16,858 INFO L158 Benchmark]: Boogie Preprocessor took 47.54ms. Allocated memory is still 408.9MB. Free memory was 358.3MB in the beginning and 356.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:29:16,859 INFO L158 Benchmark]: RCFGBuilder took 467.69ms. Allocated memory is still 408.9MB. Free memory was 356.2MB in the beginning and 321.1MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-08-24 05:29:16,859 INFO L158 Benchmark]: TraceAbstraction took 9545.12ms. Allocated memory was 408.9MB in the beginning and 815.8MB in the end (delta: 406.8MB). Free memory was 320.5MB in the beginning and 722.1MB in the end (delta: -401.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.0GB. [2023-08-24 05:29:16,860 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.12ms. Allocated memory is still 408.9MB. Free memory is still 386.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 416.20ms. Allocated memory is still 408.9MB. Free memory was 384.0MB in the beginning and 360.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 40.44ms. Allocated memory is still 408.9MB. Free memory was 360.4MB in the beginning and 358.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.54ms. Allocated memory is still 408.9MB. Free memory was 358.3MB in the beginning and 356.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 467.69ms. Allocated memory is still 408.9MB. Free memory was 356.2MB in the beginning and 321.1MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 9545.12ms. Allocated memory was 408.9MB in the beginning and 815.8MB in the end (delta: 406.8MB). Free memory was 320.5MB in the beginning and 722.1MB in the end (delta: -401.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 139 PlacesBefore, 41 PlacesAfterwards, 128 TransitionsBefore, 29 TransitionsAfterwards, 2954 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 7582 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3753, independent: 3539, independent conditional: 0, independent unconditional: 3539, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1652, independent: 1614, independent conditional: 0, independent unconditional: 1614, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3753, independent: 1925, independent conditional: 0, independent unconditional: 1925, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 1652, unknown conditional: 0, unknown unconditional: 1652] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 129, Positive conditional cache size: 0, Positive unconditional cache size: 129, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L731] 0 _Bool y$flush_delayed; [L732] 0 int y$mem_tmp; [L733] 0 _Bool y$r_buff0_thd0; [L734] 0 _Bool y$r_buff0_thd1; [L735] 0 _Bool y$r_buff0_thd2; [L736] 0 _Bool y$r_buff0_thd3; [L737] 0 _Bool y$r_buff0_thd4; [L738] 0 _Bool y$r_buff1_thd0; [L739] 0 _Bool y$r_buff1_thd1; [L740] 0 _Bool y$r_buff1_thd2; [L741] 0 _Bool y$r_buff1_thd3; [L742] 0 _Bool y$r_buff1_thd4; [L743] 0 _Bool y$read_delayed; [L744] 0 int *y$read_delayed_var; [L745] 0 int y$w_buff0; [L746] 0 _Bool y$w_buff0_used; [L747] 0 int y$w_buff1; [L748] 0 _Bool y$w_buff1_used; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L863] 0 pthread_t t941; [L864] FCALL, FORK 0 pthread_create(&t941, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t941, ((void *)0), P0, ((void *)0))=-2, t941={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L865] 0 pthread_t t942; [L866] FCALL, FORK 0 pthread_create(&t942, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t942, ((void *)0), P1, ((void *)0))=-1, t941={5:0}, t942={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L867] 0 pthread_t t943; [L868] FCALL, FORK 0 pthread_create(&t943, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t943, ((void *)0), P2, ((void *)0))=0, t941={5:0}, t942={6:0}, t943={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L869] 0 pthread_t t944; [L799] 3 y$w_buff1 = y$w_buff0 [L800] 3 y$w_buff0 = 1 [L801] 3 y$w_buff1_used = y$w_buff0_used [L802] 3 y$w_buff0_used = (_Bool)1 [L803] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L803] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L804] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L805] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L806] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L807] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L808] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L809] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L870] FCALL, FORK 0 pthread_create(&t944, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t944, ((void *)0), P3, ((void *)0))=1, t941={5:0}, t942={6:0}, t943={7:0}, t944={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L812] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 4 z = 1 [L832] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L835] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L838] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EAX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 4 return 0; [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941={5:0}, t942={6:0}, t943={7:0}, t944={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 868]: 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: 864]: 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: 870]: 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: 866]: 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, 168 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: 9.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 353 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 353 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1128 IncrementalHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 17 mSDtfsCounter, 1128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=8, InterpolantAutomatonStates: 58, 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.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 1236 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 05:29:16,886 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...