/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:11:04,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:11:04,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:11:04,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:11:04,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:11:04,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:11:04,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:11:04,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:11:04,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:11:04,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:11:04,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:11:04,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:11:04,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:11:04,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:11:04,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:11:04,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:11:04,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:11:04,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:11:04,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:11:04,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:11:04,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:11:04,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:11:04,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:11:04,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:11:04,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:11:04,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:11:04,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:11:04,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:11:04,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:11:04,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:11:04,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:11:04,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:11:04,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:11:04,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:11:04,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:11:04,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:11:04,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:11:04,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:11:04,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:11:04,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:11:04,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:11:04,213 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:11:04,235 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:11:04,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:11:04,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:11:04,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:11:04,237 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:11:04,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:11:04,238 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:11:04,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:11:04,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:11:04,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:11:04,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:11:04,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:11:04,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:11:04,239 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:11:04,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:11:04,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:11:04,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:11:04,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:11:04,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:11:04,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:11:04,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:11:04,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:11:04,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:11:04,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:11:04,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:11:04,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:11:04,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:11:04,241 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:11:04,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-05 23:11:04,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:11:04,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:11:04,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:11:04,527 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:11:04,528 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:11:04,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-12-05 23:11:05,562 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:11:05,774 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:11:05,774 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-12-05 23:11:05,796 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9531be181/eee9611704494363bfe9b383a33b1784/FLAG4b6fe5b23 [2022-12-05 23:11:05,811 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9531be181/eee9611704494363bfe9b383a33b1784 [2022-12-05 23:11:05,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:11:05,816 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:11:05,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:11:05,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:11:05,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:11:05,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:11:05" (1/1) ... [2022-12-05 23:11:05,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d785036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:05, skipping insertion in model container [2022-12-05 23:11:05,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:11:05" (1/1) ... [2022-12-05 23:11:05,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:11:05,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:11:06,015 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2022-12-05 23:11:06,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:11:06,203 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:11:06,210 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2022-12-05 23:11:06,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:06,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:06,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:11:06,287 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:11:06,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:06 WrapperNode [2022-12-05 23:11:06,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:11:06,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:11:06,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:11:06,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:11:06,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:06" (1/1) ... [2022-12-05 23:11:06,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:06" (1/1) ... [2022-12-05 23:11:06,335 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-05 23:11:06,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:11:06,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:11:06,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:11:06,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:11:06,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:06" (1/1) ... [2022-12-05 23:11:06,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:06" (1/1) ... [2022-12-05 23:11:06,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:06" (1/1) ... [2022-12-05 23:11:06,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:06" (1/1) ... [2022-12-05 23:11:06,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:06" (1/1) ... [2022-12-05 23:11:06,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:06" (1/1) ... [2022-12-05 23:11:06,363 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:06" (1/1) ... [2022-12-05 23:11:06,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:06" (1/1) ... [2022-12-05 23:11:06,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:11:06,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:11:06,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:11:06,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:11:06,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:06" (1/1) ... [2022-12-05 23:11:06,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:11:06,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:11:06,435 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) [2022-12-05 23:11:06,455 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 [2022-12-05 23:11:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:11:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:11:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:11:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:11:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:11:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:11:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:11:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:11:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:11:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:11:06,476 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:11:06,632 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:11:06,634 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:11:06,882 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:11:06,995 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:11:06,995 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:11:06,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:11:06 BoogieIcfgContainer [2022-12-05 23:11:06,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:11:06,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:11:06,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:11:07,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:11:07,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:11:05" (1/3) ... [2022-12-05 23:11:07,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41dba9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:11:07, skipping insertion in model container [2022-12-05 23:11:07,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:06" (2/3) ... [2022-12-05 23:11:07,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41dba9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:11:07, skipping insertion in model container [2022-12-05 23:11:07,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:11:06" (3/3) ... [2022-12-05 23:11:07,002 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-12-05 23:11:07,014 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:11:07,014 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:11:07,014 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:11:07,055 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:11:07,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-05 23:11:07,131 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-05 23:11:07,132 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:11:07,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 23:11:07,137 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-05 23:11:07,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-05 23:11:07,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:07,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-05 23:11:07,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-05 23:11:07,192 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-05 23:11:07,192 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:11:07,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 23:11:07,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-05 23:11:07,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-05 23:11:10,653 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-05 23:11:10,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:11:10,666 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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;@14dd39d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:11:10,667 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 23:11:10,669 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 23:11:10,669 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:11:10,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:10,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:11:10,669 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:10,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:10,672 INFO L85 PathProgramCache]: Analyzing trace with hash 437146584, now seen corresponding path program 1 times [2022-12-05 23:11:10,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:10,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264169195] [2022-12-05 23:11:10,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:10,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:11:10,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:10,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264169195] [2022-12-05 23:11:10,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264169195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:10,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:10,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:11:10,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036926346] [2022-12-05 23:11:10,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:10,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:11:10,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:10,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:11:10,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:11:10,991 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-05 23:11:10,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:10,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:10,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-05 23:11:10,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:11,218 INFO L130 PetriNetUnfolder]: 1023/1664 cut-off events. [2022-12-05 23:11:11,219 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 23:11:11,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3239 conditions, 1664 events. 1023/1664 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8527 event pairs, 168 based on Foata normal form. 0/1516 useless extension candidates. Maximal degree in co-relation 3228. Up to 1228 conditions per place. [2022-12-05 23:11:11,226 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 29 selfloop transitions, 2 changer transitions 6/39 dead transitions. [2022-12-05 23:11:11,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 164 flow [2022-12-05 23:11:11,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:11:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:11:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-05 23:11:11,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2022-12-05 23:11:11,235 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 48 transitions. [2022-12-05 23:11:11,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 164 flow [2022-12-05 23:11:11,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:11:11,238 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 52 flow [2022-12-05 23:11:11,239 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-05 23:11:11,242 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-05 23:11:11,242 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:11,242 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 52 flow [2022-12-05 23:11:11,244 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:11,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:11,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 52 flow [2022-12-05 23:11:11,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-05 23:11:11,248 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-05 23:11:11,249 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:11:11,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:11:11,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-05 23:11:11,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-05 23:11:11,358 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:11:11,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-05 23:11:11,360 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-05 23:11:11,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:11,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:11,360 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:11,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:11:11,361 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash 54980557, now seen corresponding path program 1 times [2022-12-05 23:11:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:11,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913900860] [2022-12-05 23:11:11,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:11,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:11:11,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:11,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913900860] [2022-12-05 23:11:11,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913900860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:11,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:11,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:11:11,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656585888] [2022-12-05 23:11:11,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:11,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:11:11,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:11,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:11:11,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:11:11,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:11:11,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:11,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:11,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:11:11,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:11,673 INFO L130 PetriNetUnfolder]: 1317/2014 cut-off events. [2022-12-05 23:11:11,674 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-12-05 23:11:11,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4198 conditions, 2014 events. 1317/2014 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9443 event pairs, 419 based on Foata normal form. 70/2084 useless extension candidates. Maximal degree in co-relation 4188. Up to 1272 conditions per place. [2022-12-05 23:11:11,682 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 31 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2022-12-05 23:11:11,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 164 flow [2022-12-05 23:11:11,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:11:11,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:11:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 23:11:11,683 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-05 23:11:11,683 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 38 transitions. [2022-12-05 23:11:11,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 164 flow [2022-12-05 23:11:11,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:11:11,684 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 92 flow [2022-12-05 23:11:11,684 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2022-12-05 23:11:11,685 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2022-12-05 23:11:11,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:11,685 INFO L89 Accepts]: Start accepts. Operand has 31 places, 25 transitions, 92 flow [2022-12-05 23:11:11,686 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:11,686 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:11,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 25 transitions, 92 flow [2022-12-05 23:11:11,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 25 transitions, 92 flow [2022-12-05 23:11:11,698 INFO L130 PetriNetUnfolder]: 47/160 cut-off events. [2022-12-05 23:11:11,699 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-05 23:11:11,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 160 events. 47/160 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 813 event pairs, 17 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 304. Up to 63 conditions per place. [2022-12-05 23:11:11,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 25 transitions, 92 flow [2022-12-05 23:11:11,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-05 23:11:11,735 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:11:11,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-05 23:11:11,737 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 92 flow [2022-12-05 23:11:11,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:11,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:11,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:11,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:11:11,738 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:11,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1704397050, now seen corresponding path program 1 times [2022-12-05 23:11:11,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:11,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707682286] [2022-12-05 23:11:11,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:11:11,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:11,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707682286] [2022-12-05 23:11:11,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707682286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:11,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:11,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:11:11,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40014094] [2022-12-05 23:11:11,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:11,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:11:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:11,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:11:11,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:11:11,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:11:11,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:11,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:11,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:11:11,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:12,053 INFO L130 PetriNetUnfolder]: 1042/1673 cut-off events. [2022-12-05 23:11:12,054 INFO L131 PetriNetUnfolder]: For 715/719 co-relation queries the response was YES. [2022-12-05 23:11:12,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4182 conditions, 1673 events. 1042/1673 cut-off events. For 715/719 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8057 event pairs, 280 based on Foata normal form. 15/1678 useless extension candidates. Maximal degree in co-relation 4170. Up to 1207 conditions per place. [2022-12-05 23:11:12,062 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 27 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-05 23:11:12,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 180 flow [2022-12-05 23:11:12,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:11:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:11:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-05 23:11:12,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-05 23:11:12,064 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 92 flow. Second operand 3 states and 33 transitions. [2022-12-05 23:11:12,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 180 flow [2022-12-05 23:11:12,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:11:12,070 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 91 flow [2022-12-05 23:11:12,070 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2022-12-05 23:11:12,071 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2022-12-05 23:11:12,071 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:12,071 INFO L89 Accepts]: Start accepts. Operand has 32 places, 25 transitions, 91 flow [2022-12-05 23:11:12,072 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:12,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:12,072 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 91 flow [2022-12-05 23:11:12,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 91 flow [2022-12-05 23:11:12,081 INFO L130 PetriNetUnfolder]: 35/125 cut-off events. [2022-12-05 23:11:12,081 INFO L131 PetriNetUnfolder]: For 18/27 co-relation queries the response was YES. [2022-12-05 23:11:12,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 125 events. 35/125 cut-off events. For 18/27 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 537 event pairs, 13 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 229. Up to 53 conditions per place. [2022-12-05 23:11:12,083 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 91 flow [2022-12-05 23:11:12,083 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-05 23:11:12,085 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:11:12,086 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-05 23:11:12,086 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 91 flow [2022-12-05 23:11:12,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:12,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:12,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:12,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:11:12,086 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:12,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:12,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1296634472, now seen corresponding path program 1 times [2022-12-05 23:11:12,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:12,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662247649] [2022-12-05 23:11:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:12,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:11:12,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:12,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662247649] [2022-12-05 23:11:12,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662247649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:12,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:12,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:11:12,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634532380] [2022-12-05 23:11:12,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:12,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:11:12,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:12,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:11:12,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:11:12,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:11:12,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 91 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:12,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:12,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:11:12,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:12,350 INFO L130 PetriNetUnfolder]: 1230/1882 cut-off events. [2022-12-05 23:11:12,351 INFO L131 PetriNetUnfolder]: For 610/610 co-relation queries the response was YES. [2022-12-05 23:11:12,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4750 conditions, 1882 events. 1230/1882 cut-off events. For 610/610 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8466 event pairs, 147 based on Foata normal form. 6/1888 useless extension candidates. Maximal degree in co-relation 4737. Up to 1070 conditions per place. [2022-12-05 23:11:12,360 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 38 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2022-12-05 23:11:12,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 259 flow [2022-12-05 23:11:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:11:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:11:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-05 23:11:12,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-05 23:11:12,361 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 91 flow. Second operand 4 states and 45 transitions. [2022-12-05 23:11:12,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 259 flow [2022-12-05 23:11:12,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 48 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:11:12,363 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 160 flow [2022-12-05 23:11:12,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-05 23:11:12,363 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-12-05 23:11:12,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:12,364 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 160 flow [2022-12-05 23:11:12,364 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:12,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:12,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 160 flow [2022-12-05 23:11:12,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 160 flow [2022-12-05 23:11:12,373 INFO L130 PetriNetUnfolder]: 29/111 cut-off events. [2022-12-05 23:11:12,373 INFO L131 PetriNetUnfolder]: For 69/78 co-relation queries the response was YES. [2022-12-05 23:11:12,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 111 events. 29/111 cut-off events. For 69/78 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 465 event pairs, 8 based on Foata normal form. 1/110 useless extension candidates. Maximal degree in co-relation 276. Up to 45 conditions per place. [2022-12-05 23:11:12,374 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 160 flow [2022-12-05 23:11:12,374 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-05 23:11:12,375 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:11:12,375 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-05 23:11:12,376 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 160 flow [2022-12-05 23:11:12,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:12,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:12,376 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:12,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:11:12,376 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:12,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:12,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1299860797, now seen corresponding path program 1 times [2022-12-05 23:11:12,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:12,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863435878] [2022-12-05 23:11:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:12,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:11:12,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:12,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863435878] [2022-12-05 23:11:12,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863435878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:12,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:12,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:11:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035284838] [2022-12-05 23:11:12,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:12,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:11:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:12,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:11:12,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:11:12,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:11:12,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 160 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:12,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:12,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:11:12,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:12,710 INFO L130 PetriNetUnfolder]: 1451/2214 cut-off events. [2022-12-05 23:11:12,710 INFO L131 PetriNetUnfolder]: For 2190/2190 co-relation queries the response was YES. [2022-12-05 23:11:12,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6210 conditions, 2214 events. 1451/2214 cut-off events. For 2190/2190 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10176 event pairs, 323 based on Foata normal form. 69/2283 useless extension candidates. Maximal degree in co-relation 6194. Up to 1320 conditions per place. [2022-12-05 23:11:12,718 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 35 selfloop transitions, 5 changer transitions 12/52 dead transitions. [2022-12-05 23:11:12,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 339 flow [2022-12-05 23:11:12,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:11:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:11:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-05 23:11:12,720 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-05 23:11:12,721 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 160 flow. Second operand 4 states and 42 transitions. [2022-12-05 23:11:12,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 339 flow [2022-12-05 23:11:12,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:11:12,730 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 139 flow [2022-12-05 23:11:12,730 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2022-12-05 23:11:12,732 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2022-12-05 23:11:12,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:12,732 INFO L89 Accepts]: Start accepts. Operand has 40 places, 26 transitions, 139 flow [2022-12-05 23:11:12,733 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:12,733 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:12,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 139 flow [2022-12-05 23:11:12,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 26 transitions, 139 flow [2022-12-05 23:11:12,740 INFO L130 PetriNetUnfolder]: 13/56 cut-off events. [2022-12-05 23:11:12,761 INFO L131 PetriNetUnfolder]: For 76/79 co-relation queries the response was YES. [2022-12-05 23:11:12,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 56 events. 13/56 cut-off events. For 76/79 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 173 event pairs, 2 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 153. Up to 26 conditions per place. [2022-12-05 23:11:12,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 26 transitions, 139 flow [2022-12-05 23:11:12,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-05 23:11:12,768 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:11:12,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-05 23:11:12,769 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 139 flow [2022-12-05 23:11:12,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:12,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:12,770 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:12,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:11:12,770 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:12,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:12,770 INFO L85 PathProgramCache]: Analyzing trace with hash -284777982, now seen corresponding path program 1 times [2022-12-05 23:11:12,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:12,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782024139] [2022-12-05 23:11:12,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:12,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:11:12,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:12,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782024139] [2022-12-05 23:11:12,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782024139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:12,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:12,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:11:12,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175258495] [2022-12-05 23:11:12,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:12,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:11:12,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:12,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:11:12,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:11:12,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:11:12,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 139 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:12,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:12,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:11:12,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:13,045 INFO L130 PetriNetUnfolder]: 649/1010 cut-off events. [2022-12-05 23:11:13,045 INFO L131 PetriNetUnfolder]: For 1204/1204 co-relation queries the response was YES. [2022-12-05 23:11:13,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3069 conditions, 1010 events. 649/1010 cut-off events. For 1204/1204 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3928 event pairs, 172 based on Foata normal form. 9/1019 useless extension candidates. Maximal degree in co-relation 3050. Up to 553 conditions per place. [2022-12-05 23:11:13,051 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 35 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2022-12-05 23:11:13,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 259 flow [2022-12-05 23:11:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:11:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:11:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-05 23:11:13,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4875 [2022-12-05 23:11:13,054 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 139 flow. Second operand 4 states and 39 transitions. [2022-12-05 23:11:13,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 259 flow [2022-12-05 23:11:13,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 237 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-05 23:11:13,058 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 135 flow [2022-12-05 23:11:13,058 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-05 23:11:13,060 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-05 23:11:13,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:13,060 INFO L89 Accepts]: Start accepts. Operand has 39 places, 26 transitions, 135 flow [2022-12-05 23:11:13,061 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:13,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:13,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 135 flow [2022-12-05 23:11:13,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 135 flow [2022-12-05 23:11:13,066 INFO L130 PetriNetUnfolder]: 10/51 cut-off events. [2022-12-05 23:11:13,066 INFO L131 PetriNetUnfolder]: For 40/42 co-relation queries the response was YES. [2022-12-05 23:11:13,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 51 events. 10/51 cut-off events. For 40/42 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 2 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 135. Up to 21 conditions per place. [2022-12-05 23:11:13,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 135 flow [2022-12-05 23:11:13,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-05 23:11:13,068 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:11:13,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-05 23:11:13,069 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 135 flow [2022-12-05 23:11:13,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:13,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:13,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:13,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:11:13,069 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:13,073 INFO L85 PathProgramCache]: Analyzing trace with hash -284780617, now seen corresponding path program 1 times [2022-12-05 23:11:13,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:13,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861052422] [2022-12-05 23:11:13,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:13,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:11:13,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:13,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861052422] [2022-12-05 23:11:13,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861052422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:13,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:13,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:11:13,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831208588] [2022-12-05 23:11:13,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:13,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:11:13,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:13,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:11:13,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:11:13,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:11:13,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 135 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:13,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:13,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:11:13,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:13,349 INFO L130 PetriNetUnfolder]: 628/980 cut-off events. [2022-12-05 23:11:13,349 INFO L131 PetriNetUnfolder]: For 859/859 co-relation queries the response was YES. [2022-12-05 23:11:13,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 980 events. 628/980 cut-off events. For 859/859 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3880 event pairs, 172 based on Foata normal form. 9/989 useless extension candidates. Maximal degree in co-relation 2923. Up to 658 conditions per place. [2022-12-05 23:11:13,354 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 38 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2022-12-05 23:11:13,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 285 flow [2022-12-05 23:11:13,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:11:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:11:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-05 23:11:13,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-05 23:11:13,355 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 135 flow. Second operand 4 states and 45 transitions. [2022-12-05 23:11:13,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 285 flow [2022-12-05 23:11:13,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 264 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-05 23:11:13,357 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 152 flow [2022-12-05 23:11:13,357 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-05 23:11:13,357 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-05 23:11:13,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:13,357 INFO L89 Accepts]: Start accepts. Operand has 41 places, 27 transitions, 152 flow [2022-12-05 23:11:13,358 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:13,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:13,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 152 flow [2022-12-05 23:11:13,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 27 transitions, 152 flow [2022-12-05 23:11:13,363 INFO L130 PetriNetUnfolder]: 9/49 cut-off events. [2022-12-05 23:11:13,363 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-05 23:11:13,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 49 events. 9/49 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 143 event pairs, 2 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 134. Up to 19 conditions per place. [2022-12-05 23:11:13,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 27 transitions, 152 flow [2022-12-05 23:11:13,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-05 23:11:13,364 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:11:13,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-05 23:11:13,365 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 152 flow [2022-12-05 23:11:13,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:13,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:13,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:13,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:11:13,365 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:13,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:13,366 INFO L85 PathProgramCache]: Analyzing trace with hash -153973272, now seen corresponding path program 1 times [2022-12-05 23:11:13,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:13,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342241291] [2022-12-05 23:11:13,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:13,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:11:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:13,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342241291] [2022-12-05 23:11:13,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342241291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:13,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:13,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:11:13,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379935979] [2022-12-05 23:11:13,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:13,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:11:13,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:13,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:11:13,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:11:13,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:11:13,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 152 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:13,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:13,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:11:13,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:13,620 INFO L130 PetriNetUnfolder]: 897/1405 cut-off events. [2022-12-05 23:11:13,620 INFO L131 PetriNetUnfolder]: For 1564/1564 co-relation queries the response was YES. [2022-12-05 23:11:13,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4293 conditions, 1405 events. 897/1405 cut-off events. For 1564/1564 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5977 event pairs, 276 based on Foata normal form. 27/1432 useless extension candidates. Maximal degree in co-relation 4274. Up to 674 conditions per place. [2022-12-05 23:11:13,626 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 33 selfloop transitions, 4 changer transitions 10/47 dead transitions. [2022-12-05 23:11:13,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 323 flow [2022-12-05 23:11:13,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:11:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:11:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-05 23:11:13,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:11:13,628 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 152 flow. Second operand 4 states and 40 transitions. [2022-12-05 23:11:13,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 323 flow [2022-12-05 23:11:13,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:11:13,631 INFO L231 Difference]: Finished difference. Result has 44 places, 25 transitions, 142 flow [2022-12-05 23:11:13,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2022-12-05 23:11:13,631 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-05 23:11:13,632 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:13,632 INFO L89 Accepts]: Start accepts. Operand has 44 places, 25 transitions, 142 flow [2022-12-05 23:11:13,632 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:13,632 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:13,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 25 transitions, 142 flow [2022-12-05 23:11:13,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 25 transitions, 142 flow [2022-12-05 23:11:13,637 INFO L130 PetriNetUnfolder]: 6/38 cut-off events. [2022-12-05 23:11:13,637 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-05 23:11:13,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 38 events. 6/38 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 89 event pairs, 2 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 111. Up to 16 conditions per place. [2022-12-05 23:11:13,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 25 transitions, 142 flow [2022-12-05 23:11:13,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-05 23:11:13,761 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] $Ultimate##0-->L802: Formula: (and (= v_~__unbuffered_p2_EAX~0_4 v_~y~0_7) (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_7} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] and [314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3] [2022-12-05 23:11:13,995 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:11:13,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 364 [2022-12-05 23:11:13,996 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 23 transitions, 137 flow [2022-12-05 23:11:13,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:13,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:13,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:13,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:11:13,997 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:13,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:13,997 INFO L85 PathProgramCache]: Analyzing trace with hash -100439077, now seen corresponding path program 1 times [2022-12-05 23:11:13,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:13,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402833818] [2022-12-05 23:11:13,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:13,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:11:14,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:14,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402833818] [2022-12-05 23:11:14,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402833818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:14,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:14,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:11:14,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577802619] [2022-12-05 23:11:14,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:14,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:11:14,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:14,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:11:14,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:11:14,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:11:14,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 23 transitions, 137 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:14,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:14,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:11:14,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:14,189 INFO L130 PetriNetUnfolder]: 576/896 cut-off events. [2022-12-05 23:11:14,189 INFO L131 PetriNetUnfolder]: For 1143/1143 co-relation queries the response was YES. [2022-12-05 23:11:14,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2740 conditions, 896 events. 576/896 cut-off events. For 1143/1143 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3534 event pairs, 168 based on Foata normal form. 27/923 useless extension candidates. Maximal degree in co-relation 2719. Up to 396 conditions per place. [2022-12-05 23:11:14,193 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 23 selfloop transitions, 2 changer transitions 20/45 dead transitions. [2022-12-05 23:11:14,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 279 flow [2022-12-05 23:11:14,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:11:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:11:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-05 23:11:14,194 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2022-12-05 23:11:14,194 INFO L175 Difference]: Start difference. First operand has 42 places, 23 transitions, 137 flow. Second operand 5 states and 46 transitions. [2022-12-05 23:11:14,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 279 flow [2022-12-05 23:11:14,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 247 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-05 23:11:14,197 INFO L231 Difference]: Finished difference. Result has 39 places, 19 transitions, 80 flow [2022-12-05 23:11:14,197 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=39, PETRI_TRANSITIONS=19} [2022-12-05 23:11:14,197 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-05 23:11:14,197 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:14,197 INFO L89 Accepts]: Start accepts. Operand has 39 places, 19 transitions, 80 flow [2022-12-05 23:11:14,198 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:14,198 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:14,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 19 transitions, 80 flow [2022-12-05 23:11:14,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 19 transitions, 80 flow [2022-12-05 23:11:14,201 INFO L130 PetriNetUnfolder]: 1/21 cut-off events. [2022-12-05 23:11:14,201 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-05 23:11:14,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 21 events. 1/21 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 21 event pairs, 1 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 47. Up to 7 conditions per place. [2022-12-05 23:11:14,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 19 transitions, 80 flow [2022-12-05 23:11:14,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 23:11:14,241 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:11:14,242 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-05 23:11:14,242 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 18 transitions, 76 flow [2022-12-05 23:11:14,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:14,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:14,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:14,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:11:14,242 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:14,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1645983077, now seen corresponding path program 1 times [2022-12-05 23:11:14,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:14,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268113834] [2022-12-05 23:11:14,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:14,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:11:14,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:14,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268113834] [2022-12-05 23:11:14,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268113834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:14,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:14,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:11:14,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045605238] [2022-12-05 23:11:14,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:14,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:11:14,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:14,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:11:14,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:11:14,375 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:11:14,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 18 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:14,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:14,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:11:14,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:14,430 INFO L130 PetriNetUnfolder]: 158/278 cut-off events. [2022-12-05 23:11:14,430 INFO L131 PetriNetUnfolder]: For 308/308 co-relation queries the response was YES. [2022-12-05 23:11:14,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 278 events. 158/278 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 902 event pairs, 41 based on Foata normal form. 15/293 useless extension candidates. Maximal degree in co-relation 770. Up to 241 conditions per place. [2022-12-05 23:11:14,432 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 24 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2022-12-05 23:11:14,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 28 transitions, 168 flow [2022-12-05 23:11:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:11:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:11:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-05 23:11:14,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2022-12-05 23:11:14,433 INFO L175 Difference]: Start difference. First operand has 36 places, 18 transitions, 76 flow. Second operand 3 states and 29 transitions. [2022-12-05 23:11:14,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 28 transitions, 168 flow [2022-12-05 23:11:14,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 141 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-12-05 23:11:14,435 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 82 flow [2022-12-05 23:11:14,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-05 23:11:14,436 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2022-12-05 23:11:14,436 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:14,436 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 82 flow [2022-12-05 23:11:14,438 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:14,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:14,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 82 flow [2022-12-05 23:11:14,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 82 flow [2022-12-05 23:11:14,442 INFO L130 PetriNetUnfolder]: 19/60 cut-off events. [2022-12-05 23:11:14,443 INFO L131 PetriNetUnfolder]: For 8/11 co-relation queries the response was YES. [2022-12-05 23:11:14,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 60 events. 19/60 cut-off events. For 8/11 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 184 event pairs, 10 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 122. Up to 33 conditions per place. [2022-12-05 23:11:14,443 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 82 flow [2022-12-05 23:11:14,443 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-05 23:11:14,454 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:11:14,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-05 23:11:14,454 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 82 flow [2022-12-05 23:11:14,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:14,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:14,455 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:14,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:11:14,455 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:14,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:14,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1719747946, now seen corresponding path program 1 times [2022-12-05 23:11:14,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:14,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944138959] [2022-12-05 23:11:14,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:14,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:11:14,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:14,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944138959] [2022-12-05 23:11:14,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944138959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:14,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:14,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:11:14,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82446229] [2022-12-05 23:11:14,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:14,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:11:14,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:14,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:11:14,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:11:14,583 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:11:14,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:14,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:14,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:11:14,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:14,634 INFO L130 PetriNetUnfolder]: 68/142 cut-off events. [2022-12-05 23:11:14,634 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-05 23:11:14,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 142 events. 68/142 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 376 event pairs, 17 based on Foata normal form. 17/159 useless extension candidates. Maximal degree in co-relation 419. Up to 65 conditions per place. [2022-12-05 23:11:14,635 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 28 selfloop transitions, 7 changer transitions 0/35 dead transitions. [2022-12-05 23:11:14,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 200 flow [2022-12-05 23:11:14,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:11:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:11:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-05 23:11:14,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:11:14,636 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 82 flow. Second operand 4 states and 36 transitions. [2022-12-05 23:11:14,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 200 flow [2022-12-05 23:11:14,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:11:14,637 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 118 flow [2022-12-05 23:11:14,638 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-05 23:11:14,638 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2022-12-05 23:11:14,638 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:14,638 INFO L89 Accepts]: Start accepts. Operand has 34 places, 24 transitions, 118 flow [2022-12-05 23:11:14,638 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:14,638 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:14,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 118 flow [2022-12-05 23:11:14,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 118 flow [2022-12-05 23:11:14,642 INFO L130 PetriNetUnfolder]: 10/42 cut-off events. [2022-12-05 23:11:14,642 INFO L131 PetriNetUnfolder]: For 17/20 co-relation queries the response was YES. [2022-12-05 23:11:14,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 42 events. 10/42 cut-off events. For 17/20 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 3 based on Foata normal form. 2/43 useless extension candidates. Maximal degree in co-relation 107. Up to 21 conditions per place. [2022-12-05 23:11:14,643 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 118 flow [2022-12-05 23:11:14,643 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-05 23:11:14,644 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:11:14,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 23:11:14,645 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 118 flow [2022-12-05 23:11:14,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:14,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:14,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:14,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:11:14,645 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:14,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:14,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1857263211, now seen corresponding path program 1 times [2022-12-05 23:11:14,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:14,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176203201] [2022-12-05 23:11:14,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:14,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:11:14,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:14,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176203201] [2022-12-05 23:11:14,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176203201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:14,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:14,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:11:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060413987] [2022-12-05 23:11:14,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:14,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:11:14,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:14,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:11:14,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:11:14,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:11:14,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:14,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:14,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:11:14,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:14,818 INFO L130 PetriNetUnfolder]: 48/102 cut-off events. [2022-12-05 23:11:14,819 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-12-05 23:11:14,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 102 events. 48/102 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 243 event pairs, 14 based on Foata normal form. 7/109 useless extension candidates. Maximal degree in co-relation 336. Up to 40 conditions per place. [2022-12-05 23:11:14,819 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 25 selfloop transitions, 10 changer transitions 0/35 dead transitions. [2022-12-05 23:11:14,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 224 flow [2022-12-05 23:11:14,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:11:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:11:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 23:11:14,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-05 23:11:14,820 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 118 flow. Second operand 5 states and 36 transitions. [2022-12-05 23:11:14,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 224 flow [2022-12-05 23:11:14,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 196 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-05 23:11:14,821 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 124 flow [2022-12-05 23:11:14,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2022-12-05 23:11:14,821 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-12-05 23:11:14,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:14,822 INFO L89 Accepts]: Start accepts. Operand has 36 places, 24 transitions, 124 flow [2022-12-05 23:11:14,822 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:14,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:14,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 124 flow [2022-12-05 23:11:14,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 24 transitions, 124 flow [2022-12-05 23:11:14,825 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2022-12-05 23:11:14,825 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-05 23:11:14,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 27 events. 5/27 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 69. Up to 11 conditions per place. [2022-12-05 23:11:14,825 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 124 flow [2022-12-05 23:11:14,825 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-05 23:11:15,530 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:11:15,530 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 709 [2022-12-05 23:11:15,530 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 118 flow [2022-12-05 23:11:15,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:15,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:15,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:15,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:11:15,531 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:15,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:15,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1377604607, now seen corresponding path program 1 times [2022-12-05 23:11:15,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:15,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690480113] [2022-12-05 23:11:15,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:15,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:11:16,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:16,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690480113] [2022-12-05 23:11:16,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690480113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:16,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:16,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:11:16,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043922345] [2022-12-05 23:11:16,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:16,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:11:16,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:16,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:11:16,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:11:16,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 23:11:16,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 118 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:16,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:16,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 23:11:16,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:16,240 INFO L130 PetriNetUnfolder]: 44/99 cut-off events. [2022-12-05 23:11:16,240 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-05 23:11:16,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 99 events. 44/99 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 268 event pairs, 5 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 349. Up to 38 conditions per place. [2022-12-05 23:11:16,241 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 23 selfloop transitions, 5 changer transitions 15/43 dead transitions. [2022-12-05 23:11:16,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 332 flow [2022-12-05 23:11:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:11:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:11:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-12-05 23:11:16,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-05 23:11:16,242 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 118 flow. Second operand 7 states and 30 transitions. [2022-12-05 23:11:16,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 332 flow [2022-12-05 23:11:16,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 276 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-05 23:11:16,244 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 106 flow [2022-12-05 23:11:16,244 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2022-12-05 23:11:16,245 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-05 23:11:16,245 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:16,245 INFO L89 Accepts]: Start accepts. Operand has 37 places, 21 transitions, 106 flow [2022-12-05 23:11:16,247 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:16,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:16,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 21 transitions, 106 flow [2022-12-05 23:11:16,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 21 transitions, 106 flow [2022-12-05 23:11:16,250 INFO L130 PetriNetUnfolder]: 6/28 cut-off events. [2022-12-05 23:11:16,250 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-05 23:11:16,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 28 events. 6/28 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 71. Up to 10 conditions per place. [2022-12-05 23:11:16,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 21 transitions, 106 flow [2022-12-05 23:11:16,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-05 23:11:16,252 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [437] $Ultimate##0-->L785: Formula: (and (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_306 256) 0)) (not (= (mod v_~x$w_buff0_used~0_346 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= v_~x$w_buff0_used~0_346 1) (= v_~x$r_buff0_thd2~0_129 v_~x$r_buff1_thd2~0_103) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_29| |v_P1Thread1of1ForFork0_~arg#1.offset_29|) (= v_~x$r_buff0_thd0~0_116 v_~x$r_buff1_thd0~0_115) (= v_~x$r_buff0_thd2~0_128 1) (= v_~x$r_buff1_thd3~0_91 v_~x$r_buff0_thd3~0_97) (= v_~x$r_buff0_thd1~0_141 v_~x$r_buff1_thd1~0_144) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.base_29| |v_P1Thread1of1ForFork0_#in~arg#1.base_29|) (= v_~x$w_buff0~0_202 1) (= v_~x$w_buff0~0_203 v_~x$w_buff1~0_176) (= v_~y~0_94 1) (= v_~x$w_buff0_used~0_347 v_~x$w_buff1_used~0_306) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_203, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_116, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_97, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_129, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_347} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_202, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_116, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_29|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_176, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_91, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_103, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_306, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_144, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_97, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_128, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_115, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_346, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~y~0=v_~y~0_94} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [438] $Ultimate##0-->L805: Formula: (and (= v_~y~0_99 v_~__unbuffered_p2_EAX~0_45) (= v_~y~0_98 2) (= v_P2Thread1of1ForFork1_~arg.offset_17 |v_P2Thread1of1ForFork1_#in~arg.offset_17|) (= v_P2Thread1of1ForFork1_~arg.base_17 |v_P2Thread1of1ForFork1_#in~arg.base_17|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~y~0=v_~y~0_99} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_17, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~y~0=v_~y~0_98} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-05 23:11:16,687 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [444] L785-->P1EXIT: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd2~0_144 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_436 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_179 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_437 256) 0)))) (.cse4 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_389 256) 0)) .cse1))) (and (= |v_P1Thread1of1ForFork0_#res#1.base_21| 0) (= v_~x$w_buff0_used~0_436 (ite .cse0 0 v_~x$w_buff0_used~0_437)) (= v_~x$r_buff1_thd2~0_143 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_388 256) 0)) .cse1) (and (not (= (mod v_~x$r_buff0_thd2~0_178 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_144)) (= |v_P1Thread1of1ForFork0_#res#1.offset_21| 0) (= v_~__unbuffered_cnt~0_181 (+ v_~__unbuffered_cnt~0_182 1)) (= (ite .cse0 v_~x$w_buff0~0_256 (ite .cse3 v_~x$w_buff1~0_222 v_~x~0_316)) v_~x~0_315) (= v_~x$r_buff0_thd2~0_178 (ite .cse4 0 v_~x$r_buff0_thd2~0_179)) (= (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_389) v_~x$w_buff1_used~0_388)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_256, ~x$w_buff1~0=v_~x$w_buff1~0_222, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_144, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_389, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_182, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_179, ~x~0=v_~x~0_316, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_437} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_256, ~x$w_buff1~0=v_~x$w_buff1~0_222, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_143, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_388, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_178, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_21|, ~x~0=v_~x~0_315, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_436} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#res#1.offset, ~x~0, ~x$w_buff0_used~0] and [441] L834-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_394 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd0~0_136 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_135 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_395 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_351 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5))) (and (= (mod v_~main$tmp_guard0~0_72 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_134 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_350 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_136) v_~x$r_buff1_thd0~0_135) (= v_~x$w_buff0_used~0_394 (ite .cse2 0 v_~x$w_buff0_used~0_395)) (= (ite .cse2 v_~x$w_buff0~0_232 (ite .cse3 v_~x$w_buff1~0_202 v_~x~0_278)) v_~x~0_277) (= v_~x$w_buff1_used~0_350 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_351)) (= v_~main$tmp_guard1~0_40 (ite (= (ite (not (and (= v_~y~0_112 2) (= 2 v_~__unbuffered_p0_EAX~0_63) (= v_~__unbuffered_p2_EAX~0_49 1) (= v_~__unbuffered_p0_EBX~0_86 0))) 1 0) 0) 0 1)) (= v_~main$tmp_guard0~0_72 (ite (= (ite (= v_~__unbuffered_cnt~0_175 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| (mod v_~main$tmp_guard1~0_40 256)) (= (ite .cse4 0 v_~x$r_buff0_thd0~0_135) v_~x$r_buff0_thd0~0_134) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_232, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_135, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_63, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~x$w_buff1~0=v_~x$w_buff1~0_202, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_351, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_136, ~y~0=v_~y~0_112, ~x~0=v_~x~0_278, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_395} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_232, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_69|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_77|, ~x$w_buff1~0=v_~x$w_buff1~0_202, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_72, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_135, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_394, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_63, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_61|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~y~0=v_~y~0_112, ~x~0=v_~x~0_277, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_67|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:11:17,037 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:11:17,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 793 [2022-12-05 23:11:17,038 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 104 flow [2022-12-05 23:11:17,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:17,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:17,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:17,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:11:17,038 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:17,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:17,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1868816424, now seen corresponding path program 1 times [2022-12-05 23:11:17,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:17,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906003636] [2022-12-05 23:11:17,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:11:17,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:11:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:11:17,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:11:17,119 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:11:17,120 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 23:11:17,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 23:11:17,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 23:11:17,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 23:11:17,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 23:11:17,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 23:11:17,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 23:11:17,123 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:17,128 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:11:17,128 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:11:17,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:11:17 BasicIcfg [2022-12-05 23:11:17,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:11:17,191 INFO L158 Benchmark]: Toolchain (without parser) took 11375.00ms. Allocated memory was 183.5MB in the beginning and 463.5MB in the end (delta: 280.0MB). Free memory was 158.7MB in the beginning and 197.3MB in the end (delta: -38.7MB). Peak memory consumption was 242.6MB. Max. memory is 8.0GB. [2022-12-05 23:11:17,194 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:11:17,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.26ms. Allocated memory is still 183.5MB. Free memory was 158.7MB in the beginning and 132.7MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 23:11:17,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.84ms. Allocated memory is still 183.5MB. Free memory was 132.7MB in the beginning and 130.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:11:17,195 INFO L158 Benchmark]: Boogie Preprocessor took 44.12ms. Allocated memory is still 183.5MB. Free memory was 130.1MB in the beginning and 128.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:11:17,195 INFO L158 Benchmark]: RCFGBuilder took 616.08ms. Allocated memory is still 183.5MB. Free memory was 128.5MB in the beginning and 95.5MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-05 23:11:17,195 INFO L158 Benchmark]: TraceAbstraction took 10192.05ms. Allocated memory was 183.5MB in the beginning and 463.5MB in the end (delta: 280.0MB). Free memory was 95.0MB in the beginning and 197.3MB in the end (delta: -102.4MB). Peak memory consumption was 178.7MB. Max. memory is 8.0GB. [2022-12-05 23:11:17,196 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 471.26ms. Allocated memory is still 183.5MB. Free memory was 158.7MB in the beginning and 132.7MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.84ms. Allocated memory is still 183.5MB. Free memory was 132.7MB in the beginning and 130.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.12ms. Allocated memory is still 183.5MB. Free memory was 130.1MB in the beginning and 128.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 616.08ms. Allocated memory is still 183.5MB. Free memory was 128.5MB in the beginning and 95.5MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10192.05ms. Allocated memory was 183.5MB in the beginning and 463.5MB in the end (delta: 280.0MB). Free memory was 95.0MB in the beginning and 197.3MB in the end (delta: -102.4MB). Peak memory consumption was 178.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 112 PlacesBefore, 36 PlacesAfterwards, 104 TransitionsBefore, 27 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1302, independent: 1252, independent conditional: 1252, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1302, independent: 1252, independent conditional: 0, independent unconditional: 1252, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1302, independent: 1252, independent conditional: 0, independent unconditional: 1252, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1302, independent: 1252, independent conditional: 0, independent unconditional: 1252, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1025, independent: 993, independent conditional: 0, independent unconditional: 993, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1025, independent: 982, independent conditional: 0, independent unconditional: 982, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1302, independent: 259, independent conditional: 0, independent unconditional: 259, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 1025, unknown conditional: 0, unknown unconditional: 1025] , Statistics on independence cache: Total cache size (in pairs): 1540, Positive cache size: 1508, Positive conditional cache size: 0, Positive unconditional cache size: 1508, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 151, independent: 110, independent conditional: 11, independent unconditional: 99, dependent: 41, dependent conditional: 6, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, independent: 110, independent conditional: 11, independent unconditional: 99, dependent: 41, dependent conditional: 6, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 110, independent conditional: 11, independent unconditional: 99, dependent: 41, dependent conditional: 6, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 80, independent: 61, independent conditional: 6, independent unconditional: 55, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 80, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 76, dependent conditional: 13, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 151, independent: 49, independent conditional: 5, independent unconditional: 44, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 80, unknown conditional: 8, unknown unconditional: 72] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 62, Positive conditional cache size: 6, Positive unconditional cache size: 56, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 32, independent conditional: 11, independent unconditional: 21, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 32, independent conditional: 8, independent unconditional: 24, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 32, independent conditional: 8, independent unconditional: 24, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, independent: 24, independent conditional: 6, independent unconditional: 18, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 12, unknown conditional: 2, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 70, Positive conditional cache size: 8, Positive unconditional cache size: 62, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 71, Positive conditional cache size: 8, Positive unconditional cache size: 63, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 52, independent conditional: 15, independent unconditional: 37, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 52, independent conditional: 8, independent unconditional: 44, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 52, independent conditional: 8, independent unconditional: 44, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, independent: 52, independent conditional: 8, independent unconditional: 44, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 71, Positive conditional cache size: 8, Positive unconditional cache size: 63, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 71, Positive conditional cache size: 8, Positive unconditional cache size: 63, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 71, Positive conditional cache size: 8, Positive unconditional cache size: 63, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 15, independent conditional: 4, independent unconditional: 11, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 72, Positive conditional cache size: 8, Positive unconditional cache size: 64, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 44 PlacesBefore, 42 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 43, independent conditional: 16, independent unconditional: 27, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 89, Positive conditional cache size: 8, Positive unconditional cache size: 81, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 36 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 60, independent conditional: 20, independent unconditional: 40, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 60, independent conditional: 3, independent unconditional: 57, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 60, independent conditional: 3, independent unconditional: 57, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 2, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 45, independent conditional: 1, independent unconditional: 44, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 18, unknown conditional: 2, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 106, Positive conditional cache size: 10, Positive unconditional cache size: 96, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 15, independent conditional: 6, independent unconditional: 9, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, independent: 12, independent conditional: 1, independent unconditional: 11, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 109, Positive conditional cache size: 12, Positive unconditional cache size: 97, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 35, independent conditional: 18, independent unconditional: 17, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 35, independent conditional: 14, independent unconditional: 21, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 35, independent conditional: 14, independent unconditional: 21, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 30, independent conditional: 12, independent unconditional: 18, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 114, Positive conditional cache size: 14, Positive unconditional cache size: 100, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 36 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 21 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 74, independent: 52, independent conditional: 36, independent unconditional: 16, dependent: 22, dependent conditional: 14, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, independent: 52, independent conditional: 24, independent unconditional: 28, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, independent: 52, independent conditional: 24, independent unconditional: 28, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, independent: 49, independent conditional: 21, independent unconditional: 28, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 130, Positive conditional cache size: 17, Positive unconditional cache size: 113, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 36 PlacesBefore, 33 PlacesAfterwards, 21 TransitionsBefore, 18 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 23, dependent conditional: 9, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 10, unknown conditional: 8, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 159, Positive conditional cache size: 24, Positive unconditional cache size: 135, Negative cache size: 33, Negative conditional cache size: 3, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1828, ((void *)0), P0, ((void *)0))=-2, t1828={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1829, ((void *)0), P1, ((void *)0))=-1, t1828={5:0}, t1829={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1830, ((void *)0), P2, ((void *)0))=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 [L784] 2 y = 1 [L801] 2 __unbuffered_p2_EAX = y [L804] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 __unbuffered_p0_EAX = y [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 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: 10.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 623 IncrementalHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 14 mSDtfsCounter, 623 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=4, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:11:17,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...