/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:28:05,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:28:05,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:28:05,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:28:05,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:28:05,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:28:05,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:28:05,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:28:05,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:28:05,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:28:05,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:28:05,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:28:05,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:28:05,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:28:05,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:28:05,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:28:05,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:28:05,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:28:05,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:28:05,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:28:05,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:28:05,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:28:05,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:28:05,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:28:05,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:28:05,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:28:05,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:28:05,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:28:05,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:28:05,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:28:05,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:28:05,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:28:05,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:28:05,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:28:05,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:28:05,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:28:05,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:28:05,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:28:05,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:28:05,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:28:05,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:28:05,193 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-05 20:28:05,216 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:28:05,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:28:05,217 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:28:05,218 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:28:05,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:28:05,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:28:05,219 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:28:05,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:28:05,219 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:28:05,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:28:05,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:28:05,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:28:05,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:28:05,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:28:05,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:28:05,220 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:28:05,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:28:05,220 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:28:05,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:28:05,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:28:05,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:28:05,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:28:05,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:28:05,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:28:05,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:28:05,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:28:05,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:28:05,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:28:05,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:28:05,221 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:28:05,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 20:28:05,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:28:05,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:28:05,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:28:05,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:28:05,498 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:28:05,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:28:06,554 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:28:06,824 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:28:06,825 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:28:06,837 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/055981940/9ef18324bd3a49daa49055bb27f97855/FLAG6cbb1b52c [2022-12-05 20:28:06,858 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/055981940/9ef18324bd3a49daa49055bb27f97855 [2022-12-05 20:28:06,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:28:06,861 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:28:06,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:28:06,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:28:06,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:28:06,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:28:06" (1/1) ... [2022-12-05 20:28:06,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d475ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:06, skipping insertion in model container [2022-12-05 20:28:06,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:28:06" (1/1) ... [2022-12-05 20:28:06,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:28:06,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:28:07,118 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/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2022-12-05 20:28:07,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:28:07,364 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:28:07,374 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/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2022-12-05 20:28:07,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:07,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:07,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:28:07,463 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:28:07,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:07 WrapperNode [2022-12-05 20:28:07,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:28:07,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:28:07,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:28:07,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:28:07,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:07" (1/1) ... [2022-12-05 20:28:07,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:07" (1/1) ... [2022-12-05 20:28:07,525 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-05 20:28:07,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:28:07,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:28:07,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:28:07,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:28:07,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:07" (1/1) ... [2022-12-05 20:28:07,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:07" (1/1) ... [2022-12-05 20:28:07,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:07" (1/1) ... [2022-12-05 20:28:07,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:07" (1/1) ... [2022-12-05 20:28:07,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:07" (1/1) ... [2022-12-05 20:28:07,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:07" (1/1) ... [2022-12-05 20:28:07,554 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:07" (1/1) ... [2022-12-05 20:28:07,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:07" (1/1) ... [2022-12-05 20:28:07,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:28:07,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:28:07,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:28:07,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:28:07,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:07" (1/1) ... [2022-12-05 20:28:07,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:28:07,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:28:07,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 20:28:07,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 20:28:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:28:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:28:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:28:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:28:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:28:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:28:07,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:28:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:28:07,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:28:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:28:07,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:28:07,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:28:07,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:28:07,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:28:07,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:28:07,664 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:28:07,794 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:28:07,825 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:28:08,090 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:28:08,167 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:28:08,167 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:28:08,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:28:08 BoogieIcfgContainer [2022-12-05 20:28:08,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:28:08,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:28:08,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:28:08,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:28:08,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:28:06" (1/3) ... [2022-12-05 20:28:08,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bad763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:28:08, skipping insertion in model container [2022-12-05 20:28:08,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:07" (2/3) ... [2022-12-05 20:28:08,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bad763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:28:08, skipping insertion in model container [2022-12-05 20:28:08,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:28:08" (3/3) ... [2022-12-05 20:28:08,174 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:28:08,187 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:28:08,188 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:28:08,188 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:28:08,223 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:28:08,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 20:28:08,276 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 20:28:08,276 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:28:08,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 20:28:08,280 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 20:28:08,283 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-05 20:28:08,284 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:28:08,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-05 20:28:08,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-05 20:28:08,316 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 20:28:08,316 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:28:08,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 20:28:08,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-05 20:28:08,319 INFO L188 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-05 20:28:12,368 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-05 20:28:12,379 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:28:12,383 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;@3cb8056c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:28:12,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:28:12,386 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 20:28:12,386 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:28:12,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:12,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 20:28:12,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:12,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:12,391 INFO L85 PathProgramCache]: Analyzing trace with hash 433341035, now seen corresponding path program 1 times [2022-12-05 20:28:12,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:12,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720514046] [2022-12-05 20:28:12,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:12,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:12,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:12,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720514046] [2022-12-05 20:28:12,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720514046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:12,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:12,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:28:12,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367072366] [2022-12-05 20:28:12,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:12,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:28:12,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:12,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:28:12,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:28:12,674 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 20:28:12,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:12,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:12,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 20:28:12,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:12,857 INFO L130 PetriNetUnfolder]: 879/1392 cut-off events. [2022-12-05 20:28:12,857 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 20:28:12,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2759 conditions, 1392 events. 879/1392 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6476 event pairs, 240 based on Foata normal form. 0/1244 useless extension candidates. Maximal degree in co-relation 2748. Up to 1060 conditions per place. [2022-12-05 20:28:12,865 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 27 selfloop transitions, 2 changer transitions 6/37 dead transitions. [2022-12-05 20:28:12,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 156 flow [2022-12-05 20:28:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:28:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:28:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-05 20:28:12,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-05 20:28:12,875 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 46 transitions. [2022-12-05 20:28:12,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 156 flow [2022-12-05 20:28:12,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:28:12,878 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 50 flow [2022-12-05 20:28:12,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-12-05 20:28:12,881 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-05 20:28:12,882 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 50 flow [2022-12-05 20:28:12,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:12,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:12,882 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:12,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:28:12,882 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:12,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:12,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1125650962, now seen corresponding path program 1 times [2022-12-05 20:28:12,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:12,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467584134] [2022-12-05 20:28:12,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:12,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:12,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:12,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467584134] [2022-12-05 20:28:12,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467584134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:12,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:12,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:28:12,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696775695] [2022-12-05 20:28:12,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:12,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:28:12,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:12,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:28:12,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:28:12,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 20:28:12,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 50 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:12,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:12,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 20:28:12,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:13,220 INFO L130 PetriNetUnfolder]: 1356/2082 cut-off events. [2022-12-05 20:28:13,220 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-12-05 20:28:13,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4359 conditions, 2082 events. 1356/2082 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10072 event pairs, 498 based on Foata normal form. 86/2168 useless extension candidates. Maximal degree in co-relation 4349. Up to 1151 conditions per place. [2022-12-05 20:28:13,229 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 31 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2022-12-05 20:28:13,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 164 flow [2022-12-05 20:28:13,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:28:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:28:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 20:28:13,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2022-12-05 20:28:13,231 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 50 flow. Second operand 3 states and 38 transitions. [2022-12-05 20:28:13,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 164 flow [2022-12-05 20:28:13,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:28:13,232 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 92 flow [2022-12-05 20:28:13,232 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2022-12-05 20:28:13,233 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2022-12-05 20:28:13,233 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 92 flow [2022-12-05 20:28:13,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:13,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:13,233 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:13,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:28:13,234 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:13,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:13,234 INFO L85 PathProgramCache]: Analyzing trace with hash -535442361, now seen corresponding path program 1 times [2022-12-05 20:28:13,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:13,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106770818] [2022-12-05 20:28:13,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:13,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:13,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:13,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106770818] [2022-12-05 20:28:13,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106770818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:13,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:13,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:28:13,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534174216] [2022-12-05 20:28:13,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:13,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:28:13,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:13,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:28:13,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:28:13,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-05 20:28:13,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:13,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:13,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-05 20:28:13,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:13,503 INFO L130 PetriNetUnfolder]: 1188/1899 cut-off events. [2022-12-05 20:28:13,503 INFO L131 PetriNetUnfolder]: For 837/837 co-relation queries the response was YES. [2022-12-05 20:28:13,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4853 conditions, 1899 events. 1188/1899 cut-off events. For 837/837 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9123 event pairs, 421 based on Foata normal form. 6/1905 useless extension candidates. Maximal degree in co-relation 4841. Up to 1706 conditions per place. [2022-12-05 20:28:13,513 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 30 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2022-12-05 20:28:13,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 206 flow [2022-12-05 20:28:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:28:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:28:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-05 20:28:13,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-05 20:28:13,514 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 92 flow. Second operand 3 states and 33 transitions. [2022-12-05 20:28:13,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 206 flow [2022-12-05 20:28:13,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:28:13,521 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 121 flow [2022-12-05 20:28:13,521 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2022-12-05 20:28:13,523 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-05 20:28:13,523 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 121 flow [2022-12-05 20:28:13,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:13,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:13,525 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:13,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:28:13,531 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:13,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:13,532 INFO L85 PathProgramCache]: Analyzing trace with hash -535442609, now seen corresponding path program 1 times [2022-12-05 20:28:13,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:13,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276808112] [2022-12-05 20:28:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:13,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:13,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:13,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276808112] [2022-12-05 20:28:13,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276808112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:13,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:13,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:28:13,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551218497] [2022-12-05 20:28:13,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:13,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:28:13,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:13,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:28:13,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:28:13,700 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 20:28:13,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 121 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:13,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:13,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 20:28:13,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:13,929 INFO L130 PetriNetUnfolder]: 1287/1975 cut-off events. [2022-12-05 20:28:13,930 INFO L131 PetriNetUnfolder]: For 603/603 co-relation queries the response was YES. [2022-12-05 20:28:13,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5044 conditions, 1975 events. 1287/1975 cut-off events. For 603/603 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9147 event pairs, 126 based on Foata normal form. 5/1980 useless extension candidates. Maximal degree in co-relation 5031. Up to 1055 conditions per place. [2022-12-05 20:28:13,937 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 42 selfloop transitions, 11 changer transitions 0/53 dead transitions. [2022-12-05 20:28:13,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 295 flow [2022-12-05 20:28:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:28:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:28:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 20:28:13,952 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-05 20:28:13,952 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 121 flow. Second operand 4 states and 48 transitions. [2022-12-05 20:28:13,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 295 flow [2022-12-05 20:28:13,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:28:13,954 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 192 flow [2022-12-05 20:28:13,954 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2022-12-05 20:28:13,954 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-05 20:28:13,954 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 192 flow [2022-12-05 20:28:13,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:13,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:13,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:13,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:28:13,955 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:13,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:13,955 INFO L85 PathProgramCache]: Analyzing trace with hash 581154838, now seen corresponding path program 1 times [2022-12-05 20:28:13,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:13,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532792566] [2022-12-05 20:28:13,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:13,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:14,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:14,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532792566] [2022-12-05 20:28:14,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532792566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:14,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:14,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:28:14,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145498450] [2022-12-05 20:28:14,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:14,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:28:14,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:14,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:28:14,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:28:14,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 20:28:14,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:14,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:14,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 20:28:14,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:14,393 INFO L130 PetriNetUnfolder]: 817/1418 cut-off events. [2022-12-05 20:28:14,393 INFO L131 PetriNetUnfolder]: For 1552/1585 co-relation queries the response was YES. [2022-12-05 20:28:14,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3975 conditions, 1418 events. 817/1418 cut-off events. For 1552/1585 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7540 event pairs, 167 based on Foata normal form. 166/1575 useless extension candidates. Maximal degree in co-relation 3958. Up to 553 conditions per place. [2022-12-05 20:28:14,399 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 55 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2022-12-05 20:28:14,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 69 transitions, 482 flow [2022-12-05 20:28:14,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:28:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:28:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-05 20:28:14,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49038461538461536 [2022-12-05 20:28:14,401 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 192 flow. Second operand 4 states and 51 transitions. [2022-12-05 20:28:14,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 69 transitions, 482 flow [2022-12-05 20:28:14,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 69 transitions, 482 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:28:14,405 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 230 flow [2022-12-05 20:28:14,405 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2022-12-05 20:28:14,405 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2022-12-05 20:28:14,405 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 230 flow [2022-12-05 20:28:14,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:14,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:14,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:14,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:28:14,406 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:14,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:14,406 INFO L85 PathProgramCache]: Analyzing trace with hash -794785837, now seen corresponding path program 1 times [2022-12-05 20:28:14,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:14,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630392471] [2022-12-05 20:28:14,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:14,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:14,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:14,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630392471] [2022-12-05 20:28:14,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630392471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:14,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:14,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:28:14,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521507886] [2022-12-05 20:28:14,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:14,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:28:14,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:14,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:28:14,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:28:14,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 20:28:14,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:14,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:14,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 20:28:14,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:14,716 INFO L130 PetriNetUnfolder]: 629/1136 cut-off events. [2022-12-05 20:28:14,716 INFO L131 PetriNetUnfolder]: For 1683/1709 co-relation queries the response was YES. [2022-12-05 20:28:14,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 1136 events. 629/1136 cut-off events. For 1683/1709 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6006 event pairs, 163 based on Foata normal form. 104/1225 useless extension candidates. Maximal degree in co-relation 3866. Up to 449 conditions per place. [2022-12-05 20:28:14,722 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 62 selfloop transitions, 8 changer transitions 0/79 dead transitions. [2022-12-05 20:28:14,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 573 flow [2022-12-05 20:28:14,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:28:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:28:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-05 20:28:14,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 20:28:14,725 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 230 flow. Second operand 5 states and 65 transitions. [2022-12-05 20:28:14,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 573 flow [2022-12-05 20:28:14,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 79 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:28:14,732 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 282 flow [2022-12-05 20:28:14,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-12-05 20:28:14,734 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2022-12-05 20:28:14,734 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 282 flow [2022-12-05 20:28:14,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:14,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:14,734 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:14,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:28:14,735 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:14,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:14,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1546906546, now seen corresponding path program 1 times [2022-12-05 20:28:14,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:14,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067540797] [2022-12-05 20:28:14,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:14,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:14,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:14,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067540797] [2022-12-05 20:28:14,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067540797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:14,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:14,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:28:14,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174743662] [2022-12-05 20:28:14,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:14,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:28:14,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:14,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:28:14,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:28:14,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 20:28:14,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 282 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:14,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:14,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 20:28:14,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:15,113 INFO L130 PetriNetUnfolder]: 1052/1829 cut-off events. [2022-12-05 20:28:15,113 INFO L131 PetriNetUnfolder]: For 4917/4917 co-relation queries the response was YES. [2022-12-05 20:28:15,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7250 conditions, 1829 events. 1052/1829 cut-off events. For 4917/4917 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10132 event pairs, 185 based on Foata normal form. 9/1838 useless extension candidates. Maximal degree in co-relation 7226. Up to 854 conditions per place. [2022-12-05 20:28:15,121 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 50 selfloop transitions, 13 changer transitions 21/84 dead transitions. [2022-12-05 20:28:15,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 84 transitions, 706 flow [2022-12-05 20:28:15,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:28:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:28:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-05 20:28:15,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2022-12-05 20:28:15,122 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 282 flow. Second operand 4 states and 50 transitions. [2022-12-05 20:28:15,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 84 transitions, 706 flow [2022-12-05 20:28:15,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 674 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-05 20:28:15,131 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 294 flow [2022-12-05 20:28:15,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=294, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2022-12-05 20:28:15,132 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2022-12-05 20:28:15,132 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 294 flow [2022-12-05 20:28:15,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:15,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:15,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:15,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:28:15,133 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:15,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2100754224, now seen corresponding path program 1 times [2022-12-05 20:28:15,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:15,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712263238] [2022-12-05 20:28:15,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:15,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:15,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:15,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712263238] [2022-12-05 20:28:15,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712263238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:15,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:15,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:28:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541278032] [2022-12-05 20:28:15,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:15,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:28:15,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:15,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:28:15,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:28:15,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-05 20:28:15,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:15,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:15,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-05 20:28:15,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:15,399 INFO L130 PetriNetUnfolder]: 427/855 cut-off events. [2022-12-05 20:28:15,399 INFO L131 PetriNetUnfolder]: For 2183/2195 co-relation queries the response was YES. [2022-12-05 20:28:15,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3501 conditions, 855 events. 427/855 cut-off events. For 2183/2195 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4486 event pairs, 199 based on Foata normal form. 14/861 useless extension candidates. Maximal degree in co-relation 3475. Up to 548 conditions per place. [2022-12-05 20:28:15,403 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 40 selfloop transitions, 3 changer transitions 6/52 dead transitions. [2022-12-05 20:28:15,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 474 flow [2022-12-05 20:28:15,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:28:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:28:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-05 20:28:15,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-05 20:28:15,404 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 294 flow. Second operand 3 states and 33 transitions. [2022-12-05 20:28:15,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 474 flow [2022-12-05 20:28:15,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 416 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-05 20:28:15,409 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 247 flow [2022-12-05 20:28:15,410 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2022-12-05 20:28:15,411 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2022-12-05 20:28:15,412 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 247 flow [2022-12-05 20:28:15,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:15,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:15,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:15,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:28:15,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:15,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:15,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1592106338, now seen corresponding path program 2 times [2022-12-05 20:28:15,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:15,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468682243] [2022-12-05 20:28:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:15,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:15,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:15,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468682243] [2022-12-05 20:28:15,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468682243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:15,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:15,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:28:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860163543] [2022-12-05 20:28:15,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:15,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:28:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:15,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:28:15,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:28:15,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 20:28:15,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:15,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:15,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 20:28:15,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:15,719 INFO L130 PetriNetUnfolder]: 288/588 cut-off events. [2022-12-05 20:28:15,719 INFO L131 PetriNetUnfolder]: For 934/940 co-relation queries the response was YES. [2022-12-05 20:28:15,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 588 events. 288/588 cut-off events. For 934/940 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2907 event pairs, 77 based on Foata normal form. 41/620 useless extension candidates. Maximal degree in co-relation 2093. Up to 214 conditions per place. [2022-12-05 20:28:15,721 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 24 selfloop transitions, 11 changer transitions 25/62 dead transitions. [2022-12-05 20:28:15,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 503 flow [2022-12-05 20:28:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:28:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:28:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-12-05 20:28:15,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-05 20:28:15,724 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 247 flow. Second operand 6 states and 57 transitions. [2022-12-05 20:28:15,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 503 flow [2022-12-05 20:28:15,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 489 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-05 20:28:15,727 INFO L231 Difference]: Finished difference. Result has 53 places, 26 transitions, 180 flow [2022-12-05 20:28:15,728 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=53, PETRI_TRANSITIONS=26} [2022-12-05 20:28:15,728 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2022-12-05 20:28:15,728 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 26 transitions, 180 flow [2022-12-05 20:28:15,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:15,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:15,729 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:15,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:28:15,729 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1161331406, now seen corresponding path program 1 times [2022-12-05 20:28:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:15,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685373622] [2022-12-05 20:28:15,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:16,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:16,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685373622] [2022-12-05 20:28:16,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685373622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:16,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:16,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:28:16,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517164324] [2022-12-05 20:28:16,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:16,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:28:16,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:16,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:28:16,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:28:16,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 20:28:16,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 26 transitions, 180 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:16,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:16,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 20:28:16,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:16,763 INFO L130 PetriNetUnfolder]: 56/128 cut-off events. [2022-12-05 20:28:16,763 INFO L131 PetriNetUnfolder]: For 296/296 co-relation queries the response was YES. [2022-12-05 20:28:16,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 128 events. 56/128 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 388 event pairs, 5 based on Foata normal form. 1/129 useless extension candidates. Maximal degree in co-relation 513. Up to 65 conditions per place. [2022-12-05 20:28:16,764 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 27 selfloop transitions, 4 changer transitions 17/50 dead transitions. [2022-12-05 20:28:16,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 442 flow [2022-12-05 20:28:16,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:28:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:28:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-12-05 20:28:16,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2692307692307692 [2022-12-05 20:28:16,766 INFO L175 Difference]: Start difference. First operand has 53 places, 26 transitions, 180 flow. Second operand 7 states and 49 transitions. [2022-12-05 20:28:16,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 442 flow [2022-12-05 20:28:16,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 251 flow, removed 26 selfloop flow, removed 22 redundant places. [2022-12-05 20:28:16,768 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 92 flow [2022-12-05 20:28:16,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=92, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-05 20:28:16,768 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2022-12-05 20:28:16,768 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 92 flow [2022-12-05 20:28:16,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:16,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:16,769 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:16,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:28:16,769 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1893269650, now seen corresponding path program 2 times [2022-12-05 20:28:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:16,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972859623] [2022-12-05 20:28:16,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:16,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:28:16,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:28:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:28:16,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:28:16,843 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:28:16,844 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:28:16,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 20:28:16,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:28:16,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 20:28:16,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 20:28:16,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:28:16,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:28:16,847 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:16,852 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:28:16,852 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:28:16,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:28:16 BasicIcfg [2022-12-05 20:28:16,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:28:16,889 INFO L158 Benchmark]: Toolchain (without parser) took 10027.70ms. Allocated memory was 182.5MB in the beginning and 384.8MB in the end (delta: 202.4MB). Free memory was 158.3MB in the beginning and 218.2MB in the end (delta: -59.9MB). Peak memory consumption was 143.4MB. Max. memory is 8.0GB. [2022-12-05 20:28:16,889 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:28:16,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 601.73ms. Allocated memory is still 182.5MB. Free memory was 157.9MB in the beginning and 131.7MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 20:28:16,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.65ms. Allocated memory is still 182.5MB. Free memory was 131.7MB in the beginning and 129.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:28:16,890 INFO L158 Benchmark]: Boogie Preprocessor took 48.43ms. Allocated memory is still 182.5MB. Free memory was 129.6MB in the beginning and 127.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:28:16,890 INFO L158 Benchmark]: RCFGBuilder took 593.77ms. Allocated memory is still 182.5MB. Free memory was 127.5MB in the beginning and 136.0MB in the end (delta: -8.5MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-12-05 20:28:16,890 INFO L158 Benchmark]: TraceAbstraction took 8718.42ms. Allocated memory was 182.5MB in the beginning and 384.8MB in the end (delta: 202.4MB). Free memory was 135.4MB in the beginning and 218.2MB in the end (delta: -82.8MB). Peak memory consumption was 121.1MB. Max. memory is 8.0GB. [2022-12-05 20:28:16,891 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.12ms. Allocated memory is still 127.9MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 601.73ms. Allocated memory is still 182.5MB. Free memory was 157.9MB in the beginning and 131.7MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.65ms. Allocated memory is still 182.5MB. Free memory was 131.7MB in the beginning and 129.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.43ms. Allocated memory is still 182.5MB. Free memory was 129.6MB in the beginning and 127.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 593.77ms. Allocated memory is still 182.5MB. Free memory was 127.5MB in the beginning and 136.0MB in the end (delta: -8.5MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * TraceAbstraction took 8718.42ms. Allocated memory was 182.5MB in the beginning and 384.8MB in the end (delta: 202.4MB). Free memory was 135.4MB in the beginning and 218.2MB in the end (delta: -82.8MB). Peak memory consumption was 121.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 111 PlacesBefore, 35 PlacesAfterwards, 103 TransitionsBefore, 26 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1332, independent: 1282, independent conditional: 1282, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1332, independent: 1282, independent conditional: 0, independent unconditional: 1282, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1332, independent: 1282, independent conditional: 0, independent unconditional: 1282, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1332, independent: 1282, independent conditional: 0, independent unconditional: 1282, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1073, independent: 1040, independent conditional: 0, independent unconditional: 1040, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1073, independent: 1025, independent conditional: 0, independent unconditional: 1025, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 148, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1332, independent: 242, independent conditional: 0, independent unconditional: 242, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1073, unknown conditional: 0, unknown unconditional: 1073] , Statistics on independence cache: Total cache size (in pairs): 1678, Positive cache size: 1645, Positive conditional cache size: 0, Positive unconditional cache size: 1645, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff0_thd3; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$read_delayed; [L728] 0 int *x$read_delayed_var; [L729] 0 int x$w_buff0; [L730] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff1; [L732] 0 _Bool x$w_buff1_used; [L734] 0 int y = 0; [L736] 0 int z = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L829] 0 pthread_t t2513; [L830] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2513, ((void *)0), P0, ((void *)0))=-3, t2513={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2514; [L832] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2514, ((void *)0), P1, ((void *)0))=-2, t2513={5:0}, t2514={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2515; [L834] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2515, ((void *)0), P2, ((void *)0))=-1, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L801] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L742] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L847] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 581 IncrementalHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 10 mSDtfsCounter, 581 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 20:28:16,915 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...