/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-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:41:29,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:41:29,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:41:29,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:41:29,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:41:29,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:41:29,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:41:29,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:41:29,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:41:29,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:41:29,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:41:29,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:41:29,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:41:29,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:41:29,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:41:29,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:41:29,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:41:29,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:41:29,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:41:29,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:41:29,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:41:29,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:41:29,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:41:29,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:41:29,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:41:29,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:41:29,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:41:29,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:41:29,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:41:29,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:41:29,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:41:29,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:41:29,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:41:29,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:41:29,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:41:29,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:41:29,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:41:29,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:41:29,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:41:29,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:41:29,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:41:29,357 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-SemanticLbe.epf [2022-12-12 21:41:29,381 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:41:29,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:41:29,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:41:29,382 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:41:29,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:41:29,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:41:29,384 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:41:29,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:41:29,384 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:41:29,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:41:29,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:41:29,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:41:29,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:41:29,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:41:29,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:41:29,385 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:41:29,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:41:29,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:41:29,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:41:29,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:41:29,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:41:29,386 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:41:29,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:41:29,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:41:29,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:41:29,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:41:29,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:41:29,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:41:29,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:41:29,387 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:41:29,387 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:41:29,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:41:29,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:41:29,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:41:29,685 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:41:29,685 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:41:29,686 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2022-12-12 21:41:30,641 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:41:30,878 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:41:30,879 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2022-12-12 21:41:30,894 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417a25327/aad69b494ed04648a56874f054fec5c5/FLAG28fed10c8 [2022-12-12 21:41:30,906 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417a25327/aad69b494ed04648a56874f054fec5c5 [2022-12-12 21:41:30,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:41:30,908 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:41:30,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:41:30,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:41:30,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:41:30,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:41:30" (1/1) ... [2022-12-12 21:41:30,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aec048c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:41:30, skipping insertion in model container [2022-12-12 21:41:30,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:41:30" (1/1) ... [2022-12-12 21:41:30,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:41:30,971 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:41:31,101 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-12 21:41:31,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:41:31,286 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:41:31,295 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-12 21:41:31,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:41:31,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:41:31,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:41:31,381 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:41:31,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:41:31 WrapperNode [2022-12-12 21:41:31,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:41:31,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:41:31,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:41:31,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:41:31,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:41:31" (1/1) ... [2022-12-12 21:41:31,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:41:31" (1/1) ... [2022-12-12 21:41:31,436 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-12 21:41:31,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:41:31,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:41:31,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:41:31,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:41:31,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:41:31" (1/1) ... [2022-12-12 21:41:31,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:41:31" (1/1) ... [2022-12-12 21:41:31,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:41:31" (1/1) ... [2022-12-12 21:41:31,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:41:31" (1/1) ... [2022-12-12 21:41:31,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:41:31" (1/1) ... [2022-12-12 21:41:31,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:41:31" (1/1) ... [2022-12-12 21:41:31,463 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:41:31" (1/1) ... [2022-12-12 21:41:31,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:41:31" (1/1) ... [2022-12-12 21:41:31,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:41:31,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:41:31,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:41:31,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:41:31,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:41:31" (1/1) ... [2022-12-12 21:41:31,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:41:31,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:41:31,495 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-12 21:41:31,520 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-12 21:41:31,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:41:31,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:41:31,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:41:31,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:41:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:41:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:41:31,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:41:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:41:31,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:41:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:41:31,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:41:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:41:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:41:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:41:31,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:41:31,542 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 21:41:31,659 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:41:31,660 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:41:31,899 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:41:31,979 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:41:31,979 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:41:31,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:41:31 BoogieIcfgContainer [2022-12-12 21:41:31,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:41:31,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:41:31,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:41:31,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:41:31,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:41:30" (1/3) ... [2022-12-12 21:41:31,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3e42ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:41:31, skipping insertion in model container [2022-12-12 21:41:31,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:41:31" (2/3) ... [2022-12-12 21:41:31,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3e42ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:41:31, skipping insertion in model container [2022-12-12 21:41:31,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:41:31" (3/3) ... [2022-12-12 21:41:31,986 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2022-12-12 21:41:31,998 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:41:31,998 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:41:31,999 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:41:32,044 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:41:32,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-12 21:41:32,179 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-12 21:41:32,179 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:41:32,184 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 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 21:41:32,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-12 21:41:32,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-12 21:41:32,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:41:32,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-12 21:41:32,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-12 21:41:32,241 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-12 21:41:32,242 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:41:32,243 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 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 21:41:32,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-12 21:41:32,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-12 21:41:39,838 INFO L241 LiptonReduction]: Total number of compositions: 84 [2022-12-12 21:41:39,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:41:39,858 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@330725fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:41:39,859 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 21:41:39,862 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-12 21:41:39,862 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:41:39,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:41:39,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 21:41:39,863 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-12 21:41:39,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:41:39,866 INFO L85 PathProgramCache]: Analyzing trace with hash 462415477, now seen corresponding path program 1 times [2022-12-12 21:41:39,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:41:39,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393180293] [2022-12-12 21:41:39,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:41:39,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:41:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:41:40,198 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-12 21:41:40,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:41:40,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393180293] [2022-12-12 21:41:40,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393180293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:41:40,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:41:40,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:41:40,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138976687] [2022-12-12 21:41:40,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:41:40,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:41:40,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:41:40,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:41:40,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:41:40,229 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 61 [2022-12-12 21:41:40,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-12 21:41:40,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:41:40,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 61 [2022-12-12 21:41:40,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:41:41,490 INFO L130 PetriNetUnfolder]: 7924/12722 cut-off events. [2022-12-12 21:41:41,491 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-12 21:41:41,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24124 conditions, 12722 events. 7924/12722 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 95832 event pairs, 1048 based on Foata normal form. 0/7819 useless extension candidates. Maximal degree in co-relation 24113. Up to 9597 conditions per place. [2022-12-12 21:41:41,528 INFO L137 encePairwiseOnDemand]: 56/61 looper letters, 32 selfloop transitions, 2 changer transitions 52/97 dead transitions. [2022-12-12 21:41:41,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 378 flow [2022-12-12 21:41:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:41:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:41:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2022-12-12 21:41:41,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6775956284153005 [2022-12-12 21:41:41,540 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, 0 predicate places. [2022-12-12 21:41:41,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 97 transitions, 378 flow [2022-12-12 21:41:41,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 45 transitions, 170 flow [2022-12-12 21:41:41,561 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 170 flow [2022-12-12 21:41:41,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-12 21:41:41,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:41:41,561 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:41:41,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:41:41,561 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-12 21:41:41,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:41:41,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1826368940, now seen corresponding path program 1 times [2022-12-12 21:41:41,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:41:41,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501953347] [2022-12-12 21:41:41,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:41:41,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:41:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:41:41,991 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-12 21:41:41,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:41:41,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501953347] [2022-12-12 21:41:41,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501953347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:41:41,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:41:41,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:41:41,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040509648] [2022-12-12 21:41:41,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:41:41,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:41:41,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:41:41,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:41:41,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:41:41,994 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2022-12-12 21:41:41,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-12 21:41:41,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:41:41,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2022-12-12 21:41:41,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:41:42,400 INFO L130 PetriNetUnfolder]: 2818/4334 cut-off events. [2022-12-12 21:41:42,401 INFO L131 PetriNetUnfolder]: For 578/578 co-relation queries the response was YES. [2022-12-12 21:41:42,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11992 conditions, 4334 events. 2818/4334 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 23896 event pairs, 173 based on Foata normal form. 104/3845 useless extension candidates. Maximal degree in co-relation 11978. Up to 3044 conditions per place. [2022-12-12 21:41:42,421 INFO L137 encePairwiseOnDemand]: 50/61 looper letters, 67 selfloop transitions, 17 changer transitions 0/92 dead transitions. [2022-12-12 21:41:42,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 92 transitions, 528 flow [2022-12-12 21:41:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:41:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:41:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-12 21:41:42,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3729508196721312 [2022-12-12 21:41:42,425 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2022-12-12 21:41:42,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 92 transitions, 528 flow [2022-12-12 21:41:42,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 92 transitions, 528 flow [2022-12-12 21:41:42,444 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 92 transitions, 528 flow [2022-12-12 21:41:42,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-12 21:41:42,444 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:41:42,444 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:41:42,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:41:42,444 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-12 21:41:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:41:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash 782861820, now seen corresponding path program 1 times [2022-12-12 21:41:42,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:41:42,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684605284] [2022-12-12 21:41:42,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:41:42,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:41:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:41:42,565 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-12 21:41:42,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:41:42,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684605284] [2022-12-12 21:41:42,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684605284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:41:42,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:41:42,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:41:42,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681237004] [2022-12-12 21:41:42,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:41:42,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:41:42,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:41:42,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:41:42,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:41:42,567 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 61 [2022-12-12 21:41:42,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 92 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-12 21:41:42,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:41:42,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 61 [2022-12-12 21:41:42,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:41:42,875 INFO L130 PetriNetUnfolder]: 2672/4095 cut-off events. [2022-12-12 21:41:42,875 INFO L131 PetriNetUnfolder]: For 1573/1573 co-relation queries the response was YES. [2022-12-12 21:41:42,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14647 conditions, 4095 events. 2672/4095 cut-off events. For 1573/1573 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 21261 event pairs, 206 based on Foata normal form. 34/3560 useless extension candidates. Maximal degree in co-relation 14630. Up to 2897 conditions per place. [2022-12-12 21:41:42,902 INFO L137 encePairwiseOnDemand]: 58/61 looper letters, 99 selfloop transitions, 6 changer transitions 0/121 dead transitions. [2022-12-12 21:41:42,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 121 transitions, 912 flow [2022-12-12 21:41:42,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:41:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:41:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-12 21:41:42,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3551912568306011 [2022-12-12 21:41:42,906 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -21 predicate places. [2022-12-12 21:41:42,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 121 transitions, 912 flow [2022-12-12 21:41:42,926 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 121 transitions, 912 flow [2022-12-12 21:41:42,926 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 121 transitions, 912 flow [2022-12-12 21:41:42,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-12 21:41:42,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:41:42,927 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:41:42,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:41:42,927 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-12 21:41:42,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:41:42,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1502488377, now seen corresponding path program 1 times [2022-12-12 21:41:42,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:41:42,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652218053] [2022-12-12 21:41:42,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:41:42,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:41:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:41:43,105 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-12 21:41:43,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:41:43,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652218053] [2022-12-12 21:41:43,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652218053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:41:43,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:41:43,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:41:43,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509308689] [2022-12-12 21:41:43,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:41:43,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:41:43,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:41:43,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:41:43,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:41:43,109 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 61 [2022-12-12 21:41:43,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 121 transitions, 912 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-12 21:41:43,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:41:43,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 61 [2022-12-12 21:41:43,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:41:43,972 INFO L130 PetriNetUnfolder]: 5903/9212 cut-off events. [2022-12-12 21:41:43,972 INFO L131 PetriNetUnfolder]: For 4156/4156 co-relation queries the response was YES. [2022-12-12 21:41:43,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40998 conditions, 9212 events. 5903/9212 cut-off events. For 4156/4156 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 58030 event pairs, 551 based on Foata normal form. 250/7988 useless extension candidates. Maximal degree in co-relation 40978. Up to 6851 conditions per place. [2022-12-12 21:41:44,014 INFO L137 encePairwiseOnDemand]: 57/61 looper letters, 130 selfloop transitions, 9 changer transitions 71/220 dead transitions. [2022-12-12 21:41:44,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 220 transitions, 2099 flow [2022-12-12 21:41:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:41:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:41:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-12-12 21:41:44,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3836065573770492 [2022-12-12 21:41:44,017 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -17 predicate places. [2022-12-12 21:41:44,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 220 transitions, 2099 flow [2022-12-12 21:41:44,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 149 transitions, 1413 flow [2022-12-12 21:41:44,049 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 149 transitions, 1413 flow [2022-12-12 21:41:44,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-12 21:41:44,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:41:44,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:41:44,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:41:44,049 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-12 21:41:44,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:41:44,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1501000377, now seen corresponding path program 2 times [2022-12-12 21:41:44,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:41:44,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398837544] [2022-12-12 21:41:44,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:41:44,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:41:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:41:44,427 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-12 21:41:44,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:41:44,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398837544] [2022-12-12 21:41:44,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398837544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:41:44,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:41:44,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:41:44,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343010776] [2022-12-12 21:41:44,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:41:44,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:41:44,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:41:44,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:41:44,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:41:44,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2022-12-12 21:41:44,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 149 transitions, 1413 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-12 21:41:44,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:41:44,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2022-12-12 21:41:44,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:41:44,873 INFO L130 PetriNetUnfolder]: 3285/5146 cut-off events. [2022-12-12 21:41:44,874 INFO L131 PetriNetUnfolder]: For 2034/2034 co-relation queries the response was YES. [2022-12-12 21:41:44,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27894 conditions, 5146 events. 3285/5146 cut-off events. For 2034/2034 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 28997 event pairs, 78 based on Foata normal form. 54/4383 useless extension candidates. Maximal degree in co-relation 27871. Up to 3860 conditions per place. [2022-12-12 21:41:44,908 INFO L137 encePairwiseOnDemand]: 51/61 looper letters, 166 selfloop transitions, 27 changer transitions 0/201 dead transitions. [2022-12-12 21:41:44,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 201 transitions, 2295 flow [2022-12-12 21:41:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:41:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:41:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-12 21:41:44,909 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3442622950819672 [2022-12-12 21:41:44,910 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -16 predicate places. [2022-12-12 21:41:44,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 201 transitions, 2295 flow [2022-12-12 21:41:44,937 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 201 transitions, 2295 flow [2022-12-12 21:41:44,938 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 201 transitions, 2295 flow [2022-12-12 21:41:44,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-12 21:41:44,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:41:44,938 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:41:44,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:41:44,938 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-12 21:41:44,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:41:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash 713599267, now seen corresponding path program 1 times [2022-12-12 21:41:44,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:41:44,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482225298] [2022-12-12 21:41:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:41:44,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:41:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:41:45,057 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-12 21:41:45,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:41:45,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482225298] [2022-12-12 21:41:45,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482225298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:41:45,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:41:45,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:41:45,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527564774] [2022-12-12 21:41:45,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:41:45,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:41:45,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:41:45,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:41:45,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:41:45,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 61 [2022-12-12 21:41:45,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 201 transitions, 2295 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-12 21:41:45,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:41:45,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 61 [2022-12-12 21:41:45,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:41:45,692 INFO L130 PetriNetUnfolder]: 4699/7408 cut-off events. [2022-12-12 21:41:45,692 INFO L131 PetriNetUnfolder]: For 3388/3388 co-relation queries the response was YES. [2022-12-12 21:41:45,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46466 conditions, 7408 events. 4699/7408 cut-off events. For 3388/3388 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 45992 event pairs, 41 based on Foata normal form. 216/6413 useless extension candidates. Maximal degree in co-relation 46440. Up to 5741 conditions per place. [2022-12-12 21:41:45,727 INFO L137 encePairwiseOnDemand]: 56/61 looper letters, 122 selfloop transitions, 6 changer transitions 129/269 dead transitions. [2022-12-12 21:41:45,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 269 transitions, 3613 flow [2022-12-12 21:41:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:41:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:41:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-12 21:41:45,729 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35655737704918034 [2022-12-12 21:41:45,730 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -13 predicate places. [2022-12-12 21:41:45,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 269 transitions, 3613 flow [2022-12-12 21:41:45,754 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 140 transitions, 1839 flow [2022-12-12 21:41:45,755 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 140 transitions, 1839 flow [2022-12-12 21:41:45,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-12 21:41:45,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:41:45,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:41:45,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:41:45,755 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-12 21:41:45,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:41:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1859106638, now seen corresponding path program 1 times [2022-12-12 21:41:45,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:41:45,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333989678] [2022-12-12 21:41:45,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:41:45,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:41:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:41:46,066 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-12 21:41:46,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:41:46,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333989678] [2022-12-12 21:41:46,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333989678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:41:46,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:41:46,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:41:46,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089683568] [2022-12-12 21:41:46,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:41:46,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:41:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:41:46,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:41:46,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:41:46,069 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 61 [2022-12-12 21:41:46,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 140 transitions, 1839 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-12 21:41:46,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:41:46,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 61 [2022-12-12 21:41:46,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:41:46,495 INFO L130 PetriNetUnfolder]: 2424/3819 cut-off events. [2022-12-12 21:41:46,495 INFO L131 PetriNetUnfolder]: For 2481/2481 co-relation queries the response was YES. [2022-12-12 21:41:46,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27505 conditions, 3819 events. 2424/3819 cut-off events. For 2481/2481 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 20581 event pairs, 27 based on Foata normal form. 3/3187 useless extension candidates. Maximal degree in co-relation 27476. Up to 3272 conditions per place. [2022-12-12 21:41:46,514 INFO L137 encePairwiseOnDemand]: 55/61 looper letters, 155 selfloop transitions, 21 changer transitions 0/189 dead transitions. [2022-12-12 21:41:46,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 189 transitions, 2849 flow [2022-12-12 21:41:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:41:46,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:41:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-12 21:41:46,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3319672131147541 [2022-12-12 21:41:46,515 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -10 predicate places. [2022-12-12 21:41:46,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 189 transitions, 2849 flow [2022-12-12 21:41:46,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 189 transitions, 2849 flow [2022-12-12 21:41:46,532 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 189 transitions, 2849 flow [2022-12-12 21:41:46,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-12 21:41:46,532 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:41:46,532 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:41:46,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:41:46,532 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-12 21:41:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:41:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1652954321, now seen corresponding path program 1 times [2022-12-12 21:41:46,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:41:46,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120681874] [2022-12-12 21:41:46,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:41:46,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:41:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:41:46,621 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-12 21:41:46,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:41:46,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120681874] [2022-12-12 21:41:46,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120681874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:41:46,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:41:46,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:41:46,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467148529] [2022-12-12 21:41:46,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:41:46,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:41:46,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:41:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:41:46,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:41:46,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 61 [2022-12-12 21:41:46,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 189 transitions, 2849 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-12 21:41:46,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:41:46,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 61 [2022-12-12 21:41:46,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:41:47,034 INFO L130 PetriNetUnfolder]: 2884/4565 cut-off events. [2022-12-12 21:41:47,034 INFO L131 PetriNetUnfolder]: For 3110/3110 co-relation queries the response was YES. [2022-12-12 21:41:47,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36971 conditions, 4565 events. 2884/4565 cut-off events. For 3110/3110 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 25687 event pairs, 162 based on Foata normal form. 79/3841 useless extension candidates. Maximal degree in co-relation 36939. Up to 3968 conditions per place. [2022-12-12 21:41:47,059 INFO L137 encePairwiseOnDemand]: 57/61 looper letters, 135 selfloop transitions, 8 changer transitions 42/202 dead transitions. [2022-12-12 21:41:47,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 202 transitions, 3427 flow [2022-12-12 21:41:47,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:41:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:41:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-12 21:41:47,060 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3729508196721312 [2022-12-12 21:41:47,062 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2022-12-12 21:41:47,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 202 transitions, 3427 flow [2022-12-12 21:41:47,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 160 transitions, 2677 flow [2022-12-12 21:41:47,082 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 160 transitions, 2677 flow [2022-12-12 21:41:47,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-12 21:41:47,082 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:41:47,082 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:41:47,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:41:47,082 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-12 21:41:47,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:41:47,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1911442688, now seen corresponding path program 1 times [2022-12-12 21:41:47,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:41:47,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351788538] [2022-12-12 21:41:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:41:47,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:41:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:41:47,204 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-12 21:41:47,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:41:47,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351788538] [2022-12-12 21:41:47,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351788538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:41:47,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:41:47,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:41:47,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787549233] [2022-12-12 21:41:47,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:41:47,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:41:47,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:41:47,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:41:47,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:41:47,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2022-12-12 21:41:47,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 160 transitions, 2677 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-12 21:41:47,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:41:47,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2022-12-12 21:41:47,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:41:47,760 INFO L130 PetriNetUnfolder]: 3777/5828 cut-off events. [2022-12-12 21:41:47,760 INFO L131 PetriNetUnfolder]: For 29220/29598 co-relation queries the response was YES. [2022-12-12 21:41:47,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49212 conditions, 5828 events. 3777/5828 cut-off events. For 29220/29598 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 33330 event pairs, 338 based on Foata normal form. 491/5397 useless extension candidates. Maximal degree in co-relation 49177. Up to 4687 conditions per place. [2022-12-12 21:41:47,800 INFO L137 encePairwiseOnDemand]: 49/61 looper letters, 144 selfloop transitions, 38 changer transitions 142/342 dead transitions. [2022-12-12 21:41:47,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 342 transitions, 6472 flow [2022-12-12 21:41:47,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:41:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:41:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-12 21:41:47,802 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.380327868852459 [2022-12-12 21:41:47,802 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2022-12-12 21:41:47,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 342 transitions, 6472 flow [2022-12-12 21:41:47,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 200 transitions, 3728 flow [2022-12-12 21:41:47,834 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 200 transitions, 3728 flow [2022-12-12 21:41:47,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-12 21:41:47,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:41:47,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:41:47,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:41:47,835 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-12 21:41:47,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:41:47,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1506386591, now seen corresponding path program 1 times [2022-12-12 21:41:47,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:41:47,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8300609] [2022-12-12 21:41:47,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:41:47,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:41:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:41:47,938 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-12 21:41:47,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:41:47,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8300609] [2022-12-12 21:41:47,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8300609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:41:47,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:41:47,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:41:47,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150898443] [2022-12-12 21:41:47,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:41:47,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:41:47,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:41:47,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:41:47,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:41:47,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2022-12-12 21:41:47,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 200 transitions, 3728 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-12 21:41:47,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:41:47,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2022-12-12 21:41:47,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:41:48,364 INFO L130 PetriNetUnfolder]: 2248/3806 cut-off events. [2022-12-12 21:41:48,364 INFO L131 PetriNetUnfolder]: For 16150/16326 co-relation queries the response was YES. [2022-12-12 21:41:48,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35710 conditions, 3806 events. 2248/3806 cut-off events. For 16150/16326 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 23038 event pairs, 163 based on Foata normal form. 485/3722 useless extension candidates. Maximal degree in co-relation 35672. Up to 3326 conditions per place. [2022-12-12 21:41:48,386 INFO L137 encePairwiseOnDemand]: 49/61 looper letters, 133 selfloop transitions, 69 changer transitions 85/305 dead transitions. [2022-12-12 21:41:48,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 305 transitions, 6261 flow [2022-12-12 21:41:48,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:41:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:41:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2022-12-12 21:41:48,387 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3797814207650273 [2022-12-12 21:41:48,388 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2022-12-12 21:41:48,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 305 transitions, 6261 flow [2022-12-12 21:41:48,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 220 transitions, 4487 flow [2022-12-12 21:41:48,405 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 220 transitions, 4487 flow [2022-12-12 21:41:48,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-12 21:41:48,405 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:41:48,405 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:41:48,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:41:48,405 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-12 21:41:48,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:41:48,406 INFO L85 PathProgramCache]: Analyzing trace with hash -187430302, now seen corresponding path program 1 times [2022-12-12 21:41:48,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:41:48,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957537048] [2022-12-12 21:41:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:41:48,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:41:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:41:48,573 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-12 21:41:48,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:41:48,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957537048] [2022-12-12 21:41:48,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957537048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:41:48,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:41:48,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:41:48,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442120532] [2022-12-12 21:41:48,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:41:48,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:41:48,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:41:48,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:41:48,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:41:48,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2022-12-12 21:41:48,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 220 transitions, 4487 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-12 21:41:48,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:41:48,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2022-12-12 21:41:48,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:41:48,863 INFO L130 PetriNetUnfolder]: 1094/2050 cut-off events. [2022-12-12 21:41:48,863 INFO L131 PetriNetUnfolder]: For 10693/10819 co-relation queries the response was YES. [2022-12-12 21:41:48,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21080 conditions, 2050 events. 1094/2050 cut-off events. For 10693/10819 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 12108 event pairs, 25 based on Foata normal form. 286/2017 useless extension candidates. Maximal degree in co-relation 21039. Up to 1715 conditions per place. [2022-12-12 21:41:48,875 INFO L137 encePairwiseOnDemand]: 49/61 looper letters, 109 selfloop transitions, 84 changer transitions 30/241 dead transitions. [2022-12-12 21:41:48,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 241 transitions, 5347 flow [2022-12-12 21:41:48,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:41:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:41:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2022-12-12 21:41:48,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3091334894613583 [2022-12-12 21:41:48,877 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, 3 predicate places. [2022-12-12 21:41:48,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 241 transitions, 5347 flow [2022-12-12 21:41:48,888 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 211 transitions, 4675 flow [2022-12-12 21:41:48,888 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 211 transitions, 4675 flow [2022-12-12 21:41:48,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-12 21:41:48,888 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:41:48,888 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:41:48,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:41:48,888 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-12 21:41:48,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:41:48,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1719143778, now seen corresponding path program 1 times [2022-12-12 21:41:48,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:41:48,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289739861] [2022-12-12 21:41:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:41:48,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:41:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:41:49,368 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-12 21:41:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:41:49,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289739861] [2022-12-12 21:41:49,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289739861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:41:49,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:41:49,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:41:49,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601630961] [2022-12-12 21:41:49,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:41:49,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:41:49,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:41:49,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:41:49,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:41:49,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 61 [2022-12-12 21:41:49,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 211 transitions, 4675 flow. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-12 21:41:49,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:41:49,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 61 [2022-12-12 21:41:49,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:41:49,696 INFO L130 PetriNetUnfolder]: 1366/2556 cut-off events. [2022-12-12 21:41:49,697 INFO L131 PetriNetUnfolder]: For 17337/17428 co-relation queries the response was YES. [2022-12-12 21:41:49,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28297 conditions, 2556 events. 1366/2556 cut-off events. For 17337/17428 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 15909 event pairs, 0 based on Foata normal form. 75/2165 useless extension candidates. Maximal degree in co-relation 28253. Up to 2193 conditions per place. [2022-12-12 21:41:49,798 INFO L137 encePairwiseOnDemand]: 55/61 looper letters, 244 selfloop transitions, 40 changer transitions 19/321 dead transitions. [2022-12-12 21:41:49,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 321 transitions, 7930 flow [2022-12-12 21:41:49,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:41:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:41:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-12 21:41:49,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31475409836065577 [2022-12-12 21:41:49,800 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, 5 predicate places. [2022-12-12 21:41:49,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 321 transitions, 7930 flow [2022-12-12 21:41:49,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 302 transitions, 7436 flow [2022-12-12 21:41:49,817 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 302 transitions, 7436 flow [2022-12-12 21:41:49,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-12 21:41:49,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:41:49,817 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:41:49,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 21:41:49,817 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-12 21:41:49,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:41:49,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2078211994, now seen corresponding path program 2 times [2022-12-12 21:41:49,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:41:49,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365426224] [2022-12-12 21:41:49,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:41:49,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:41:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:41:51,077 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-12 21:41:51,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:41:51,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365426224] [2022-12-12 21:41:51,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365426224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:41:51,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:41:51,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 21:41:51,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703196809] [2022-12-12 21:41:51,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:41:51,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 21:41:51,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:41:51,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 21:41:51,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-12 21:41:51,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2022-12-12 21:41:51,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 302 transitions, 7436 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-12 21:41:51,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:41:51,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2022-12-12 21:41:51,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:41:51,904 INFO L130 PetriNetUnfolder]: 2017/4032 cut-off events. [2022-12-12 21:41:51,904 INFO L131 PetriNetUnfolder]: For 25740/25859 co-relation queries the response was YES. [2022-12-12 21:41:51,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46348 conditions, 4032 events. 2017/4032 cut-off events. For 25740/25859 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 30354 event pairs, 0 based on Foata normal form. 108/3332 useless extension candidates. Maximal degree in co-relation 46301. Up to 3604 conditions per place. [2022-12-12 21:41:51,924 INFO L137 encePairwiseOnDemand]: 52/61 looper letters, 213 selfloop transitions, 19 changer transitions 254/500 dead transitions. [2022-12-12 21:41:51,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 500 transitions, 13460 flow [2022-12-12 21:41:51,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:41:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:41:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2022-12-12 21:41:51,952 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3255269320843091 [2022-12-12 21:41:51,953 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, 11 predicate places. [2022-12-12 21:41:51,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 500 transitions, 13460 flow [2022-12-12 21:41:51,968 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 246 transitions, 6480 flow [2022-12-12 21:41:51,968 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 246 transitions, 6480 flow [2022-12-12 21:41:51,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-12 21:41:51,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:41:51,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:41:51,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 21:41:51,969 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-12 21:41:51,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:41:51,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1455629432, now seen corresponding path program 3 times [2022-12-12 21:41:51,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:41:51,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210217997] [2022-12-12 21:41:51,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:41:51,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:41:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:41:51,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:41:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:41:52,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:41:52,038 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:41:52,039 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 21:41:52,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 21:41:52,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 21:41:52,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 21:41:52,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 21:41:52,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 21:41:52,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 21:41:52,041 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:41:52,045 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:41:52,045 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:41:52,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:41:52 BasicIcfg [2022-12-12 21:41:52,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:41:52,091 INFO L158 Benchmark]: Toolchain (without parser) took 21183.18ms. Allocated memory was 188.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 164.6MB in the beginning and 825.6MB in the end (delta: -661.0MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-12 21:41:52,091 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 165.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:41:52,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.48ms. Allocated memory is still 188.7MB. Free memory was 164.6MB in the beginning and 137.9MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 21:41:52,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.76ms. Allocated memory is still 188.7MB. Free memory was 137.9MB in the beginning and 134.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 21:41:52,092 INFO L158 Benchmark]: Boogie Preprocessor took 28.72ms. Allocated memory is still 188.7MB. Free memory was 134.7MB in the beginning and 133.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:41:52,092 INFO L158 Benchmark]: RCFGBuilder took 514.83ms. Allocated memory is still 188.7MB. Free memory was 133.2MB in the beginning and 97.0MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-12 21:41:52,092 INFO L158 Benchmark]: TraceAbstraction took 20108.34ms. Allocated memory was 188.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 95.9MB in the beginning and 825.6MB in the end (delta: -729.7MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-12-12 21:41:52,093 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.09ms. Allocated memory is still 188.7MB. Free memory is still 165.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 471.48ms. Allocated memory is still 188.7MB. Free memory was 164.6MB in the beginning and 137.9MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.76ms. Allocated memory is still 188.7MB. Free memory was 137.9MB in the beginning and 134.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.72ms. Allocated memory is still 188.7MB. Free memory was 134.7MB in the beginning and 133.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 514.83ms. Allocated memory is still 188.7MB. Free memory was 133.2MB in the beginning and 97.0MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 20108.34ms. Allocated memory was 188.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 95.9MB in the beginning and 825.6MB in the end (delta: -729.7MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6s, 112 PlacesBefore, 70 PlacesAfterwards, 104 TransitionsBefore, 61 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 4 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2790, independent: 2669, independent conditional: 2669, independent unconditional: 0, dependent: 121, dependent conditional: 121, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2790, independent: 2669, independent conditional: 0, independent unconditional: 2669, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2790, independent: 2669, independent conditional: 0, independent unconditional: 2669, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2790, independent: 2669, independent conditional: 0, independent unconditional: 2669, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1854, independent: 1796, independent conditional: 0, independent unconditional: 1796, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1854, independent: 1764, independent conditional: 0, independent unconditional: 1764, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 357, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 288, dependent conditional: 0, dependent unconditional: 288, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2790, independent: 873, independent conditional: 0, independent unconditional: 873, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 1854, unknown conditional: 0, unknown unconditional: 1854] , Statistics on independence cache: Total cache size (in pairs): 3309, Positive cache size: 3251, Positive conditional cache size: 0, Positive unconditional cache size: 3251, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1876, ((void *)0), P0, ((void *)0))=-1, t1876={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] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1877, ((void *)0), P1, ((void *)0))=0, t1876={5:0}, t1877={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] [L822] 0 pthread_t t1878; [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1878, ((void *)0), P2, ((void *)0))=1, t1876={5:0}, t1877={6:0}, t1878={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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 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) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 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 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 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_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 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) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 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 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 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) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 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 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 819]: 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: 823]: 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, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.3s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 470 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 470 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1313 IncrementalHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 24 mSDtfsCounter, 1313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7436occurred in iteration=12, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 16082 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 1664 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-12 21:41:52,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...