/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix003.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:29:24,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:29:24,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:29:24,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:29:24,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:29:24,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:29:24,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:29:24,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:29:24,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:29:24,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:29:24,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:29:24,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:29:24,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:29:24,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:29:24,143 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:29:24,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:29:24,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:29:24,144 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:29:24,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:29:24,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:29:24,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:29:24,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:29:24,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:29:24,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:29:24,147 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:29:24,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:29:24,147 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:29:24,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:29:24,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:29:24,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:29:24,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:29:24,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:29:24,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:29:24,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:29:24,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:29:24,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:29:24,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:29:24,150 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:29:24,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:29:24,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:29:24,151 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:29:24,152 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 05:29:24,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:29:24,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:29:24,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:29:24,382 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:29:24,382 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:29:24,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix003.oepc_bound2.i [2023-08-04 05:29:25,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:29:25,690 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:29:25,690 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix003.oepc_bound2.i [2023-08-04 05:29:25,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24d49a82a/8f698dab46bd4aa49f50c480f546a8f1/FLAGacbbb8435 [2023-08-04 05:29:25,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24d49a82a/8f698dab46bd4aa49f50c480f546a8f1 [2023-08-04 05:29:25,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:29:25,719 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:29:25,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:29:25,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:29:25,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:29:25,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:29:25" (1/1) ... [2023-08-04 05:29:25,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37386552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:25, skipping insertion in model container [2023-08-04 05:29:25,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:29:25" (1/1) ... [2023-08-04 05:29:25,771 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:29:25,901 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix003.oepc_bound2.i[945,958] [2023-08-04 05:29:26,034 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:29:26,048 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:29:26,056 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix003.oepc_bound2.i[945,958] [2023-08-04 05:29:26,066 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:29:26,067 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:29:26,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:29:26,174 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:29:26,174 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:29:26,180 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:29:26,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:26 WrapperNode [2023-08-04 05:29:26,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:29:26,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:29:26,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:29:26,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:29:26,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:26" (1/1) ... [2023-08-04 05:29:26,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:26" (1/1) ... [2023-08-04 05:29:26,221 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 155 [2023-08-04 05:29:26,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:29:26,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:29:26,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:29:26,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:29:26,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:26" (1/1) ... [2023-08-04 05:29:26,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:26" (1/1) ... [2023-08-04 05:29:26,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:26" (1/1) ... [2023-08-04 05:29:26,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:26" (1/1) ... [2023-08-04 05:29:26,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:26" (1/1) ... [2023-08-04 05:29:26,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:26" (1/1) ... [2023-08-04 05:29:26,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:26" (1/1) ... [2023-08-04 05:29:26,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:26" (1/1) ... [2023-08-04 05:29:26,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:29:26,253 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:29:26,253 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:29:26,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:29:26,254 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:26" (1/1) ... [2023-08-04 05:29:26,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:29:26,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:29:26,298 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-04 05:29:26,308 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-04 05:29:26,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:29:26,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:29:26,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:29:26,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:29:26,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:29:26,339 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:29:26,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:29:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:29:26,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:29:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 05:29:26,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 05:29:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:29:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:29:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:29:26,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:29:26,342 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 05:29:26,511 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:29:26,512 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:29:26,793 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:29:26,894 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:29:26,894 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 05:29:26,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:29:26 BoogieIcfgContainer [2023-08-04 05:29:26,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:29:26,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:29:26,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:29:26,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:29:26,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:29:25" (1/3) ... [2023-08-04 05:29:26,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba14be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:29:26, skipping insertion in model container [2023-08-04 05:29:26,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:26" (2/3) ... [2023-08-04 05:29:26,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba14be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:29:26, skipping insertion in model container [2023-08-04 05:29:26,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:29:26" (3/3) ... [2023-08-04 05:29:26,903 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix003.oepc_bound2.i [2023-08-04 05:29:26,910 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:29:26,918 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:29:26,919 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:29:26,919 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:29:26,982 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:29:27,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 283 flow [2023-08-04 05:29:27,154 INFO L124 PetriNetUnfolderBase]: 30/457 cut-off events. [2023-08-04 05:29:27,154 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:29:27,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 457 events. 30/457 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2026 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 274. Up to 16 conditions per place. [2023-08-04 05:29:27,162 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 134 transitions, 283 flow [2023-08-04 05:29:27,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 134 transitions, 283 flow [2023-08-04 05:29:27,170 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:29:27,178 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 134 transitions, 283 flow [2023-08-04 05:29:27,184 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 134 transitions, 283 flow [2023-08-04 05:29:27,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 283 flow [2023-08-04 05:29:27,263 INFO L124 PetriNetUnfolderBase]: 30/457 cut-off events. [2023-08-04 05:29:27,264 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:29:27,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 457 events. 30/457 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2026 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 274. Up to 16 conditions per place. [2023-08-04 05:29:27,272 INFO L119 LiptonReduction]: Number of co-enabled transitions 2976 [2023-08-04 05:29:30,739 INFO L134 LiptonReduction]: Checked pairs total: 8777 [2023-08-04 05:29:30,739 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-04 05:29:30,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:29:30,758 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=true, 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;@70f8a3f0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:29:30,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:29:30,762 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:29:30,762 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2023-08-04 05:29:30,762 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:29:30,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:30,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 05:29:30,763 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:29:30,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:30,767 INFO L85 PathProgramCache]: Analyzing trace with hash 17717496, now seen corresponding path program 1 times [2023-08-04 05:29:30,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:30,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111502520] [2023-08-04 05:29:30,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:30,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:31,108 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-04 05:29:31,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:29:31,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111502520] [2023-08-04 05:29:31,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111502520] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:29:31,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:29:31,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:29:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556871203] [2023-08-04 05:29:31,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:29:31,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:29:31,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:29:31,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:29:31,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:29:31,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 245 [2023-08-04 05:29:31,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:31,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:29:31,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 245 [2023-08-04 05:29:31,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:29:31,692 INFO L124 PetriNetUnfolderBase]: 2468/4230 cut-off events. [2023-08-04 05:29:31,693 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-08-04 05:29:31,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8201 conditions, 4230 events. 2468/4230 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 27718 event pairs, 650 based on Foata normal form. 150/3871 useless extension candidates. Maximal degree in co-relation 6918. Up to 2665 conditions per place. [2023-08-04 05:29:31,717 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 44 selfloop transitions, 2 changer transitions 8/58 dead transitions. [2023-08-04 05:29:31,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 58 transitions, 239 flow [2023-08-04 05:29:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:29:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:29:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-08-04 05:29:31,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2023-08-04 05:29:31,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-08-04 05:29:31,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-08-04 05:29:31,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:29:31,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-08-04 05:29:31,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:31,748 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-04 05:29:31,749 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-04 05:29:31,750 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 89 flow. Second operand 3 states and 405 transitions. [2023-08-04 05:29:31,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 58 transitions, 239 flow [2023-08-04 05:29:31,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 239 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:29:31,755 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 73 flow [2023-08-04 05:29:31,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-08-04 05:29:31,760 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2023-08-04 05:29:31,760 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 73 flow [2023-08-04 05:29:31,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:31,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:31,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:29:31,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:29:31,761 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:29:31,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:31,768 INFO L85 PathProgramCache]: Analyzing trace with hash -808639117, now seen corresponding path program 1 times [2023-08-04 05:29:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:31,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056928318] [2023-08-04 05:29:31,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:31,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:31,848 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-04 05:29:31,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:29:31,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056928318] [2023-08-04 05:29:31,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056928318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:29:31,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:29:31,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:29:31,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790841436] [2023-08-04 05:29:31,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:29:31,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:29:31,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:29:31,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:29:31,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:29:31,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-08-04 05:29:31,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:31,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:29:31,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-08-04 05:29:31,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:29:32,200 INFO L124 PetriNetUnfolderBase]: 1659/2630 cut-off events. [2023-08-04 05:29:32,200 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2023-08-04 05:29:32,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5458 conditions, 2630 events. 1659/2630 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14168 event pairs, 1436 based on Foata normal form. 0/2442 useless extension candidates. Maximal degree in co-relation 5443. Up to 2544 conditions per place. [2023-08-04 05:29:32,213 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 27 selfloop transitions, 2 changer transitions 1/34 dead transitions. [2023-08-04 05:29:32,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 143 flow [2023-08-04 05:29:32,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:29:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:29:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-08-04 05:29:32,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.507482993197279 [2023-08-04 05:29:32,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-08-04 05:29:32,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-08-04 05:29:32,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:29:32,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-08-04 05:29:32,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:32,218 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-04 05:29:32,219 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-04 05:29:32,219 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 73 flow. Second operand 3 states and 373 transitions. [2023-08-04 05:29:32,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 143 flow [2023-08-04 05:29:32,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 137 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:29:32,221 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 77 flow [2023-08-04 05:29:32,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-04 05:29:32,222 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-04 05:29:32,222 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 77 flow [2023-08-04 05:29:32,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:32,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:32,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:29:32,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 05:29:32,223 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:29:32,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:32,223 INFO L85 PathProgramCache]: Analyzing trace with hash -447978901, now seen corresponding path program 1 times [2023-08-04 05:29:32,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:32,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593410091] [2023-08-04 05:29:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:32,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:29:32,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:29:32,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593410091] [2023-08-04 05:29:32,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593410091] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:29:32,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195748080] [2023-08-04 05:29:32,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:32,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:29:32,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:29:32,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:29:32,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 05:29:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:32,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:29:32,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:29:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:29:32,399 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:29:32,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195748080] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:29:32,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:29:32,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:29:32,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067036838] [2023-08-04 05:29:32,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:29:32,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:29:32,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:29:32,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:29:32,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:29:32,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-08-04 05:29:32,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:32,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:29:32,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-08-04 05:29:32,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:29:32,691 INFO L124 PetriNetUnfolderBase]: 1440/2187 cut-off events. [2023-08-04 05:29:32,691 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 05:29:32,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4415 conditions, 2187 events. 1440/2187 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10955 event pairs, 1242 based on Foata normal form. 0/2051 useless extension candidates. Maximal degree in co-relation 4399. Up to 2125 conditions per place. [2023-08-04 05:29:32,701 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 30 selfloop transitions, 2 changer transitions 1/37 dead transitions. [2023-08-04 05:29:32,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 157 flow [2023-08-04 05:29:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:29:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:29:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-04 05:29:32,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5115646258503401 [2023-08-04 05:29:32,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-04 05:29:32,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-04 05:29:32,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:29:32,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-04 05:29:32,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:32,706 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-04 05:29:32,706 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-04 05:29:32,706 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 77 flow. Second operand 3 states and 376 transitions. [2023-08-04 05:29:32,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 157 flow [2023-08-04 05:29:32,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 153 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:29:32,708 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 81 flow [2023-08-04 05:29:32,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-04 05:29:32,708 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-04 05:29:32,709 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 81 flow [2023-08-04 05:29:32,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:32,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:32,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:29:32,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 05:29:32,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:29:32,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:29:32,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:32,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1460744345, now seen corresponding path program 1 times [2023-08-04 05:29:32,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:32,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464840653] [2023-08-04 05:29:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:29:33,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:29:33,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464840653] [2023-08-04 05:29:33,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464840653] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:29:33,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040009605] [2023-08-04 05:29:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:33,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:29:33,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:29:33,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:29:33,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 05:29:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:33,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:29:33,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:29:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:29:33,103 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:29:33,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040009605] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:29:33,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:29:33,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:29:33,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851746086] [2023-08-04 05:29:33,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:29:33,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:29:33,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:29:33,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:29:33,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:29:33,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2023-08-04 05:29:33,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:33,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:29:33,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2023-08-04 05:29:33,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:29:33,366 INFO L124 PetriNetUnfolderBase]: 1344/2047 cut-off events. [2023-08-04 05:29:33,366 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-04 05:29:33,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4163 conditions, 2047 events. 1344/2047 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9797 event pairs, 1032 based on Foata normal form. 0/1962 useless extension candidates. Maximal degree in co-relation 4147. Up to 1727 conditions per place. [2023-08-04 05:29:33,375 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 34 selfloop transitions, 2 changer transitions 1/41 dead transitions. [2023-08-04 05:29:33,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 177 flow [2023-08-04 05:29:33,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:29:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:29:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-08-04 05:29:33,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170068027210885 [2023-08-04 05:29:33,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-08-04 05:29:33,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-08-04 05:29:33,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:29:33,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-08-04 05:29:33,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:33,380 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-04 05:29:33,380 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-04 05:29:33,380 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 81 flow. Second operand 3 states and 380 transitions. [2023-08-04 05:29:33,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 177 flow [2023-08-04 05:29:33,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:29:33,382 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 85 flow [2023-08-04 05:29:33,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-04 05:29:33,383 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2023-08-04 05:29:33,383 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 85 flow [2023-08-04 05:29:33,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:33,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:33,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:29:33,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 05:29:33,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 05:29:33,589 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:29:33,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:33,590 INFO L85 PathProgramCache]: Analyzing trace with hash 739112821, now seen corresponding path program 1 times [2023-08-04 05:29:33,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:33,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900409266] [2023-08-04 05:29:33,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:33,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:29:33,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:29:33,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900409266] [2023-08-04 05:29:33,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900409266] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:29:33,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436491283] [2023-08-04 05:29:33,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:33,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:29:33,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:29:33,655 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:29:33,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 05:29:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:33,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:29:33,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:29:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:29:33,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:29:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:29:33,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436491283] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:29:33,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:29:33,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:29:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384793040] [2023-08-04 05:29:33,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:29:33,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:29:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:29:33,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:29:33,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:29:33,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245 [2023-08-04 05:29:33,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:33,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:29:33,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245 [2023-08-04 05:29:33,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:29:33,846 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 05:29:33,846 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:29:33,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 21 events. 6/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 47. Up to 14 conditions per place. [2023-08-04 05:29:33,846 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 05:29:33,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 12 transitions, 51 flow [2023-08-04 05:29:33,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:29:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:29:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2023-08-04 05:29:33,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47346938775510206 [2023-08-04 05:29:33,848 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2023-08-04 05:29:33,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2023-08-04 05:29:33,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:29:33,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2023-08-04 05:29:33,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:33,851 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-04 05:29:33,852 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-04 05:29:33,852 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 85 flow. Second operand 4 states and 464 transitions. [2023-08-04 05:29:33,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 12 transitions, 51 flow [2023-08-04 05:29:33,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:29:33,852 INFO L231 Difference]: Finished difference. Result has 19 places, 0 transitions, 0 flow [2023-08-04 05:29:33,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=19, PETRI_TRANSITIONS=0} [2023-08-04 05:29:33,853 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -24 predicate places. [2023-08-04 05:29:33,853 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 0 transitions, 0 flow [2023-08-04 05:29:33,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:33,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:29:33,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:29:33,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:29:33,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-04 05:29:34,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:29:34,062 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 05:29:34,064 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:29:34,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 283 flow [2023-08-04 05:29:34,099 INFO L124 PetriNetUnfolderBase]: 30/457 cut-off events. [2023-08-04 05:29:34,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:29:34,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 457 events. 30/457 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2026 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 274. Up to 16 conditions per place. [2023-08-04 05:29:34,100 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 134 transitions, 283 flow [2023-08-04 05:29:34,101 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 105 transitions, 225 flow [2023-08-04 05:29:34,101 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:29:34,101 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 105 transitions, 225 flow [2023-08-04 05:29:34,101 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 105 transitions, 225 flow [2023-08-04 05:29:34,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 225 flow [2023-08-04 05:29:34,115 INFO L124 PetriNetUnfolderBase]: 6/225 cut-off events. [2023-08-04 05:29:34,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:29:34,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 225 events. 6/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 672 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 158. Up to 8 conditions per place. [2023-08-04 05:29:34,117 INFO L119 LiptonReduction]: Number of co-enabled transitions 1584 [2023-08-04 05:29:36,997 INFO L134 LiptonReduction]: Checked pairs total: 3617 [2023-08-04 05:29:36,997 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-08-04 05:29:36,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:29:36,999 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=true, 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;@70f8a3f0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:29:37,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:29:37,003 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:29:37,003 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 05:29:37,003 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:29:37,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:37,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:29:37,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 05:29:37,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1968624177, now seen corresponding path program 1 times [2023-08-04 05:29:37,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:37,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643782119] [2023-08-04 05:29:37,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:37,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:29:37,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:29:37,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643782119] [2023-08-04 05:29:37,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643782119] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:29:37,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:29:37,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:29:37,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824942928] [2023-08-04 05:29:37,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:29:37,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:29:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:29:37,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:29:37,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:29:37,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 218 [2023-08-04 05:29:37,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:37,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:29:37,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 218 [2023-08-04 05:29:37,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:29:37,179 INFO L124 PetriNetUnfolderBase]: 720/1191 cut-off events. [2023-08-04 05:29:37,180 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-04 05:29:37,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2458 conditions, 1191 events. 720/1191 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5310 event pairs, 548 based on Foata normal form. 0/1070 useless extension candidates. Maximal degree in co-relation 2439. Up to 1146 conditions per place. [2023-08-04 05:29:37,186 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 26 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-04 05:29:37,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 135 flow [2023-08-04 05:29:37,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:29:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:29:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-08-04 05:29:37,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5672782874617737 [2023-08-04 05:29:37,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-08-04 05:29:37,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-08-04 05:29:37,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:29:37,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-08-04 05:29:37,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:37,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:37,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:37,191 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 69 flow. Second operand 3 states and 371 transitions. [2023-08-04 05:29:37,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 135 flow [2023-08-04 05:29:37,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 135 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:29:37,193 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow [2023-08-04 05:29:37,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=77, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-08-04 05:29:37,195 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-04 05:29:37,195 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2023-08-04 05:29:37,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:37,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:37,195 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:29:37,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 05:29:37,195 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 05:29:37,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1963891343, now seen corresponding path program 1 times [2023-08-04 05:29:37,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:37,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787341866] [2023-08-04 05:29:37,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:37,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:29:37,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:29:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:29:37,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:29:37,245 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:29:37,245 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 05:29:37,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 05:29:37,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 05:29:37,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 05:29:37,245 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 05:29:37,246 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 05:29:37,246 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:29:37,246 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:29:37,276 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:29:37,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 161 transitions, 358 flow [2023-08-04 05:29:37,405 INFO L124 PetriNetUnfolderBase]: 93/1404 cut-off events. [2023-08-04 05:29:37,406 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:29:37,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 1404 events. 93/1404 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9717 event pairs, 0 based on Foata normal form. 0/1243 useless extension candidates. Maximal degree in co-relation 1018. Up to 54 conditions per place. [2023-08-04 05:29:37,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 161 transitions, 358 flow [2023-08-04 05:29:37,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 161 transitions, 358 flow [2023-08-04 05:29:37,415 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:29:37,415 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 161 transitions, 358 flow [2023-08-04 05:29:37,416 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 161 transitions, 358 flow [2023-08-04 05:29:37,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 161 transitions, 358 flow [2023-08-04 05:29:37,529 INFO L124 PetriNetUnfolderBase]: 93/1404 cut-off events. [2023-08-04 05:29:37,530 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:29:37,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 1404 events. 93/1404 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9717 event pairs, 0 based on Foata normal form. 0/1243 useless extension candidates. Maximal degree in co-relation 1018. Up to 54 conditions per place. [2023-08-04 05:29:37,559 INFO L119 LiptonReduction]: Number of co-enabled transitions 7248 [2023-08-04 05:29:40,648 INFO L134 LiptonReduction]: Checked pairs total: 22984 [2023-08-04 05:29:40,648 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-04 05:29:40,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:29:40,650 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=true, 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;@70f8a3f0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:29:40,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:29:40,652 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:29:40,652 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-04 05:29:40,652 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:29:40,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:40,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 05:29:40,653 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:29:40,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:40,653 INFO L85 PathProgramCache]: Analyzing trace with hash 29719177, now seen corresponding path program 1 times [2023-08-04 05:29:40,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:40,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340431067] [2023-08-04 05:29:40,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:40,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:40,728 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-04 05:29:40,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:29:40,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340431067] [2023-08-04 05:29:40,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340431067] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:29:40,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:29:40,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:29:40,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001845356] [2023-08-04 05:29:40,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:29:40,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:29:40,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:29:40,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:29:40,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:29:40,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 279 [2023-08-04 05:29:40,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:40,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:29:40,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 279 [2023-08-04 05:29:40,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:30:53,449 INFO L124 PetriNetUnfolderBase]: 633758/832282 cut-off events. [2023-08-04 05:30:53,449 INFO L125 PetriNetUnfolderBase]: For 9452/9452 co-relation queries the response was YES. [2023-08-04 05:30:55,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635605 conditions, 832282 events. 633758/832282 cut-off events. For 9452/9452 co-relation queries the response was YES. Maximal size of possible extension queue 22729. Compared 6416578 event pairs, 105182 based on Foata normal form. 17577/757173 useless extension candidates. Maximal degree in co-relation 1376955. Up to 729279 conditions per place. [2023-08-04 05:30:57,846 INFO L140 encePairwiseOnDemand]: 273/279 looper letters, 75 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2023-08-04 05:30:57,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 92 transitions, 397 flow [2023-08-04 05:30:57,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:30:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:30:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2023-08-04 05:30:57,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5818399044205496 [2023-08-04 05:30:57,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2023-08-04 05:30:57,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2023-08-04 05:30:57,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:30:57,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2023-08-04 05:30:57,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:30:57,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:30:57,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:30:57,852 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 152 flow. Second operand 3 states and 487 transitions. [2023-08-04 05:30:57,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 92 transitions, 397 flow [2023-08-04 05:30:57,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 92 transitions, 391 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 05:30:57,864 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 165 flow [2023-08-04 05:30:57,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2023-08-04 05:30:57,864 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 3 predicate places. [2023-08-04 05:30:57,865 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 165 flow [2023-08-04 05:30:57,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:30:57,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:30:57,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:30:57,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 05:30:57,865 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:30:57,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:30:57,866 INFO L85 PathProgramCache]: Analyzing trace with hash 374874287, now seen corresponding path program 1 times [2023-08-04 05:30:57,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:30:57,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330765912] [2023-08-04 05:30:57,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:30:57,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:30:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:30:57,900 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-04 05:30:57,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:30:57,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330765912] [2023-08-04 05:30:57,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330765912] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:30:57,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:30:57,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:30:57,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725895511] [2023-08-04 05:30:57,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:30:57,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:30:57,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:30:57,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:30:57,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:30:57,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 279 [2023-08-04 05:30:57,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:30:57,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:30:57,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 279 [2023-08-04 05:30:57,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:32:13,065 INFO L124 PetriNetUnfolderBase]: 618374/803826 cut-off events. [2023-08-04 05:32:13,065 INFO L125 PetriNetUnfolderBase]: For 61834/61834 co-relation queries the response was YES. [2023-08-04 05:32:14,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1692233 conditions, 803826 events. 618374/803826 cut-off events. For 61834/61834 co-relation queries the response was YES. Maximal size of possible extension queue 21256. Compared 5844348 event pairs, 518026 based on Foata normal form. 0/703751 useless extension candidates. Maximal degree in co-relation 1114394. Up to 771849 conditions per place. [2023-08-04 05:32:17,564 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 48 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-04 05:32:17,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 64 transitions, 278 flow [2023-08-04 05:32:17,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:32:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:32:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-04 05:32:17,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5316606929510155 [2023-08-04 05:32:17,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-04 05:32:17,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-04 05:32:17,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:32:17,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-04 05:32:17,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:32:17,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:32:17,569 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:32:17,569 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 165 flow. Second operand 3 states and 445 transitions. [2023-08-04 05:32:17,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 64 transitions, 278 flow [2023-08-04 05:32:17,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 64 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:32:17,571 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 174 flow [2023-08-04 05:32:17,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2023-08-04 05:32:17,572 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 5 predicate places. [2023-08-04 05:32:17,572 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 174 flow [2023-08-04 05:32:17,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:32:17,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:32:17,572 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:32:17,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 05:32:17,572 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:32:17,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:32:17,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1916743163, now seen corresponding path program 1 times [2023-08-04 05:32:17,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:32:17,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573521078] [2023-08-04 05:32:17,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:32:17,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:32:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:32:17,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:32:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:32:17,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:32:17,603 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:32:17,603 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:32:17,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:32:17,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:32:17,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:32:17,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 05:32:17,604 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 05:32:17,604 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:32:17,605 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:32:17,606 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:32:17,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:32:17 BasicIcfg [2023-08-04 05:32:17,645 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:32:17,647 INFO L158 Benchmark]: Toolchain (without parser) took 171926.71ms. Allocated memory was 346.0MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 295.5MB in the beginning and 9.5GB in the end (delta: -9.2GB). Peak memory consumption was 6.4GB. Max. memory is 16.0GB. [2023-08-04 05:32:17,647 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 346.0MB. Free memory is still 298.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:32:17,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.86ms. Allocated memory is still 346.0MB. Free memory was 295.2MB in the beginning and 271.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 05:32:17,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.78ms. Allocated memory is still 346.0MB. Free memory was 271.4MB in the beginning and 269.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:32:17,648 INFO L158 Benchmark]: Boogie Preprocessor took 30.36ms. Allocated memory is still 346.0MB. Free memory was 269.0MB in the beginning and 266.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:32:17,648 INFO L158 Benchmark]: RCFGBuilder took 643.19ms. Allocated memory was 346.0MB in the beginning and 501.2MB in the end (delta: 155.2MB). Free memory was 266.9MB in the beginning and 441.3MB in the end (delta: -174.4MB). Peak memory consumption was 20.4MB. Max. memory is 16.0GB. [2023-08-04 05:32:17,649 INFO L158 Benchmark]: TraceAbstraction took 170747.34ms. Allocated memory was 501.2MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 440.8MB in the beginning and 9.5GB in the end (delta: -9.1GB). Peak memory consumption was 6.4GB. Max. memory is 16.0GB. [2023-08-04 05:32:17,650 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.13ms. Allocated memory is still 346.0MB. Free memory is still 298.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 460.86ms. Allocated memory is still 346.0MB. Free memory was 295.2MB in the beginning and 271.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 39.78ms. Allocated memory is still 346.0MB. Free memory was 271.4MB in the beginning and 269.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.36ms. Allocated memory is still 346.0MB. Free memory was 269.0MB in the beginning and 266.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 643.19ms. Allocated memory was 346.0MB in the beginning and 501.2MB in the end (delta: 155.2MB). Free memory was 266.9MB in the beginning and 441.3MB in the end (delta: -174.4MB). Peak memory consumption was 20.4MB. Max. memory is 16.0GB. * TraceAbstraction took 170747.34ms. Allocated memory was 501.2MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 440.8MB in the beginning and 9.5GB in the end (delta: -9.1GB). Peak memory consumption was 6.4GB. 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.6s, 136 PlacesBefore, 43 PlacesAfterwards, 134 TransitionsBefore, 37 TransitionsAfterwards, 2976 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 111 TotalNumberOfCompositions, 8777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4738, independent: 4512, independent conditional: 0, independent unconditional: 4512, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1591, independent: 1558, independent conditional: 0, independent unconditional: 1558, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4738, independent: 2954, independent conditional: 0, independent unconditional: 2954, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 1591, unknown conditional: 0, unknown unconditional: 1591] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 188, Positive conditional cache size: 0, Positive unconditional cache size: 188, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 110 PlacesBefore, 34 PlacesAfterwards, 105 TransitionsBefore, 27 TransitionsAfterwards, 1584 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 84 TotalNumberOfCompositions, 3617 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1805, independent: 1683, independent conditional: 0, independent unconditional: 1683, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 767, independent: 750, independent conditional: 0, independent unconditional: 750, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1805, independent: 933, independent conditional: 0, independent unconditional: 933, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 767, unknown conditional: 0, unknown unconditional: 767] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 169 PlacesBefore, 70 PlacesAfterwards, 161 TransitionsBefore, 58 TransitionsAfterwards, 7248 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 118 TotalNumberOfCompositions, 22984 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7028, independent: 6683, independent conditional: 0, independent unconditional: 6683, dependent: 345, dependent conditional: 0, dependent unconditional: 345, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3281, independent: 3228, independent conditional: 0, independent unconditional: 3228, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7028, independent: 3455, independent conditional: 0, independent unconditional: 3455, dependent: 292, dependent conditional: 0, dependent unconditional: 292, unknown: 3281, unknown conditional: 0, unknown unconditional: 3281] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 282, Positive conditional cache size: 0, Positive unconditional cache size: 282, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L845] 0 pthread_t t62[2]; [L846] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t62={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] COND TRUE 0 asdf<2 [L846] FCALL, FORK 0 pthread_create(&t62[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t62[asdf], ((void *)0), P0, ((void *)0))=-1, t62={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L749] 1 z$w_buff1 = z$w_buff0 [L750] 1 z$w_buff0 = 1 [L751] 1 z$w_buff1_used = z$w_buff0_used [L752] 1 z$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L754] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L755] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L756] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L757] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L758] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t62={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] COND TRUE 0 asdf<2 [L846] FCALL, FORK 0 pthread_create(&t62[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t62[asdf], ((void *)0), P0, ((void *)0))=0, t62={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L749] 2 z$w_buff1 = z$w_buff0 [L750] 2 z$w_buff0 = 1 [L751] 2 z$w_buff1_used = z$w_buff0_used [L752] 2 z$w_buff0_used = (_Bool)1 [L753] CALL 2 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, expression=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=1, z$w_buff1_used=1, z=0] - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 157 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 287 IncrementalHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 15 mSDtfsCounter, 287 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 552 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 10/15 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 10 procedures, 184 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: 160.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 156.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=2, InterpolantAutomatonStates: 6, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 157 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=1, InterpolantAutomatonStates: 3, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 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-04 05:32:17,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...