/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:34:45,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:34:45,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:34:45,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:34:45,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:34:45,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:34:45,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:34:45,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:34:45,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:34:45,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:34:45,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:34:45,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:34:45,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:34:45,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:34:45,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:34:45,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:34:45,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:34:45,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:34:45,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:34:45,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:34:45,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:34:45,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:34:45,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:34:45,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:34:45,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:34:45,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:34:45,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:34:45,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:34:45,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:34:45,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:34:45,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:34:45,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:34:45,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:34:45,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:34:45,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:34:45,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:34:45,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:34:45,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:34:45,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:34:45,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:34:45,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:34:45,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 18:34:45,600 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:34:45,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:34:45,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:34:45,602 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:34:45,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:34:45,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:34:45,604 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:34:45,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:34:45,604 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:34:45,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:34:45,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:34:45,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:34:45,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:34:45,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:34:45,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:34:45,606 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:34:45,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:34:45,606 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:34:45,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:34:45,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:34:45,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:34:45,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:34:45,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:34:45,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:34:45,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:34:45,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:34:45,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:34:45,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:34:45,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:34:45,609 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:34:45,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-12 18:34:45,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:34:45,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:34:46,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:34:46,002 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:34:46,002 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:34:46,004 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-12 18:34:47,082 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:34:47,414 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:34:47,415 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-12 18:34:47,441 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253e55afb/05b9179fc51944138c32726a08df0420/FLAGb370dd6be [2022-12-12 18:34:47,457 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253e55afb/05b9179fc51944138c32726a08df0420 [2022-12-12 18:34:47,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:34:47,460 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:34:47,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:34:47,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:34:47,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:34:47,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:34:47" (1/1) ... [2022-12-12 18:34:47,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a1ae7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:34:47, skipping insertion in model container [2022-12-12 18:34:47,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:34:47" (1/1) ... [2022-12-12 18:34:47,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:34:47,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:34:47,635 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2022-12-12 18:34:47,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:34:47,890 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:34:47,903 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2022-12-12 18:34:47,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:34:47,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:34:47,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:34:48,007 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:34:48,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:34:48 WrapperNode [2022-12-12 18:34:48,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:34:48,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:34:48,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:34:48,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:34:48,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:34:48" (1/1) ... [2022-12-12 18:34:48,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:34:48" (1/1) ... [2022-12-12 18:34:48,074 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-12 18:34:48,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:34:48,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:34:48,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:34:48,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:34:48,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:34:48" (1/1) ... [2022-12-12 18:34:48,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:34:48" (1/1) ... [2022-12-12 18:34:48,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:34:48" (1/1) ... [2022-12-12 18:34:48,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:34:48" (1/1) ... [2022-12-12 18:34:48,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:34:48" (1/1) ... [2022-12-12 18:34:48,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:34:48" (1/1) ... [2022-12-12 18:34:48,110 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:34:48" (1/1) ... [2022-12-12 18:34:48,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:34:48" (1/1) ... [2022-12-12 18:34:48,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:34:48,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:34:48,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:34:48,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:34:48,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:34:48" (1/1) ... [2022-12-12 18:34:48,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:34:48,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:34:48,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 18:34:48,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 18:34:48,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:34:48,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:34:48,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:34:48,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:34:48,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:34:48,198 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:34:48,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:34:48,198 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:34:48,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:34:48,199 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:34:48,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:34:48,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:34:48,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:34:48,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:34:48,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:34:48,201 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:34:48,349 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:34:48,350 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:34:48,644 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:34:48,813 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:34:48,814 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:34:48,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:34:48 BoogieIcfgContainer [2022-12-12 18:34:48,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:34:48,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:34:48,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:34:48,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:34:48,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:34:47" (1/3) ... [2022-12-12 18:34:48,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0a7209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:34:48, skipping insertion in model container [2022-12-12 18:34:48,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:34:48" (2/3) ... [2022-12-12 18:34:48,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0a7209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:34:48, skipping insertion in model container [2022-12-12 18:34:48,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:34:48" (3/3) ... [2022-12-12 18:34:48,823 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-12 18:34:48,839 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:34:48,839 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:34:48,839 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:34:48,905 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:34:48,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-12 18:34:49,009 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-12 18:34:49,009 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:34:49,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-12 18:34:49,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-12 18:34:49,021 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-12 18:34:49,023 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:34:49,049 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-12 18:34:49,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-12 18:34:49,074 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-12 18:34:49,074 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:34:49,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-12 18:34:49,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-12 18:34:49,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 2008 [2022-12-12 18:34:54,237 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-12 18:34:54,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:34:54,256 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;@39acaf98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:34:54,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 18:34:54,258 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-12 18:34:54,259 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:34:54,259 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:54,259 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-12 18:34:54,260 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:54,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:54,264 INFO L85 PathProgramCache]: Analyzing trace with hash 494645, now seen corresponding path program 1 times [2022-12-12 18:34:54,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:54,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202955552] [2022-12-12 18:34:54,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:54,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:54,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:54,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202955552] [2022-12-12 18:34:54,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202955552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:54,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:54,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:34:54,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16997485] [2022-12-12 18:34:54,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:54,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:34:54,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:54,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:34:54,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:34:54,632 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 67 [2022-12-12 18:34:54,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:54,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:54,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 67 [2022-12-12 18:34:54,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:56,440 INFO L130 PetriNetUnfolder]: 9240/14902 cut-off events. [2022-12-12 18:34:56,440 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-12 18:34:56,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28140 conditions, 14902 events. 9240/14902 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 115907 event pairs, 1220 based on Foata normal form. 0/9416 useless extension candidates. Maximal degree in co-relation 28129. Up to 11165 conditions per place. [2022-12-12 18:34:56,502 INFO L137 encePairwiseOnDemand]: 62/67 looper letters, 36 selfloop transitions, 2 changer transitions 59/109 dead transitions. [2022-12-12 18:34:56,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 425 flow [2022-12-12 18:34:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:34:56,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:34:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-12-12 18:34:56,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6965174129353234 [2022-12-12 18:34:56,519 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, 0 predicate places. [2022-12-12 18:34:56,519 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 109 transitions, 425 flow [2022-12-12 18:34:56,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 50 transitions, 191 flow [2022-12-12 18:34:56,550 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 50 transitions, 191 flow [2022-12-12 18:34:56,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:56,550 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:56,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:56,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:34:56,551 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:56,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 685556431, now seen corresponding path program 1 times [2022-12-12 18:34:56,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:56,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676357976] [2022-12-12 18:34:56,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:56,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:56,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:56,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676357976] [2022-12-12 18:34:56,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676357976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:56,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:56,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:34:56,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955602054] [2022-12-12 18:34:56,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:56,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:34:56,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:56,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:34:56,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:34:56,885 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 67 [2022-12-12 18:34:56,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:56,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:56,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 67 [2022-12-12 18:34:56,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:57,320 INFO L130 PetriNetUnfolder]: 2484/3806 cut-off events. [2022-12-12 18:34:57,321 INFO L131 PetriNetUnfolder]: For 356/356 co-relation queries the response was YES. [2022-12-12 18:34:57,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10534 conditions, 3806 events. 2484/3806 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 19795 event pairs, 648 based on Foata normal form. 10/3259 useless extension candidates. Maximal degree in co-relation 10520. Up to 3448 conditions per place. [2022-12-12 18:34:57,347 INFO L137 encePairwiseOnDemand]: 63/67 looper letters, 53 selfloop transitions, 4 changer transitions 2/68 dead transitions. [2022-12-12 18:34:57,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 383 flow [2022-12-12 18:34:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:34:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:34:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-12 18:34:57,350 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3383084577114428 [2022-12-12 18:34:57,350 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -28 predicate places. [2022-12-12 18:34:57,351 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 68 transitions, 383 flow [2022-12-12 18:34:57,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 66 transitions, 375 flow [2022-12-12 18:34:57,373 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 66 transitions, 375 flow [2022-12-12 18:34:57,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:57,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:57,373 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:57,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:34:57,374 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:57,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:57,376 INFO L85 PathProgramCache]: Analyzing trace with hash -222587730, now seen corresponding path program 1 times [2022-12-12 18:34:57,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:57,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779567478] [2022-12-12 18:34:57,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:57,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:57,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:57,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779567478] [2022-12-12 18:34:57,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779567478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:57,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:57,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:34:57,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905922841] [2022-12-12 18:34:57,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:57,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:34:57,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:57,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:34:57,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:34:57,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2022-12-12 18:34:57,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 66 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:57,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:57,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2022-12-12 18:34:57,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:57,872 INFO L130 PetriNetUnfolder]: 1831/2828 cut-off events. [2022-12-12 18:34:57,873 INFO L131 PetriNetUnfolder]: For 457/457 co-relation queries the response was YES. [2022-12-12 18:34:57,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10583 conditions, 2828 events. 1831/2828 cut-off events. For 457/457 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13976 event pairs, 169 based on Foata normal form. 50/2448 useless extension candidates. Maximal degree in co-relation 10566. Up to 2558 conditions per place. [2022-12-12 18:34:57,894 INFO L137 encePairwiseOnDemand]: 64/67 looper letters, 69 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2022-12-12 18:34:57,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 82 transitions, 613 flow [2022-12-12 18:34:57,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:34:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:34:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-12 18:34:57,899 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-12 18:34:57,900 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -27 predicate places. [2022-12-12 18:34:57,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 82 transitions, 613 flow [2022-12-12 18:34:57,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 82 transitions, 613 flow [2022-12-12 18:34:57,916 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 82 transitions, 613 flow [2022-12-12 18:34:57,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:57,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:57,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:57,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:34:57,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:57,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:57,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1689711406, now seen corresponding path program 1 times [2022-12-12 18:34:57,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:57,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604105685] [2022-12-12 18:34:57,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:57,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:58,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:58,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604105685] [2022-12-12 18:34:58,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604105685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:58,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:58,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:34:58,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625842396] [2022-12-12 18:34:58,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:58,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:34:58,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:58,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:34:58,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:34:58,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 67 [2022-12-12 18:34:58,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 82 transitions, 613 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:58,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:58,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 67 [2022-12-12 18:34:58,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:58,659 INFO L130 PetriNetUnfolder]: 2871/4421 cut-off events. [2022-12-12 18:34:58,659 INFO L131 PetriNetUnfolder]: For 4601/4684 co-relation queries the response was YES. [2022-12-12 18:34:58,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19673 conditions, 4421 events. 2871/4421 cut-off events. For 4601/4684 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 24232 event pairs, 358 based on Foata normal form. 348/4160 useless extension candidates. Maximal degree in co-relation 19653. Up to 3710 conditions per place. [2022-12-12 18:34:58,688 INFO L137 encePairwiseOnDemand]: 55/67 looper letters, 92 selfloop transitions, 22 changer transitions 86/209 dead transitions. [2022-12-12 18:34:58,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 209 transitions, 1987 flow [2022-12-12 18:34:58,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:34:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:34:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2022-12-12 18:34:58,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3880597014925373 [2022-12-12 18:34:58,693 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -23 predicate places. [2022-12-12 18:34:58,693 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 209 transitions, 1987 flow [2022-12-12 18:34:58,716 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 123 transitions, 1163 flow [2022-12-12 18:34:58,717 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 123 transitions, 1163 flow [2022-12-12 18:34:58,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:58,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:58,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:58,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:34:58,717 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:58,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:58,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1878534653, now seen corresponding path program 1 times [2022-12-12 18:34:58,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:58,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041955150] [2022-12-12 18:34:58,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:58,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:58,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-12 18:34:58,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:58,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041955150] [2022-12-12 18:34:58,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041955150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:58,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:58,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:34:58,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023772618] [2022-12-12 18:34:58,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:58,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:34:58,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:58,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:34:58,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:34:58,909 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 67 [2022-12-12 18:34:58,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 123 transitions, 1163 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:58,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:58,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 67 [2022-12-12 18:34:58,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:34:59,354 INFO L130 PetriNetUnfolder]: 1585/2695 cut-off events. [2022-12-12 18:34:59,355 INFO L131 PetriNetUnfolder]: For 3548/3650 co-relation queries the response was YES. [2022-12-12 18:34:59,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14536 conditions, 2695 events. 1585/2695 cut-off events. For 3548/3650 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15366 event pairs, 72 based on Foata normal form. 345/2682 useless extension candidates. Maximal degree in co-relation 14513. Up to 2326 conditions per place. [2022-12-12 18:34:59,373 INFO L137 encePairwiseOnDemand]: 55/67 looper letters, 89 selfloop transitions, 39 changer transitions 56/193 dead transitions. [2022-12-12 18:34:59,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 193 transitions, 2180 flow [2022-12-12 18:34:59,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:34:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:34:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2022-12-12 18:34:59,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39303482587064675 [2022-12-12 18:34:59,378 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -20 predicate places. [2022-12-12 18:34:59,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 193 transitions, 2180 flow [2022-12-12 18:34:59,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 137 transitions, 1544 flow [2022-12-12 18:34:59,393 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 137 transitions, 1544 flow [2022-12-12 18:34:59,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:59,394 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:34:59,394 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:34:59,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:34:59,394 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:34:59,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:34:59,398 INFO L85 PathProgramCache]: Analyzing trace with hash -65572884, now seen corresponding path program 1 times [2022-12-12 18:34:59,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:34:59,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143715047] [2022-12-12 18:34:59,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:34:59,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:34:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:34:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:34:59,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:34:59,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143715047] [2022-12-12 18:34:59,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143715047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:34:59,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:34:59,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:34:59,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956507328] [2022-12-12 18:34:59,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:34:59,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:34:59,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:34:59,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:34:59,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:34:59,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2022-12-12 18:34:59,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 137 transitions, 1544 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:34:59,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:34:59,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2022-12-12 18:34:59,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:35:00,427 INFO L130 PetriNetUnfolder]: 2356/4063 cut-off events. [2022-12-12 18:35:00,428 INFO L131 PetriNetUnfolder]: For 6224/6258 co-relation queries the response was YES. [2022-12-12 18:35:00,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25074 conditions, 4063 events. 2356/4063 cut-off events. For 6224/6258 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 25651 event pairs, 152 based on Foata normal form. 96/3524 useless extension candidates. Maximal degree in co-relation 25048. Up to 3644 conditions per place. [2022-12-12 18:35:00,454 INFO L137 encePairwiseOnDemand]: 60/67 looper letters, 180 selfloop transitions, 24 changer transitions 57/279 dead transitions. [2022-12-12 18:35:00,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 279 transitions, 3791 flow [2022-12-12 18:35:00,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:35:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:35:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2022-12-12 18:35:00,456 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34968017057569295 [2022-12-12 18:35:00,456 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -16 predicate places. [2022-12-12 18:35:00,457 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 279 transitions, 3791 flow [2022-12-12 18:35:00,478 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 222 transitions, 2993 flow [2022-12-12 18:35:00,479 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 222 transitions, 2993 flow [2022-12-12 18:35:00,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:35:00,479 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:35:00,479 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:35:00,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:35:00,479 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:35:00,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:35:00,480 INFO L85 PathProgramCache]: Analyzing trace with hash -190472127, now seen corresponding path program 1 times [2022-12-12 18:35:00,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:35:00,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733348198] [2022-12-12 18:35:00,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:35:00,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:35:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:35:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:35:00,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:35:00,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733348198] [2022-12-12 18:35:00,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733348198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:35:00,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:35:00,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:35:00,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655751142] [2022-12-12 18:35:00,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:35:00,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:35:00,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:35:00,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:35:00,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:35:00,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 67 [2022-12-12 18:35:00,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 222 transitions, 2993 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:35:00,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:35:00,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 67 [2022-12-12 18:35:00,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:35:01,090 INFO L130 PetriNetUnfolder]: 1174/2166 cut-off events. [2022-12-12 18:35:01,091 INFO L131 PetriNetUnfolder]: For 5460/5565 co-relation queries the response was YES. [2022-12-12 18:35:01,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15372 conditions, 2166 events. 1174/2166 cut-off events. For 5460/5565 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12991 event pairs, 3 based on Foata normal form. 294/2118 useless extension candidates. Maximal degree in co-relation 15343. Up to 1836 conditions per place. [2022-12-12 18:35:01,107 INFO L137 encePairwiseOnDemand]: 55/67 looper letters, 112 selfloop transitions, 78 changer transitions 41/240 dead transitions. [2022-12-12 18:35:01,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 240 transitions, 3683 flow [2022-12-12 18:35:01,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:35:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:35:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2022-12-12 18:35:01,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32409381663113007 [2022-12-12 18:35:01,110 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -12 predicate places. [2022-12-12 18:35:01,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 240 transitions, 3683 flow [2022-12-12 18:35:01,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 199 transitions, 3048 flow [2022-12-12 18:35:01,123 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 199 transitions, 3048 flow [2022-12-12 18:35:01,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:35:01,124 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:35:01,124 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:35:01,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:35:01,124 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:35:01,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:35:01,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1709398668, now seen corresponding path program 1 times [2022-12-12 18:35:01,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:35:01,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54366525] [2022-12-12 18:35:01,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:35:01,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:35:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:35:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:35:01,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:35:01,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54366525] [2022-12-12 18:35:01,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54366525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:35:01,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:35:01,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:35:01,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290764719] [2022-12-12 18:35:01,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:35:01,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:35:01,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:35:01,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:35:01,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:35:01,389 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2022-12-12 18:35:01,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 199 transitions, 3048 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:35:01,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:35:01,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2022-12-12 18:35:01,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:35:01,773 INFO L130 PetriNetUnfolder]: 1463/2636 cut-off events. [2022-12-12 18:35:01,773 INFO L131 PetriNetUnfolder]: For 12573/12639 co-relation queries the response was YES. [2022-12-12 18:35:01,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20316 conditions, 2636 events. 1463/2636 cut-off events. For 12573/12639 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15781 event pairs, 6 based on Foata normal form. 65/2265 useless extension candidates. Maximal degree in co-relation 20284. Up to 2093 conditions per place. [2022-12-12 18:35:01,787 INFO L137 encePairwiseOnDemand]: 64/67 looper letters, 150 selfloop transitions, 11 changer transitions 174/351 dead transitions. [2022-12-12 18:35:01,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 351 transitions, 6176 flow [2022-12-12 18:35:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:35:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:35:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-12 18:35:01,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35447761194029853 [2022-12-12 18:35:01,790 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -11 predicate places. [2022-12-12 18:35:01,791 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 351 transitions, 6176 flow [2022-12-12 18:35:01,802 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 177 transitions, 3032 flow [2022-12-12 18:35:01,803 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 177 transitions, 3032 flow [2022-12-12 18:35:01,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:35:01,803 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:35:01,803 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:35:01,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:35:01,803 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:35:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:35:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1555475522, now seen corresponding path program 2 times [2022-12-12 18:35:01,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:35:01,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574924826] [2022-12-12 18:35:01,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:35:01,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:35:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:35:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 18:35:02,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:35:02,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574924826] [2022-12-12 18:35:02,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574924826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:35:02,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:35:02,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:35:02,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864151845] [2022-12-12 18:35:02,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:35:02,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 18:35:02,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:35:02,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 18:35:02,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 18:35:02,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2022-12-12 18:35:02,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 177 transitions, 3032 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:35:02,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:35:02,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2022-12-12 18:35:02,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:35:03,018 INFO L130 PetriNetUnfolder]: 1007/1903 cut-off events. [2022-12-12 18:35:03,018 INFO L131 PetriNetUnfolder]: For 7888/7904 co-relation queries the response was YES. [2022-12-12 18:35:03,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16225 conditions, 1903 events. 1007/1903 cut-off events. For 7888/7904 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11007 event pairs, 30 based on Foata normal form. 30/1591 useless extension candidates. Maximal degree in co-relation 16190. Up to 1590 conditions per place. [2022-12-12 18:35:03,035 INFO L137 encePairwiseOnDemand]: 60/67 looper letters, 163 selfloop transitions, 21 changer transitions 87/286 dead transitions. [2022-12-12 18:35:03,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 286 transitions, 5538 flow [2022-12-12 18:35:03,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:35:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:35:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2022-12-12 18:35:03,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31982942430703626 [2022-12-12 18:35:03,038 INFO L295 CegarLoopForPetriNet]: 76 programPoint places, -7 predicate places. [2022-12-12 18:35:03,038 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 286 transitions, 5538 flow [2022-12-12 18:35:03,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 199 transitions, 3801 flow [2022-12-12 18:35:03,052 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 199 transitions, 3801 flow [2022-12-12 18:35:03,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 18:35:03,052 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:35:03,052 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:35:03,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:35:03,052 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 18:35:03,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:35:03,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1181014861, now seen corresponding path program 1 times [2022-12-12 18:35:03,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:35:03,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678379071] [2022-12-12 18:35:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:35:03,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:35:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:35:03,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:35:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:35:03,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:35:03,155 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:35:03,155 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 18:35:03,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 18:35:03,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 18:35:03,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 18:35:03,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 18:35:03,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 18:35:03,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 18:35:03,158 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:35:03,163 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:35:03,163 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:35:03,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:35:03 BasicIcfg [2022-12-12 18:35:03,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:35:03,214 INFO L158 Benchmark]: Toolchain (without parser) took 15753.56ms. Allocated memory was 182.5MB in the beginning and 660.6MB in the end (delta: 478.2MB). Free memory was 157.2MB in the beginning and 365.2MB in the end (delta: -208.0MB). Peak memory consumption was 271.7MB. Max. memory is 8.0GB. [2022-12-12 18:35:03,214 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 182.5MB. Free memory was 158.9MB in the beginning and 158.8MB in the end (delta: 91.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:35:03,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.27ms. Allocated memory is still 182.5MB. Free memory was 156.7MB in the beginning and 130.4MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 18:35:03,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.99ms. Allocated memory is still 182.5MB. Free memory was 130.4MB in the beginning and 127.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:35:03,215 INFO L158 Benchmark]: Boogie Preprocessor took 55.24ms. Allocated memory is still 182.5MB. Free memory was 127.8MB in the beginning and 126.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:35:03,215 INFO L158 Benchmark]: RCFGBuilder took 685.65ms. Allocated memory is still 182.5MB. Free memory was 125.7MB in the beginning and 91.1MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-12 18:35:03,215 INFO L158 Benchmark]: TraceAbstraction took 14394.68ms. Allocated memory was 182.5MB in the beginning and 660.6MB in the end (delta: 478.2MB). Free memory was 90.1MB in the beginning and 365.2MB in the end (delta: -275.1MB). Peak memory consumption was 204.6MB. Max. memory is 8.0GB. [2022-12-12 18:35:03,217 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.13ms. Allocated memory is still 182.5MB. Free memory was 158.9MB in the beginning and 158.8MB in the end (delta: 91.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 547.27ms. Allocated memory is still 182.5MB. Free memory was 156.7MB in the beginning and 130.4MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.99ms. Allocated memory is still 182.5MB. Free memory was 130.4MB in the beginning and 127.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.24ms. Allocated memory is still 182.5MB. Free memory was 127.8MB in the beginning and 126.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 685.65ms. Allocated memory is still 182.5MB. Free memory was 125.7MB in the beginning and 91.1MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 14394.68ms. Allocated memory was 182.5MB in the beginning and 660.6MB in the end (delta: 478.2MB). Free memory was 90.1MB in the beginning and 365.2MB in the end (delta: -275.1MB). Peak memory consumption was 204.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 115 PlacesBefore, 76 PlacesAfterwards, 107 TransitionsBefore, 67 TransitionsAfterwards, 2008 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 5 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3307, independent: 3180, independent conditional: 3180, independent unconditional: 0, dependent: 127, dependent conditional: 127, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3307, independent: 3180, independent conditional: 0, independent unconditional: 3180, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3307, independent: 3180, independent conditional: 0, independent unconditional: 3180, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3307, independent: 3180, independent conditional: 0, independent unconditional: 3180, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1889, independent: 1841, independent conditional: 0, independent unconditional: 1841, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1889, independent: 1813, independent conditional: 0, independent unconditional: 1813, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 241, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3307, independent: 1339, independent conditional: 0, independent unconditional: 1339, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 1889, unknown conditional: 0, unknown unconditional: 1889] , Statistics on independence cache: Total cache size (in pairs): 3415, Positive cache size: 3367, Positive conditional cache size: 0, Positive unconditional cache size: 3367, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t657; [L839] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t657, ((void *)0), P0, ((void *)0))=-1, t657={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t658; [L841] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t658, ((void *)0), P1, ((void *)0))=0, t657={5:0}, t658={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t659; [L843] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t659, ((void *)0), P2, ((void *)0))=1, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 843]: 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: 841]: 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, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 324 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 324 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1106 IncrementalHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 4 mSDtfsCounter, 1106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3801occurred in iteration=9, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 8016 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 578 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 18:35:03,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...