/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:37:43,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:37:43,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:37:43,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:37:43,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:37:43,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:37:43,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:37:43,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:37:43,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:37:43,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:37:43,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:37:43,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:37:43,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:37:43,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:37:43,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:37:43,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:37:43,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:37:43,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:37:43,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:37:43,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:37:43,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:37:43,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:37:43,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:37:43,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:37:43,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:37:43,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:37:43,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:37:43,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:37:43,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:37:43,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:37:43,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:37:43,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:37:43,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:37:43,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:37:43,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:37:43,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:37:43,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:37:43,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:37:43,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:37:43,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:37:43,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:37:43,334 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 18:37:43,353 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:37:43,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:37:43,354 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:37:43,354 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:37:43,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:37:43,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:37:43,354 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:37:43,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:37:43,355 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:37:43,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:37:43,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:37:43,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:37:43,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:37:43,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:37:43,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:37:43,355 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:37:43,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:37:43,356 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:37:43,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:37:43,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:37:43,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:37:43,356 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:37:43,356 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:37:43,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:37:43,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:37:43,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:37:43,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:37:43,357 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:37:43,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:37:43,357 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:37:43,357 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 [2022-12-12 18:37:43,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:37:43,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:37:43,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:37:43,638 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:37:43,638 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:37:43,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2022-12-12 18:37:44,566 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:37:44,833 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:37:44,833 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044.opt.i [2022-12-12 18:37:44,851 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e8b75385/b090d617045345bea8db9a2330ecfd57/FLAG8eda20c50 [2022-12-12 18:37:44,863 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e8b75385/b090d617045345bea8db9a2330ecfd57 [2022-12-12 18:37:44,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:37:44,865 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:37:44,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:37:44,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:37:44,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:37:44,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:37:44" (1/1) ... [2022-12-12 18:37:44,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1320f1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:37:44, skipping insertion in model container [2022-12-12 18:37:44,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:37:44" (1/1) ... [2022-12-12 18:37:44,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:37:44,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:37:45,006 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/mix044.opt.i[944,957] [2022-12-12 18:37:45,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:37:45,170 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:37:45,181 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/mix044.opt.i[944,957] [2022-12-12 18:37:45,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:37:45,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:37:45,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:37:45,290 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:37:45,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:37:45 WrapperNode [2022-12-12 18:37:45,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:37:45,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:37:45,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:37:45,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:37:45,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:37:45" (1/1) ... [2022-12-12 18:37:45,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:37:45" (1/1) ... [2022-12-12 18:37:45,362 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2022-12-12 18:37:45,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:37:45,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:37:45,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:37:45,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:37:45,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:37:45" (1/1) ... [2022-12-12 18:37:45,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:37:45" (1/1) ... [2022-12-12 18:37:45,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:37:45" (1/1) ... [2022-12-12 18:37:45,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:37:45" (1/1) ... [2022-12-12 18:37:45,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:37:45" (1/1) ... [2022-12-12 18:37:45,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:37:45" (1/1) ... [2022-12-12 18:37:45,405 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:37:45" (1/1) ... [2022-12-12 18:37:45,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:37:45" (1/1) ... [2022-12-12 18:37:45,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:37:45,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:37:45,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:37:45,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:37:45,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:37:45" (1/1) ... [2022-12-12 18:37:45,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:37:45,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:37:45,477 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 18:37:45,545 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 18:37:45,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:37:45,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:37:45,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:37:45,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:37:45,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:37:45,572 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:37:45,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:37:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:37:45,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:37:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:37:45,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:37:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 18:37:45,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 18:37:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:37:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:37:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:37:45,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:37:45,574 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 18:37:45,670 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:37:45,672 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:37:46,029 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:37:46,210 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:37:46,210 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:37:46,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:37:46 BoogieIcfgContainer [2022-12-12 18:37:46,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:37:46,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:37:46,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:37:46,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:37:46,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:37:44" (1/3) ... [2022-12-12 18:37:46,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446e007f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:37:46, skipping insertion in model container [2022-12-12 18:37:46,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:37:45" (2/3) ... [2022-12-12 18:37:46,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446e007f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:37:46, skipping insertion in model container [2022-12-12 18:37:46,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:37:46" (3/3) ... [2022-12-12 18:37:46,218 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2022-12-12 18:37:46,248 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:37:46,249 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:37:46,249 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:37:46,318 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:37:46,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-12 18:37:46,412 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-12 18:37:46,412 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:37:46,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-12 18:37:46,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-12 18:37:46,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-12 18:37:46,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:37:46,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-12 18:37:46,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-12 18:37:46,493 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-12 18:37:46,493 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:37:46,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-12 18:37:46,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-12 18:37:46,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 2936 [2022-12-12 18:37:55,622 INFO L241 LiptonReduction]: Total number of compositions: 102 [2022-12-12 18:37:55,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:37:55,637 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;@2d25ff3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:37:55,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 18:37:55,641 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-12 18:37:55,641 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:37:55,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:37:55,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:37:55,642 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:37:55,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:37:55,645 INFO L85 PathProgramCache]: Analyzing trace with hash -564451010, now seen corresponding path program 1 times [2022-12-12 18:37:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:37:55,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618469258] [2022-12-12 18:37:55,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:37:55,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:37:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:37:56,037 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 18:37:56,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:37:56,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618469258] [2022-12-12 18:37:56,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618469258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:37:56,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:37:56,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:37:56,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441163649] [2022-12-12 18:37:56,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:37:56,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:37:56,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:37:56,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:37:56,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:37:56,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 66 [2022-12-12 18:37:56,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 66 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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 18:37:56,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:37:56,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 66 [2022-12-12 18:37:56,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:01,993 INFO L130 PetriNetUnfolder]: 49367/69927 cut-off events. [2022-12-12 18:38:01,993 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-12 18:38:02,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135383 conditions, 69927 events. 49367/69927 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 4112. Compared 535437 event pairs, 5495 based on Foata normal form. 0/40880 useless extension candidates. Maximal degree in co-relation 135371. Up to 57313 conditions per place. [2022-12-12 18:38:02,232 INFO L137 encePairwiseOnDemand]: 61/66 looper letters, 37 selfloop transitions, 3 changer transitions 48/101 dead transitions. [2022-12-12 18:38:02,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 101 transitions, 390 flow [2022-12-12 18:38:02,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:38:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:38:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2022-12-12 18:38:02,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6565656565656566 [2022-12-12 18:38:02,245 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 0 predicate places. [2022-12-12 18:38:02,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 101 transitions, 390 flow [2022-12-12 18:38:02,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 53 transitions, 198 flow [2022-12-12 18:38:02,464 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 198 flow [2022-12-12 18:38:02,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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 18:38:02,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:02,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:02,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:38:02,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:02,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:02,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1271480904, now seen corresponding path program 1 times [2022-12-12 18:38:02,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:02,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339016352] [2022-12-12 18:38:02,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:02,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:02,668 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 18:38:02,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:02,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339016352] [2022-12-12 18:38:02,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339016352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:02,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:02,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:38:02,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891633820] [2022-12-12 18:38:02,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:02,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:38:02,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:02,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:38:02,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:38:02,671 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 66 [2022-12-12 18:38:02,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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 18:38:02,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:02,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 66 [2022-12-12 18:38:02,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:03,189 INFO L130 PetriNetUnfolder]: 6143/9023 cut-off events. [2022-12-12 18:38:03,189 INFO L131 PetriNetUnfolder]: For 378/420 co-relation queries the response was YES. [2022-12-12 18:38:03,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25920 conditions, 9023 events. 6143/9023 cut-off events. For 378/420 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 55530 event pairs, 1135 based on Foata normal form. 240/7152 useless extension candidates. Maximal degree in co-relation 25905. Up to 7009 conditions per place. [2022-12-12 18:38:03,238 INFO L137 encePairwiseOnDemand]: 63/66 looper letters, 48 selfloop transitions, 2 changer transitions 1/64 dead transitions. [2022-12-12 18:38:03,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 344 flow [2022-12-12 18:38:03,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:38:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:38:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-12-12 18:38:03,240 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.398989898989899 [2022-12-12 18:38:03,240 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2022-12-12 18:38:03,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 64 transitions, 344 flow [2022-12-12 18:38:03,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 63 transitions, 338 flow [2022-12-12 18:38:03,273 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 63 transitions, 338 flow [2022-12-12 18:38:03,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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 18:38:03,273 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:03,273 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:03,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:38:03,273 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:03,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:03,274 INFO L85 PathProgramCache]: Analyzing trace with hash -2122454545, now seen corresponding path program 1 times [2022-12-12 18:38:03,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:03,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982362325] [2022-12-12 18:38:03,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:03,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:03,968 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 18:38:03,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:03,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982362325] [2022-12-12 18:38:03,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982362325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:03,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:03,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:38:03,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125579182] [2022-12-12 18:38:03,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:03,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:38:03,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:03,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:38:03,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:38:03,971 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 66 [2022-12-12 18:38:03,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 63 transitions, 338 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 18:38:03,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:03,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 66 [2022-12-12 18:38:03,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:05,054 INFO L130 PetriNetUnfolder]: 8359/12253 cut-off events. [2022-12-12 18:38:05,055 INFO L131 PetriNetUnfolder]: For 2357/2357 co-relation queries the response was YES. [2022-12-12 18:38:05,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44287 conditions, 12253 events. 8359/12253 cut-off events. For 2357/2357 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 74354 event pairs, 1211 based on Foata normal form. 4/9981 useless extension candidates. Maximal degree in co-relation 44269. Up to 11173 conditions per place. [2022-12-12 18:38:05,214 INFO L137 encePairwiseOnDemand]: 59/66 looper letters, 70 selfloop transitions, 10 changer transitions 0/91 dead transitions. [2022-12-12 18:38:05,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 659 flow [2022-12-12 18:38:05,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:38:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:38:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-12 18:38:05,216 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-12 18:38:05,216 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -20 predicate places. [2022-12-12 18:38:05,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 91 transitions, 659 flow [2022-12-12 18:38:05,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 91 transitions, 659 flow [2022-12-12 18:38:05,275 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 91 transitions, 659 flow [2022-12-12 18:38:05,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 18:38:05,275 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:05,275 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:05,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:38:05,276 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:05,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:05,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1371649974, now seen corresponding path program 1 times [2022-12-12 18:38:05,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:05,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813106546] [2022-12-12 18:38:05,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:05,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:05,680 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 18:38:05,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:05,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813106546] [2022-12-12 18:38:05,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813106546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:05,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:05,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:38:05,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421733765] [2022-12-12 18:38:05,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:05,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:38:05,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:05,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:38:05,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:38:05,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 66 [2022-12-12 18:38:05,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 91 transitions, 659 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 18:38:05,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:05,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 66 [2022-12-12 18:38:05,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:06,572 INFO L130 PetriNetUnfolder]: 8233/12091 cut-off events. [2022-12-12 18:38:06,572 INFO L131 PetriNetUnfolder]: For 3757/3757 co-relation queries the response was YES. [2022-12-12 18:38:06,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54234 conditions, 12091 events. 8233/12091 cut-off events. For 3757/3757 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 73144 event pairs, 413 based on Foata normal form. 36/9869 useless extension candidates. Maximal degree in co-relation 54213. Up to 11011 conditions per place. [2022-12-12 18:38:06,670 INFO L137 encePairwiseOnDemand]: 61/66 looper letters, 100 selfloop transitions, 9 changer transitions 0/123 dead transitions. [2022-12-12 18:38:06,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 123 transitions, 1128 flow [2022-12-12 18:38:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:38:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:38:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2022-12-12 18:38:06,673 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38257575757575757 [2022-12-12 18:38:06,675 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -17 predicate places. [2022-12-12 18:38:06,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 123 transitions, 1128 flow [2022-12-12 18:38:06,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 123 transitions, 1128 flow [2022-12-12 18:38:06,751 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 123 transitions, 1128 flow [2022-12-12 18:38:06,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 18:38:06,751 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:06,751 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:06,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:38:06,751 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:06,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1859382080, now seen corresponding path program 1 times [2022-12-12 18:38:06,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:06,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946996605] [2022-12-12 18:38:06,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:06,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:07,371 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 18:38:07,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:07,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946996605] [2022-12-12 18:38:07,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946996605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:07,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:07,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:38:07,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998887838] [2022-12-12 18:38:07,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:07,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:38:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:07,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:38:07,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:38:07,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 66 [2022-12-12 18:38:07,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 123 transitions, 1128 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 18:38:07,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:07,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 66 [2022-12-12 18:38:07,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:09,291 INFO L130 PetriNetUnfolder]: 18306/26234 cut-off events. [2022-12-12 18:38:09,292 INFO L131 PetriNetUnfolder]: For 29090/29090 co-relation queries the response was YES. [2022-12-12 18:38:09,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137521 conditions, 26234 events. 18306/26234 cut-off events. For 29090/29090 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 157259 event pairs, 1251 based on Foata normal form. 442/21701 useless extension candidates. Maximal degree in co-relation 137497. Up to 22464 conditions per place. [2022-12-12 18:38:09,474 INFO L137 encePairwiseOnDemand]: 55/66 looper letters, 186 selfloop transitions, 34 changer transitions 0/229 dead transitions. [2022-12-12 18:38:09,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 229 transitions, 2594 flow [2022-12-12 18:38:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:38:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:38:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-12-12 18:38:09,476 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2022-12-12 18:38:09,477 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -14 predicate places. [2022-12-12 18:38:09,477 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 229 transitions, 2594 flow [2022-12-12 18:38:09,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 229 transitions, 2594 flow [2022-12-12 18:38:09,783 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 229 transitions, 2594 flow [2022-12-12 18:38:09,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 18:38:09,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:09,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:09,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:38:09,784 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:09,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash -221546869, now seen corresponding path program 1 times [2022-12-12 18:38:09,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:09,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135767446] [2022-12-12 18:38:09,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:09,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:10,167 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 18:38:10,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:10,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135767446] [2022-12-12 18:38:10,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135767446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:10,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:10,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:38:10,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279253882] [2022-12-12 18:38:10,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:10,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:38:10,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:10,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:38:10,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:38:10,171 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 66 [2022-12-12 18:38:10,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 229 transitions, 2594 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 18:38:10,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:10,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 66 [2022-12-12 18:38:10,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:12,464 INFO L130 PetriNetUnfolder]: 19566/27944 cut-off events. [2022-12-12 18:38:12,464 INFO L131 PetriNetUnfolder]: For 51569/51569 co-relation queries the response was YES. [2022-12-12 18:38:12,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169783 conditions, 27944 events. 19566/27944 cut-off events. For 51569/51569 co-relation queries the response was YES. Maximal size of possible extension queue 972. Compared 167638 event pairs, 1328 based on Foata normal form. 46/22835 useless extension candidates. Maximal degree in co-relation 169756. Up to 23924 conditions per place. [2022-12-12 18:38:12,687 INFO L137 encePairwiseOnDemand]: 59/66 looper letters, 264 selfloop transitions, 28 changer transitions 0/310 dead transitions. [2022-12-12 18:38:12,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 310 transitions, 4159 flow [2022-12-12 18:38:12,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:38:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:38:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2022-12-12 18:38:12,691 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2022-12-12 18:38:12,693 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -10 predicate places. [2022-12-12 18:38:12,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 310 transitions, 4159 flow [2022-12-12 18:38:12,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 310 transitions, 4159 flow [2022-12-12 18:38:12,853 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 310 transitions, 4159 flow [2022-12-12 18:38:12,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 18:38:12,853 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:12,853 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:12,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:38:12,853 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:12,854 INFO L85 PathProgramCache]: Analyzing trace with hash -147367279, now seen corresponding path program 2 times [2022-12-12 18:38:12,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:12,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340436067] [2022-12-12 18:38:12,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:12,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:13,551 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 18:38:13,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:13,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340436067] [2022-12-12 18:38:13,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340436067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:13,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:13,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:38:13,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295221790] [2022-12-12 18:38:13,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:13,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 18:38:13,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:13,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 18:38:13,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 18:38:13,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 66 [2022-12-12 18:38:13,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 310 transitions, 4159 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 18:38:13,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:13,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 66 [2022-12-12 18:38:13,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:16,411 INFO L130 PetriNetUnfolder]: 21266/30287 cut-off events. [2022-12-12 18:38:16,412 INFO L131 PetriNetUnfolder]: For 54237/54237 co-relation queries the response was YES. [2022-12-12 18:38:16,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213452 conditions, 30287 events. 21266/30287 cut-off events. For 54237/54237 co-relation queries the response was YES. Maximal size of possible extension queue 1086. Compared 181946 event pairs, 608 based on Foata normal form. 46/24805 useless extension candidates. Maximal degree in co-relation 213422. Up to 26016 conditions per place. [2022-12-12 18:38:16,664 INFO L137 encePairwiseOnDemand]: 54/66 looper letters, 369 selfloop transitions, 112 changer transitions 0/490 dead transitions. [2022-12-12 18:38:16,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 490 transitions, 7427 flow [2022-12-12 18:38:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:38:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:38:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2022-12-12 18:38:16,666 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2022-12-12 18:38:16,666 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, -4 predicate places. [2022-12-12 18:38:16,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 490 transitions, 7427 flow [2022-12-12 18:38:16,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 490 transitions, 7427 flow [2022-12-12 18:38:16,848 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 490 transitions, 7427 flow [2022-12-12 18:38:16,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 18:38:16,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:16,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:16,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:38:16,848 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:16,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:16,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1906929413, now seen corresponding path program 3 times [2022-12-12 18:38:16,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:16,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094999656] [2022-12-12 18:38:16,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:16,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:17,546 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 18:38:17,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:17,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094999656] [2022-12-12 18:38:17,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094999656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:17,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:17,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:38:17,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715709892] [2022-12-12 18:38:17,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:17,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:38:17,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:17,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:38:17,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:38:17,548 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 66 [2022-12-12 18:38:17,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 490 transitions, 7427 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 18:38:17,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:17,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 66 [2022-12-12 18:38:17,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:21,071 INFO L130 PetriNetUnfolder]: 24512/34783 cut-off events. [2022-12-12 18:38:21,071 INFO L131 PetriNetUnfolder]: For 57727/57727 co-relation queries the response was YES. [2022-12-12 18:38:21,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279834 conditions, 34783 events. 24512/34783 cut-off events. For 57727/57727 co-relation queries the response was YES. Maximal size of possible extension queue 1254. Compared 211823 event pairs, 556 based on Foata normal form. 430/28817 useless extension candidates. Maximal degree in co-relation 279801. Up to 30081 conditions per place. [2022-12-12 18:38:21,443 INFO L137 encePairwiseOnDemand]: 54/66 looper letters, 477 selfloop transitions, 143 changer transitions 0/629 dead transitions. [2022-12-12 18:38:21,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 629 transitions, 10712 flow [2022-12-12 18:38:21,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:38:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:38:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2022-12-12 18:38:21,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2022-12-12 18:38:21,445 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2022-12-12 18:38:21,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 629 transitions, 10712 flow [2022-12-12 18:38:21,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 629 transitions, 10712 flow [2022-12-12 18:38:21,647 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 629 transitions, 10712 flow [2022-12-12 18:38:21,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 18:38:21,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:21,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:21,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:38:21,648 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:21,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:21,648 INFO L85 PathProgramCache]: Analyzing trace with hash -52084129, now seen corresponding path program 4 times [2022-12-12 18:38:21,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:21,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605948496] [2022-12-12 18:38:21,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:21,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:22,161 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 18:38:22,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:22,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605948496] [2022-12-12 18:38:22,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605948496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:22,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:22,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:38:22,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227668100] [2022-12-12 18:38:22,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:22,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:38:22,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:22,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:38:22,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:38:22,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 66 [2022-12-12 18:38:22,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 629 transitions, 10712 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 18:38:22,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:22,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 66 [2022-12-12 18:38:22,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:26,689 INFO L130 PetriNetUnfolder]: 28119/39972 cut-off events. [2022-12-12 18:38:26,690 INFO L131 PetriNetUnfolder]: For 65991/65991 co-relation queries the response was YES. [2022-12-12 18:38:26,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360286 conditions, 39972 events. 28119/39972 cut-off events. For 65991/65991 co-relation queries the response was YES. Maximal size of possible extension queue 1509. Compared 250488 event pairs, 491 based on Foata normal form. 212/32820 useless extension candidates. Maximal degree in co-relation 360250. Up to 34659 conditions per place. [2022-12-12 18:38:27,040 INFO L137 encePairwiseOnDemand]: 54/66 looper letters, 582 selfloop transitions, 217 changer transitions 0/808 dead transitions. [2022-12-12 18:38:27,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 808 transitions, 15193 flow [2022-12-12 18:38:27,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 18:38:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 18:38:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2022-12-12 18:38:27,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2022-12-12 18:38:27,042 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 8 predicate places. [2022-12-12 18:38:27,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 808 transitions, 15193 flow [2022-12-12 18:38:27,311 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 808 transitions, 15193 flow [2022-12-12 18:38:27,311 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 808 transitions, 15193 flow [2022-12-12 18:38:27,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 18:38:27,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:27,311 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:27,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:38:27,312 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:27,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:27,312 INFO L85 PathProgramCache]: Analyzing trace with hash -47010049, now seen corresponding path program 5 times [2022-12-12 18:38:27,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:27,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528180092] [2022-12-12 18:38:27,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:27,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:27,832 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 18:38:27,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:27,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528180092] [2022-12-12 18:38:27,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528180092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:27,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:27,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:38:27,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182822682] [2022-12-12 18:38:27,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:27,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 18:38:27,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:27,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 18:38:27,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 18:38:27,833 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 66 [2022-12-12 18:38:27,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 808 transitions, 15193 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 18:38:27,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:27,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 66 [2022-12-12 18:38:27,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:33,719 INFO L130 PetriNetUnfolder]: 31483/44743 cut-off events. [2022-12-12 18:38:33,720 INFO L131 PetriNetUnfolder]: For 79354/79354 co-relation queries the response was YES. [2022-12-12 18:38:33,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445776 conditions, 44743 events. 31483/44743 cut-off events. For 79354/79354 co-relation queries the response was YES. Maximal size of possible extension queue 1785. Compared 286042 event pairs, 422 based on Foata normal form. 244/36593 useless extension candidates. Maximal degree in co-relation 445737. Up to 38643 conditions per place. [2022-12-12 18:38:34,176 INFO L137 encePairwiseOnDemand]: 55/66 looper letters, 734 selfloop transitions, 154 changer transitions 0/897 dead transitions. [2022-12-12 18:38:34,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 897 transitions, 18605 flow [2022-12-12 18:38:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 18:38:34,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 18:38:34,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2022-12-12 18:38:34,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3503787878787879 [2022-12-12 18:38:34,179 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 15 predicate places. [2022-12-12 18:38:34,179 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 897 transitions, 18605 flow [2022-12-12 18:38:34,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 897 transitions, 18605 flow [2022-12-12 18:38:34,560 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 897 transitions, 18605 flow [2022-12-12 18:38:34,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 18:38:34,560 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:34,560 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:34,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 18:38:34,561 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:34,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:34,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1257496437, now seen corresponding path program 1 times [2022-12-12 18:38:34,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:34,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139147680] [2022-12-12 18:38:34,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:34,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:34,661 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 18:38:34,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:34,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139147680] [2022-12-12 18:38:34,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139147680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:34,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:34,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:38:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316500801] [2022-12-12 18:38:34,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:34,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:38:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:38:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:38:34,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 66 [2022-12-12 18:38:34,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 897 transitions, 18605 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 18:38:34,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:34,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 66 [2022-12-12 18:38:34,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:44,909 INFO L130 PetriNetUnfolder]: 54659/75157 cut-off events. [2022-12-12 18:38:44,909 INFO L131 PetriNetUnfolder]: For 453573/460273 co-relation queries the response was YES. [2022-12-12 18:38:45,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754187 conditions, 75157 events. 54659/75157 cut-off events. For 453573/460273 co-relation queries the response was YES. Maximal size of possible extension queue 2997. Compared 486376 event pairs, 5264 based on Foata normal form. 1391/63982 useless extension candidates. Maximal degree in co-relation 754145. Up to 65635 conditions per place. [2022-12-12 18:38:45,793 INFO L137 encePairwiseOnDemand]: 52/66 looper letters, 817 selfloop transitions, 195 changer transitions 0/1117 dead transitions. [2022-12-12 18:38:45,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 1117 transitions, 25579 flow [2022-12-12 18:38:45,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:38:45,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:38:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-12 18:38:45,794 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2022-12-12 18:38:45,795 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 17 predicate places. [2022-12-12 18:38:45,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 1117 transitions, 25579 flow [2022-12-12 18:38:46,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 1117 transitions, 25579 flow [2022-12-12 18:38:46,277 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 1117 transitions, 25579 flow [2022-12-12 18:38:46,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 18:38:46,277 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:46,277 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:46,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 18:38:46,277 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:46,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:46,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1394912707, now seen corresponding path program 1 times [2022-12-12 18:38:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:46,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531147696] [2022-12-12 18:38:46,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:46,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:46,391 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 18:38:46,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:46,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531147696] [2022-12-12 18:38:46,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531147696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:46,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:46,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:38:46,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537268964] [2022-12-12 18:38:46,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:46,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:38:46,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:46,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:38:46,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:38:46,392 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 66 [2022-12-12 18:38:46,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 1117 transitions, 25579 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 18:38:46,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:46,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 66 [2022-12-12 18:38:46,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:54,588 INFO L130 PetriNetUnfolder]: 34176/49552 cut-off events. [2022-12-12 18:38:54,588 INFO L131 PetriNetUnfolder]: For 360235/367853 co-relation queries the response was YES. [2022-12-12 18:38:54,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544042 conditions, 49552 events. 34176/49552 cut-off events. For 360235/367853 co-relation queries the response was YES. Maximal size of possible extension queue 2165. Compared 341712 event pairs, 2154 based on Foata normal form. 3779/45488 useless extension candidates. Maximal degree in co-relation 543997. Up to 43035 conditions per place. [2022-12-12 18:38:55,024 INFO L137 encePairwiseOnDemand]: 52/66 looper letters, 717 selfloop transitions, 379 changer transitions 0/1188 dead transitions. [2022-12-12 18:38:55,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 1188 transitions, 29569 flow [2022-12-12 18:38:55,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:38:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:38:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-12-12 18:38:55,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2022-12-12 18:38:55,026 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 20 predicate places. [2022-12-12 18:38:55,026 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 1188 transitions, 29569 flow [2022-12-12 18:38:55,436 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 1188 transitions, 29569 flow [2022-12-12 18:38:55,436 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 1188 transitions, 29569 flow [2022-12-12 18:38:55,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 18:38:55,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:55,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:55,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 18:38:55,437 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:55,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:55,437 INFO L85 PathProgramCache]: Analyzing trace with hash -408941307, now seen corresponding path program 1 times [2022-12-12 18:38:55,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:55,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460972155] [2022-12-12 18:38:55,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:55,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:55,837 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 18:38:55,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:55,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460972155] [2022-12-12 18:38:55,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460972155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:55,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:55,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:38:55,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404595769] [2022-12-12 18:38:55,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:55,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:38:55,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:55,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:38:55,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:38:55,839 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 66 [2022-12-12 18:38:55,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 1188 transitions, 29569 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 18:38:55,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:55,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 66 [2022-12-12 18:38:55,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:08,137 INFO L130 PetriNetUnfolder]: 45873/66479 cut-off events. [2022-12-12 18:39:08,138 INFO L131 PetriNetUnfolder]: For 515585/524834 co-relation queries the response was YES. [2022-12-12 18:39:08,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786388 conditions, 66479 events. 45873/66479 cut-off events. For 515585/524834 co-relation queries the response was YES. Maximal size of possible extension queue 3056. Compared 476588 event pairs, 3067 based on Foata normal form. 2213/57757 useless extension candidates. Maximal degree in co-relation 786340. Up to 58454 conditions per place. [2022-12-12 18:39:08,768 INFO L137 encePairwiseOnDemand]: 60/66 looper letters, 995 selfloop transitions, 97 changer transitions 555/1664 dead transitions. [2022-12-12 18:39:08,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 1664 transitions, 45017 flow [2022-12-12 18:39:08,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:39:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:39:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-12-12 18:39:08,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2022-12-12 18:39:08,771 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 23 predicate places. [2022-12-12 18:39:08,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 1664 transitions, 45017 flow [2022-12-12 18:39:09,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 1109 transitions, 29877 flow [2022-12-12 18:39:09,052 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 1109 transitions, 29877 flow [2022-12-12 18:39:09,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 18:39:09,053 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:09,053 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:09,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 18:39:09,053 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:39:09,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:09,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1547962768, now seen corresponding path program 1 times [2022-12-12 18:39:09,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:09,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521965069] [2022-12-12 18:39:09,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:09,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:09,225 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 18:39:09,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:09,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521965069] [2022-12-12 18:39:09,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521965069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:09,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:09,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:39:09,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212193530] [2022-12-12 18:39:09,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:09,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:39:09,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:09,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:39:09,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:39:09,227 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 66 [2022-12-12 18:39:09,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 1109 transitions, 29877 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 18:39:09,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:09,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 66 [2022-12-12 18:39:09,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:15,297 INFO L130 PetriNetUnfolder]: 19276/30195 cut-off events. [2022-12-12 18:39:15,297 INFO L131 PetriNetUnfolder]: For 341772/350554 co-relation queries the response was YES. [2022-12-12 18:39:15,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380496 conditions, 30195 events. 19276/30195 cut-off events. For 341772/350554 co-relation queries the response was YES. Maximal size of possible extension queue 1314. Compared 223645 event pairs, 857 based on Foata normal form. 4927/30116 useless extension candidates. Maximal degree in co-relation 380445. Up to 26213 conditions per place. [2022-12-12 18:39:15,564 INFO L137 encePairwiseOnDemand]: 52/66 looper letters, 528 selfloop transitions, 431 changer transitions 73/1102 dead transitions. [2022-12-12 18:39:15,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 1102 transitions, 31730 flow [2022-12-12 18:39:15,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:39:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:39:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2022-12-12 18:39:15,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2022-12-12 18:39:15,567 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 27 predicate places. [2022-12-12 18:39:15,567 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 1102 transitions, 31730 flow [2022-12-12 18:39:15,740 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 1029 transitions, 29579 flow [2022-12-12 18:39:15,741 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 1029 transitions, 29579 flow [2022-12-12 18:39:15,741 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 18:39:15,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:15,741 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, 1] [2022-12-12 18:39:15,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 18:39:15,741 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:39:15,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:15,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1088769612, now seen corresponding path program 1 times [2022-12-12 18:39:15,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:15,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022387316] [2022-12-12 18:39:15,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:15,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:15,968 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 18:39:15,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:15,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022387316] [2022-12-12 18:39:15,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022387316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:15,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:15,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:39:15,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349777465] [2022-12-12 18:39:15,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:15,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:39:15,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:15,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:39:15,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:39:15,971 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 66 [2022-12-12 18:39:15,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 1029 transitions, 29579 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 18:39:15,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:15,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 66 [2022-12-12 18:39:15,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:23,526 INFO L130 PetriNetUnfolder]: 23697/39802 cut-off events. [2022-12-12 18:39:23,527 INFO L131 PetriNetUnfolder]: For 443649/450240 co-relation queries the response was YES. [2022-12-12 18:39:23,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518693 conditions, 39802 events. 23697/39802 cut-off events. For 443649/450240 co-relation queries the response was YES. Maximal size of possible extension queue 2005. Compared 344303 event pairs, 1064 based on Foata normal form. 1048/34369 useless extension candidates. Maximal degree in co-relation 518639. Up to 34770 conditions per place. [2022-12-12 18:39:23,824 INFO L137 encePairwiseOnDemand]: 63/66 looper letters, 1039 selfloop transitions, 49 changer transitions 540/1690 dead transitions. [2022-12-12 18:39:23,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 1690 transitions, 52555 flow [2022-12-12 18:39:23,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:39:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:39:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-12 18:39:23,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2022-12-12 18:39:23,826 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 30 predicate places. [2022-12-12 18:39:23,826 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 1690 transitions, 52555 flow [2022-12-12 18:39:23,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 1150 transitions, 35371 flow [2022-12-12 18:39:23,983 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 1150 transitions, 35371 flow [2022-12-12 18:39:23,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 18:39:23,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:23,983 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, 1] [2022-12-12 18:39:23,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 18:39:23,983 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:39:23,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash -238897576, now seen corresponding path program 1 times [2022-12-12 18:39:23,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:23,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307159026] [2022-12-12 18:39:23,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:23,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:24,089 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 18:39:24,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:24,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307159026] [2022-12-12 18:39:24,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307159026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:24,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:24,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:39:24,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506871140] [2022-12-12 18:39:24,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:24,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:39:24,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:24,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:39:24,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:39:24,090 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 66 [2022-12-12 18:39:24,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 1150 transitions, 35371 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 18:39:24,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:24,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 66 [2022-12-12 18:39:24,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:27,994 INFO L130 PetriNetUnfolder]: 9790/16008 cut-off events. [2022-12-12 18:39:27,994 INFO L131 PetriNetUnfolder]: For 220267/224881 co-relation queries the response was YES. [2022-12-12 18:39:28,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219221 conditions, 16008 events. 9790/16008 cut-off events. For 220267/224881 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 116463 event pairs, 106 based on Foata normal form. 2482/15459 useless extension candidates. Maximal degree in co-relation 219164. Up to 13394 conditions per place. [2022-12-12 18:39:28,097 INFO L137 encePairwiseOnDemand]: 52/66 looper letters, 176 selfloop transitions, 213 changer transitions 717/1136 dead transitions. [2022-12-12 18:39:28,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 1136 transitions, 37053 flow [2022-12-12 18:39:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:39:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:39:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2022-12-12 18:39:28,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3813131313131313 [2022-12-12 18:39:28,099 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 35 predicate places. [2022-12-12 18:39:28,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 1136 transitions, 37053 flow [2022-12-12 18:39:28,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 419 transitions, 13299 flow [2022-12-12 18:39:28,160 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 419 transitions, 13299 flow [2022-12-12 18:39:28,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 18:39:28,160 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:28,161 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, 1, 1, 1, 1, 1] [2022-12-12 18:39:28,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 18:39:28,161 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:39:28,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash -817669804, now seen corresponding path program 1 times [2022-12-12 18:39:28,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:28,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106564749] [2022-12-12 18:39:28,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:28,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:28,590 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 18:39:28,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:28,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106564749] [2022-12-12 18:39:28,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106564749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:28,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:28,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:39:28,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246460555] [2022-12-12 18:39:28,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:28,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:39:28,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:28,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:39:28,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:39:28,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 66 [2022-12-12 18:39:28,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 419 transitions, 13299 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 18:39:28,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:28,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 66 [2022-12-12 18:39:28,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:29,858 INFO L130 PetriNetUnfolder]: 4829/7595 cut-off events. [2022-12-12 18:39:29,858 INFO L131 PetriNetUnfolder]: For 92916/94677 co-relation queries the response was YES. [2022-12-12 18:39:29,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113388 conditions, 7595 events. 4829/7595 cut-off events. For 92916/94677 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 46842 event pairs, 19 based on Foata normal form. 223/6054 useless extension candidates. Maximal degree in co-relation 113328. Up to 6943 conditions per place. [2022-12-12 18:39:29,911 INFO L137 encePairwiseOnDemand]: 57/66 looper letters, 150 selfloop transitions, 18 changer transitions 416/603 dead transitions. [2022-12-12 18:39:29,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 603 transitions, 20620 flow [2022-12-12 18:39:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:39:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:39:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2022-12-12 18:39:29,913 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3383838383838384 [2022-12-12 18:39:29,913 INFO L295 CegarLoopForPetriNet]: 79 programPoint places, 37 predicate places. [2022-12-12 18:39:29,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 603 transitions, 20620 flow [2022-12-12 18:39:29,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 187 transitions, 6124 flow [2022-12-12 18:39:29,945 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 187 transitions, 6124 flow [2022-12-12 18:39:29,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 18:39:29,945 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:29,945 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, 1, 1, 1, 1, 1] [2022-12-12 18:39:29,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-12 18:39:29,946 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:39:29,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:29,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1603628922, now seen corresponding path program 2 times [2022-12-12 18:39:29,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:29,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454565226] [2022-12-12 18:39:29,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:29,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:39:29,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:39:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:39:30,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:39:30,052 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:39:30,053 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 18:39:30,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 18:39:30,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 18:39:30,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 18:39:30,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 18:39:30,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 18:39:30,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 18:39:30,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-12 18:39:30,061 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:30,068 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:39:30,068 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:39:30,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:39:30 BasicIcfg [2022-12-12 18:39:30,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:39:30,150 INFO L158 Benchmark]: Toolchain (without parser) took 105284.45ms. Allocated memory was 186.6MB in the beginning and 7.6GB in the end (delta: 7.5GB). Free memory was 162.0MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-12 18:39:30,150 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 186.6MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:39:30,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.08ms. Allocated memory is still 186.6MB. Free memory was 162.0MB in the beginning and 134.2MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 18:39:30,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.39ms. Allocated memory is still 186.6MB. Free memory was 134.2MB in the beginning and 131.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 18:39:30,150 INFO L158 Benchmark]: Boogie Preprocessor took 44.87ms. Allocated memory is still 186.6MB. Free memory was 131.1MB in the beginning and 129.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:39:30,151 INFO L158 Benchmark]: RCFGBuilder took 804.35ms. Allocated memory is still 186.6MB. Free memory was 129.5MB in the beginning and 143.3MB in the end (delta: -13.8MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2022-12-12 18:39:30,151 INFO L158 Benchmark]: TraceAbstraction took 103934.79ms. Allocated memory was 186.6MB in the beginning and 7.6GB in the end (delta: 7.5GB). Free memory was 142.2MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-12 18:39:30,152 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.14ms. Allocated memory is still 186.6MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 425.08ms. Allocated memory is still 186.6MB. Free memory was 162.0MB in the beginning and 134.2MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.39ms. Allocated memory is still 186.6MB. Free memory was 134.2MB in the beginning and 131.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.87ms. Allocated memory is still 186.6MB. Free memory was 131.1MB in the beginning and 129.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 804.35ms. Allocated memory is still 186.6MB. Free memory was 129.5MB in the beginning and 143.3MB in the end (delta: -13.8MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. * TraceAbstraction took 103934.79ms. Allocated memory was 186.6MB in the beginning and 7.6GB in the end (delta: 7.5GB). Free memory was 142.2MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.1s, 137 PlacesBefore, 79 PlacesAfterwards, 126 TransitionsBefore, 66 TransitionsAfterwards, 2936 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 53 ConcurrentYvCompositions, 3 ChoiceCompositions, 102 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5369, independent: 5175, independent conditional: 5175, independent unconditional: 0, dependent: 194, dependent conditional: 194, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5369, independent: 5175, independent conditional: 0, independent unconditional: 5175, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5369, independent: 5175, independent conditional: 0, independent unconditional: 5175, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5369, independent: 5175, independent conditional: 0, independent unconditional: 5175, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2804, independent: 2738, independent conditional: 0, independent unconditional: 2738, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2804, independent: 2709, independent conditional: 0, independent unconditional: 2709, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 319, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 292, dependent conditional: 0, dependent unconditional: 292, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5369, independent: 2437, independent conditional: 0, independent unconditional: 2437, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 2804, unknown conditional: 0, unknown unconditional: 2804] , Statistics on independence cache: Total cache size (in pairs): 5553, Positive cache size: 5487, Positive conditional cache size: 0, Positive unconditional cache size: 5487, Negative cache size: 66, Negative conditional cache size: 0, Negative unconditional cache size: 66, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1165, ((void *)0), P0, ((void *)0))=-4, t1165={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1166, ((void *)0), P1, ((void *)0))=-3, t1165={5:0}, t1166={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1167, ((void *)0), P2, ((void *)0))=-2, t1165={5:0}, t1166={6:0}, t1167={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1168, ((void *)0), P3, ((void *)0))=-1, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 3.5s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 103.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 84.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 842 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 842 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1981 IncrementalHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 230 mSolverCounterUnsat, 65 mSDtfsCounter, 1981 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35371occurred in iteration=15, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 72923 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 2572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 18:39:30,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...