/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:28:07,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:28:07,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:28:07,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:28:07,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:28:07,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:28:07,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:28:07,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:28:07,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:28:07,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:28:07,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:28:07,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:28:07,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:28:07,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:28:07,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:28:07,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:28:07,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:28:07,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:28:07,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:28:07,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:28:07,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:28:07,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:28:07,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:28:07,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:28:07,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:28:07,823 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:28:07,823 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:28:07,824 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:28:07,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:28:07,825 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:28:07,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:28:07,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:28:07,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:28:07,827 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:28:07,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:28:07,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:28:07,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:28:07,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:28:07,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:28:07,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:28:07,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:28:07,835 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-05 20:28:07,866 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:28:07,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:28:07,868 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:28:07,868 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:28:07,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:28:07,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:28:07,870 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:28:07,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:28:07,870 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:28:07,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:28:07,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:28:07,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:28:07,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:28:07,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:28:07,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:28:07,872 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:28:07,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:28:07,872 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:28:07,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:28:07,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:28:07,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:28:07,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:28:07,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:28:07,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:28:07,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:28:07,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:28:07,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:28:07,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:28:07,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:28:07,874 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:28:07,874 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 20:28:08,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:28:08,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:28:08,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:28:08,204 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:28:08,204 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:28:08,205 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2022-12-05 20:28:09,394 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:28:09,683 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:28:09,683 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2022-12-05 20:28:09,695 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265805586/6f9d55bd1f6847d3b266911e8f062ad3/FLAG3f07bb4a1 [2022-12-05 20:28:09,709 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265805586/6f9d55bd1f6847d3b266911e8f062ad3 [2022-12-05 20:28:09,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:28:09,712 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:28:09,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:28:09,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:28:09,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:28:09,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:28:09" (1/1) ... [2022-12-05 20:28:09,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e306ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:09, skipping insertion in model container [2022-12-05 20:28:09,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:28:09" (1/1) ... [2022-12-05 20:28:09,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:28:09,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:28:09,893 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-05 20:28:10,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:28:10,055 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:28:10,069 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-05 20:28:10,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:28:10,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:28:10,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:28:10,202 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:28:10,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:10 WrapperNode [2022-12-05 20:28:10,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:28:10,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:28:10,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:28:10,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:28:10,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:10" (1/1) ... [2022-12-05 20:28:10,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:10" (1/1) ... [2022-12-05 20:28:10,276 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-05 20:28:10,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:28:10,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:28:10,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:28:10,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:28:10,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:10" (1/1) ... [2022-12-05 20:28:10,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:10" (1/1) ... [2022-12-05 20:28:10,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:10" (1/1) ... [2022-12-05 20:28:10,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:10" (1/1) ... [2022-12-05 20:28:10,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:10" (1/1) ... [2022-12-05 20:28:10,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:10" (1/1) ... [2022-12-05 20:28:10,313 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:10" (1/1) ... [2022-12-05 20:28:10,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:10" (1/1) ... [2022-12-05 20:28:10,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:28:10,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:28:10,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:28:10,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:28:10,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:10" (1/1) ... [2022-12-05 20:28:10,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:28:10,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:28:10,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 20:28:10,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 20:28:10,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:28:10,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:28:10,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:28:10,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:28:10,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:28:10,414 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:28:10,415 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:28:10,415 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:28:10,415 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:28:10,415 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:28:10,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:28:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:28:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:28:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:28:10,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:28:10,417 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:28:10,594 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:28:10,598 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:28:10,964 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:28:11,102 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:28:11,102 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:28:11,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:28:11 BoogieIcfgContainer [2022-12-05 20:28:11,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:28:11,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:28:11,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:28:11,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:28:11,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:28:09" (1/3) ... [2022-12-05 20:28:11,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463b1cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:28:11, skipping insertion in model container [2022-12-05 20:28:11,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:28:10" (2/3) ... [2022-12-05 20:28:11,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463b1cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:28:11, skipping insertion in model container [2022-12-05 20:28:11,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:28:11" (3/3) ... [2022-12-05 20:28:11,112 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2022-12-05 20:28:11,130 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:28:11,130 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:28:11,130 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:28:11,182 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:28:11,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 20:28:11,259 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 20:28:11,260 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:28:11,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 20:28:11,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 20:28:11,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-05 20:28:11,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:28:11,296 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-05 20:28:11,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-05 20:28:11,356 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 20:28:11,357 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:28:11,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 20:28:11,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-05 20:28:11,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-05 20:28:17,267 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-05 20:28:17,292 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:28:17,299 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;@791ac55c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:28:17,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:28:17,308 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-05 20:28:17,308 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:28:17,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:17,310 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:17,311 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:17,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:17,316 INFO L85 PathProgramCache]: Analyzing trace with hash -129563323, now seen corresponding path program 1 times [2022-12-05 20:28:17,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:17,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668607664] [2022-12-05 20:28:17,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:17,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:17,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:17,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668607664] [2022-12-05 20:28:17,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668607664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:17,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:17,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:28:17,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988069746] [2022-12-05 20:28:17,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:17,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:28:17,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:17,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:28:17,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:28:17,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 20:28:17,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:17,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:17,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 20:28:17,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:18,081 INFO L130 PetriNetUnfolder]: 615/1011 cut-off events. [2022-12-05 20:28:18,081 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-05 20:28:18,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1982 conditions, 1011 events. 615/1011 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4958 event pairs, 129 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 1971. Up to 703 conditions per place. [2022-12-05 20:28:18,089 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 23 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2022-12-05 20:28:18,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 131 flow [2022-12-05 20:28:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:28:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:28:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-05 20:28:18,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-05 20:28:18,101 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 43 transitions. [2022-12-05 20:28:18,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 131 flow [2022-12-05 20:28:18,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:28:18,106 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 50 flow [2022-12-05 20:28:18,108 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-05 20:28:18,111 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-05 20:28:18,111 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 50 flow [2022-12-05 20:28:18,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:18,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:18,112 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:18,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:28:18,112 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:18,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:18,112 INFO L85 PathProgramCache]: Analyzing trace with hash 43753441, now seen corresponding path program 1 times [2022-12-05 20:28:18,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:18,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232515175] [2022-12-05 20:28:18,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:18,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:18,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:18,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232515175] [2022-12-05 20:28:18,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232515175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:18,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:18,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:28:18,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322834742] [2022-12-05 20:28:18,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:18,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:28:18,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:28:18,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:28:18,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-05 20:28:18,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:18,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:18,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-05 20:28:18,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:18,437 INFO L130 PetriNetUnfolder]: 489/787 cut-off events. [2022-12-05 20:28:18,438 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-05 20:28:18,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 787 events. 489/787 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3519 event pairs, 117 based on Foata normal form. 8/794 useless extension candidates. Maximal degree in co-relation 1609. Up to 689 conditions per place. [2022-12-05 20:28:18,444 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 27 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-05 20:28:18,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 140 flow [2022-12-05 20:28:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:28:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:28:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-05 20:28:18,446 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-05 20:28:18,447 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 50 flow. Second operand 3 states and 37 transitions. [2022-12-05 20:28:18,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 140 flow [2022-12-05 20:28:18,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:28:18,448 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2022-12-05 20:28:18,448 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-12-05 20:28:18,449 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -4 predicate places. [2022-12-05 20:28:18,449 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2022-12-05 20:28:18,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:18,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:18,450 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:18,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:28:18,450 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:18,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:18,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1356355945, now seen corresponding path program 1 times [2022-12-05 20:28:18,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:18,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139318318] [2022-12-05 20:28:18,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:18,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:18,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:18,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139318318] [2022-12-05 20:28:18,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139318318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:18,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:18,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:28:18,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426887070] [2022-12-05 20:28:18,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:18,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:28:18,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:18,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:28:18,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:28:18,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-05 20:28:18,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:18,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:18,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-05 20:28:18,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:18,953 INFO L130 PetriNetUnfolder]: 535/860 cut-off events. [2022-12-05 20:28:18,953 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2022-12-05 20:28:18,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 860 events. 535/860 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3686 event pairs, 160 based on Foata normal form. 4/863 useless extension candidates. Maximal degree in co-relation 1970. Up to 733 conditions per place. [2022-12-05 20:28:18,961 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 25 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-05 20:28:18,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 144 flow [2022-12-05 20:28:18,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:28:18,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:28:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-05 20:28:18,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2022-12-05 20:28:18,963 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 3 states and 34 transitions. [2022-12-05 20:28:18,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 144 flow [2022-12-05 20:28:18,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:28:18,965 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 81 flow [2022-12-05 20:28:18,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2022-12-05 20:28:18,967 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-05 20:28:18,967 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 81 flow [2022-12-05 20:28:18,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:18,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:18,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:18,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:28:18,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:18,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:18,972 INFO L85 PathProgramCache]: Analyzing trace with hash -463684250, now seen corresponding path program 1 times [2022-12-05 20:28:18,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:18,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058860179] [2022-12-05 20:28:18,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:18,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:19,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058860179] [2022-12-05 20:28:19,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058860179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:19,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:19,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:28:19,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858230479] [2022-12-05 20:28:19,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:19,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:28:19,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:19,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:28:19,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:28:19,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-05 20:28:19,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:19,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:19,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-05 20:28:19,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:19,516 INFO L130 PetriNetUnfolder]: 509/824 cut-off events. [2022-12-05 20:28:19,517 INFO L131 PetriNetUnfolder]: For 305/305 co-relation queries the response was YES. [2022-12-05 20:28:19,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 824 events. 509/824 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3533 event pairs, 150 based on Foata normal form. 10/833 useless extension candidates. Maximal degree in co-relation 2012. Up to 644 conditions per place. [2022-12-05 20:28:19,522 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 31 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2022-12-05 20:28:19,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 193 flow [2022-12-05 20:28:19,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:28:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:28:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-05 20:28:19,525 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43 [2022-12-05 20:28:19,525 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 81 flow. Second operand 4 states and 43 transitions. [2022-12-05 20:28:19,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 193 flow [2022-12-05 20:28:19,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:28:19,528 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 103 flow [2022-12-05 20:28:19,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-05 20:28:19,529 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-05 20:28:19,530 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 103 flow [2022-12-05 20:28:19,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:19,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:19,530 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:19,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:28:19,530 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:19,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:19,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2117032307, now seen corresponding path program 1 times [2022-12-05 20:28:19,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:19,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490066298] [2022-12-05 20:28:19,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:19,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:19,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:19,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490066298] [2022-12-05 20:28:19,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490066298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:19,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:19,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:28:19,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927574841] [2022-12-05 20:28:19,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:19,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:28:19,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:19,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:28:19,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:28:19,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-05 20:28:19,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:19,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:19,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-05 20:28:19,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:19,953 INFO L130 PetriNetUnfolder]: 510/828 cut-off events. [2022-12-05 20:28:19,953 INFO L131 PetriNetUnfolder]: For 550/550 co-relation queries the response was YES. [2022-12-05 20:28:19,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 828 events. 510/828 cut-off events. For 550/550 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3566 event pairs, 103 based on Foata normal form. 2/829 useless extension candidates. Maximal degree in co-relation 2189. Up to 576 conditions per place. [2022-12-05 20:28:19,959 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 32 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2022-12-05 20:28:19,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 227 flow [2022-12-05 20:28:19,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:28:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:28:19,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-05 20:28:19,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-05 20:28:19,960 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 103 flow. Second operand 4 states and 44 transitions. [2022-12-05 20:28:19,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 227 flow [2022-12-05 20:28:19,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 218 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 20:28:19,963 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 126 flow [2022-12-05 20:28:19,963 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-05 20:28:19,963 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-05 20:28:19,964 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 126 flow [2022-12-05 20:28:19,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:19,964 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:19,964 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:19,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:28:19,964 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:19,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:19,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2117114147, now seen corresponding path program 2 times [2022-12-05 20:28:19,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:19,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525036208] [2022-12-05 20:28:19,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:19,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:20,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:20,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:20,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525036208] [2022-12-05 20:28:20,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525036208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:20,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:20,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:28:20,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241131845] [2022-12-05 20:28:20,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:20,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:28:20,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:20,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:28:20,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:28:20,351 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-05 20:28:20,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:20,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:20,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-05 20:28:20,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:20,517 INFO L130 PetriNetUnfolder]: 501/813 cut-off events. [2022-12-05 20:28:20,518 INFO L131 PetriNetUnfolder]: For 822/822 co-relation queries the response was YES. [2022-12-05 20:28:20,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 813 events. 501/813 cut-off events. For 822/822 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3460 event pairs, 110 based on Foata normal form. 6/818 useless extension candidates. Maximal degree in co-relation 2335. Up to 574 conditions per place. [2022-12-05 20:28:20,523 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 31 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2022-12-05 20:28:20,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 236 flow [2022-12-05 20:28:20,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:28:20,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:28:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-05 20:28:20,525 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43 [2022-12-05 20:28:20,525 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 126 flow. Second operand 4 states and 43 transitions. [2022-12-05 20:28:20,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 236 flow [2022-12-05 20:28:20,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 230 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 20:28:20,528 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 142 flow [2022-12-05 20:28:20,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2022-12-05 20:28:20,529 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-12-05 20:28:20,529 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 142 flow [2022-12-05 20:28:20,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:20,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:20,529 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:20,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:28:20,529 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:20,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:20,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2083010853, now seen corresponding path program 1 times [2022-12-05 20:28:20,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:20,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975039904] [2022-12-05 20:28:20,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:20,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:21,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:21,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975039904] [2022-12-05 20:28:21,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975039904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:21,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:21,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:28:21,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323020966] [2022-12-05 20:28:21,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:21,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:28:21,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:21,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:28:21,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:28:21,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:28:21,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 142 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:21,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:21,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:28:21,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:21,315 INFO L130 PetriNetUnfolder]: 1052/1615 cut-off events. [2022-12-05 20:28:21,315 INFO L131 PetriNetUnfolder]: For 2137/2137 co-relation queries the response was YES. [2022-12-05 20:28:21,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4538 conditions, 1615 events. 1052/1615 cut-off events. For 2137/2137 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7089 event pairs, 210 based on Foata normal form. 52/1667 useless extension candidates. Maximal degree in co-relation 4520. Up to 998 conditions per place. [2022-12-05 20:28:21,324 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 44 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2022-12-05 20:28:21,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 354 flow [2022-12-05 20:28:21,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:28:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:28:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-05 20:28:21,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43 [2022-12-05 20:28:21,326 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 142 flow. Second operand 4 states and 43 transitions. [2022-12-05 20:28:21,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 354 flow [2022-12-05 20:28:21,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 330 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:28:21,332 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 204 flow [2022-12-05 20:28:21,332 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-12-05 20:28:21,332 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-05 20:28:21,332 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 204 flow [2022-12-05 20:28:21,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:21,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:21,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:21,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:28:21,333 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:21,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:21,334 INFO L85 PathProgramCache]: Analyzing trace with hash -709641980, now seen corresponding path program 1 times [2022-12-05 20:28:21,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:21,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001726081] [2022-12-05 20:28:21,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:21,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:21,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:21,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001726081] [2022-12-05 20:28:21,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001726081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:21,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:21,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:28:21,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958025369] [2022-12-05 20:28:21,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:21,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:28:21,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:21,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:28:21,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:28:21,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-05 20:28:21,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:21,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:21,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-05 20:28:21,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:21,906 INFO L130 PetriNetUnfolder]: 662/1102 cut-off events. [2022-12-05 20:28:21,906 INFO L131 PetriNetUnfolder]: For 1631/1631 co-relation queries the response was YES. [2022-12-05 20:28:21,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3419 conditions, 1102 events. 662/1102 cut-off events. For 1631/1631 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5358 event pairs, 167 based on Foata normal form. 4/1105 useless extension candidates. Maximal degree in co-relation 3399. Up to 814 conditions per place. [2022-12-05 20:28:21,914 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 39 selfloop transitions, 13 changer transitions 0/55 dead transitions. [2022-12-05 20:28:21,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 386 flow [2022-12-05 20:28:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:28:21,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:28:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-05 20:28:21,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.408 [2022-12-05 20:28:21,916 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 204 flow. Second operand 5 states and 51 transitions. [2022-12-05 20:28:21,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 386 flow [2022-12-05 20:28:21,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 370 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 20:28:21,923 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 236 flow [2022-12-05 20:28:21,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-12-05 20:28:21,925 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2022-12-05 20:28:21,926 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 236 flow [2022-12-05 20:28:21,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:21,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:21,926 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:21,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:28:21,926 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:21,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:21,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1206029750, now seen corresponding path program 2 times [2022-12-05 20:28:21,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:21,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812916817] [2022-12-05 20:28:21,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:22,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:22,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812916817] [2022-12-05 20:28:22,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812916817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:22,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:22,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:28:22,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274744816] [2022-12-05 20:28:22,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:22,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:28:22,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:22,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:28:22,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:28:22,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-05 20:28:22,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:22,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:22,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-05 20:28:22,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:22,476 INFO L130 PetriNetUnfolder]: 680/1131 cut-off events. [2022-12-05 20:28:22,476 INFO L131 PetriNetUnfolder]: For 2134/2137 co-relation queries the response was YES. [2022-12-05 20:28:22,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3701 conditions, 1131 events. 680/1131 cut-off events. For 2134/2137 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5567 event pairs, 171 based on Foata normal form. 5/1135 useless extension candidates. Maximal degree in co-relation 3679. Up to 840 conditions per place. [2022-12-05 20:28:22,482 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 41 selfloop transitions, 16 changer transitions 0/60 dead transitions. [2022-12-05 20:28:22,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 452 flow [2022-12-05 20:28:22,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:28:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:28:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-12-05 20:28:22,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-05 20:28:22,484 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 236 flow. Second operand 5 states and 50 transitions. [2022-12-05 20:28:22,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 452 flow [2022-12-05 20:28:22,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 422 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 20:28:22,490 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 304 flow [2022-12-05 20:28:22,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2022-12-05 20:28:22,490 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2022-12-05 20:28:22,490 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 304 flow [2022-12-05 20:28:22,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:22,491 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:22,491 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:22,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:28:22,491 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:22,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:22,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1203456440, now seen corresponding path program 3 times [2022-12-05 20:28:22,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:22,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055240263] [2022-12-05 20:28:22,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:22,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:22,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:22,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055240263] [2022-12-05 20:28:22,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055240263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:22,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:22,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:28:22,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837842890] [2022-12-05 20:28:22,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:22,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:28:22,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:22,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:28:22,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:28:22,737 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-05 20:28:22,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:22,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:22,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-05 20:28:22,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:22,978 INFO L130 PetriNetUnfolder]: 746/1236 cut-off events. [2022-12-05 20:28:22,978 INFO L131 PetriNetUnfolder]: For 3158/3164 co-relation queries the response was YES. [2022-12-05 20:28:22,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4363 conditions, 1236 events. 746/1236 cut-off events. For 3158/3164 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6240 event pairs, 165 based on Foata normal form. 10/1245 useless extension candidates. Maximal degree in co-relation 4340. Up to 838 conditions per place. [2022-12-05 20:28:22,987 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 41 selfloop transitions, 20 changer transitions 0/64 dead transitions. [2022-12-05 20:28:22,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 510 flow [2022-12-05 20:28:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:28:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:28:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-12-05 20:28:22,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36 [2022-12-05 20:28:22,989 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 304 flow. Second operand 6 states and 54 transitions. [2022-12-05 20:28:22,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 510 flow [2022-12-05 20:28:22,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 498 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-05 20:28:22,997 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 374 flow [2022-12-05 20:28:22,997 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-05 20:28:22,998 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2022-12-05 20:28:22,998 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 374 flow [2022-12-05 20:28:22,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:22,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:22,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:22,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:28:22,998 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:22,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1204950950, now seen corresponding path program 4 times [2022-12-05 20:28:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:22,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669020766] [2022-12-05 20:28:22,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:22,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:23,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:23,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:23,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669020766] [2022-12-05 20:28:23,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669020766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:23,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:23,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:28:23,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898177800] [2022-12-05 20:28:23,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:23,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:28:23,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:23,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:28:23,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:28:23,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:28:23,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 374 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:23,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:23,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:28:23,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:24,158 INFO L130 PetriNetUnfolder]: 1464/2246 cut-off events. [2022-12-05 20:28:24,159 INFO L131 PetriNetUnfolder]: For 7735/7735 co-relation queries the response was YES. [2022-12-05 20:28:24,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8690 conditions, 2246 events. 1464/2246 cut-off events. For 7735/7735 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10492 event pairs, 146 based on Foata normal form. 24/2270 useless extension candidates. Maximal degree in co-relation 8664. Up to 1317 conditions per place. [2022-12-05 20:28:24,171 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 61 selfloop transitions, 32 changer transitions 1/94 dead transitions. [2022-12-05 20:28:24,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 783 flow [2022-12-05 20:28:24,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:28:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:28:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2022-12-05 20:28:24,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.335 [2022-12-05 20:28:24,174 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 374 flow. Second operand 8 states and 67 transitions. [2022-12-05 20:28:24,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 783 flow [2022-12-05 20:28:24,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 94 transitions, 754 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-05 20:28:24,195 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 579 flow [2022-12-05 20:28:24,195 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=579, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2022-12-05 20:28:24,196 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2022-12-05 20:28:24,196 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 579 flow [2022-12-05 20:28:24,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:24,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:24,196 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:24,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:28:24,196 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:24,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:24,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1280222883, now seen corresponding path program 1 times [2022-12-05 20:28:24,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:24,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163797218] [2022-12-05 20:28:24,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:24,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:24,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:24,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163797218] [2022-12-05 20:28:24,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163797218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:24,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:24,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:28:24,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088241691] [2022-12-05 20:28:24,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:24,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:28:24,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:24,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:28:24,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:28:24,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 20:28:24,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 579 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:24,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:24,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 20:28:24,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:24,567 INFO L130 PetriNetUnfolder]: 731/1297 cut-off events. [2022-12-05 20:28:24,567 INFO L131 PetriNetUnfolder]: For 7532/7633 co-relation queries the response was YES. [2022-12-05 20:28:24,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5741 conditions, 1297 events. 731/1297 cut-off events. For 7532/7633 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7382 event pairs, 101 based on Foata normal form. 215/1492 useless extension candidates. Maximal degree in co-relation 5711. Up to 534 conditions per place. [2022-12-05 20:28:24,576 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 81 selfloop transitions, 5 changer transitions 6/102 dead transitions. [2022-12-05 20:28:24,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 1138 flow [2022-12-05 20:28:24,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:28:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:28:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-05 20:28:24,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-05 20:28:24,578 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 579 flow. Second operand 4 states and 52 transitions. [2022-12-05 20:28:24,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 1138 flow [2022-12-05 20:28:24,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 102 transitions, 1081 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-05 20:28:24,589 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 535 flow [2022-12-05 20:28:24,590 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=535, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2022-12-05 20:28:24,590 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2022-12-05 20:28:24,590 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 535 flow [2022-12-05 20:28:24,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:24,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:24,591 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:24,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:28:24,591 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:24,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:24,591 INFO L85 PathProgramCache]: Analyzing trace with hash 323950283, now seen corresponding path program 1 times [2022-12-05 20:28:24,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:24,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172140569] [2022-12-05 20:28:24,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:24,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:24,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:24,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172140569] [2022-12-05 20:28:24,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172140569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:24,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:24,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:28:24,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492429657] [2022-12-05 20:28:24,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:24,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:28:24,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:24,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:28:24,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:28:24,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 20:28:24,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 535 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:24,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:24,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 20:28:24,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:24,966 INFO L130 PetriNetUnfolder]: 541/1017 cut-off events. [2022-12-05 20:28:24,967 INFO L131 PetriNetUnfolder]: For 5917/6026 co-relation queries the response was YES. [2022-12-05 20:28:24,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4716 conditions, 1017 events. 541/1017 cut-off events. For 5917/6026 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5851 event pairs, 98 based on Foata normal form. 174/1162 useless extension candidates. Maximal degree in co-relation 4684. Up to 400 conditions per place. [2022-12-05 20:28:24,975 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 73 selfloop transitions, 8 changer transitions 6/97 dead transitions. [2022-12-05 20:28:24,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 97 transitions, 1019 flow [2022-12-05 20:28:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:28:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:28:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-05 20:28:24,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.528 [2022-12-05 20:28:24,976 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 535 flow. Second operand 5 states and 66 transitions. [2022-12-05 20:28:24,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 97 transitions, 1019 flow [2022-12-05 20:28:24,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 97 transitions, 932 flow, removed 30 selfloop flow, removed 4 redundant places. [2022-12-05 20:28:24,986 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 487 flow [2022-12-05 20:28:24,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=487, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2022-12-05 20:28:24,986 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places. [2022-12-05 20:28:24,987 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 487 flow [2022-12-05 20:28:24,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:24,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:24,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:24,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:28:24,987 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash -742701358, now seen corresponding path program 1 times [2022-12-05 20:28:24,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:24,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161868369] [2022-12-05 20:28:24,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:24,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:25,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:25,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161868369] [2022-12-05 20:28:25,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161868369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:25,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:25,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:28:25,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099000999] [2022-12-05 20:28:25,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:25,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:28:25,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:25,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:28:25,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:28:25,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 20:28:25,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 487 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:25,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:25,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 20:28:25,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:25,331 INFO L130 PetriNetUnfolder]: 516/969 cut-off events. [2022-12-05 20:28:25,331 INFO L131 PetriNetUnfolder]: For 4700/4795 co-relation queries the response was YES. [2022-12-05 20:28:25,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4611 conditions, 969 events. 516/969 cut-off events. For 4700/4795 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5573 event pairs, 91 based on Foata normal form. 101/1052 useless extension candidates. Maximal degree in co-relation 4577. Up to 401 conditions per place. [2022-12-05 20:28:25,338 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 47 selfloop transitions, 11 changer transitions 20/85 dead transitions. [2022-12-05 20:28:25,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 85 transitions, 853 flow [2022-12-05 20:28:25,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:28:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:28:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-05 20:28:25,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41333333333333333 [2022-12-05 20:28:25,339 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 487 flow. Second operand 6 states and 62 transitions. [2022-12-05 20:28:25,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 85 transitions, 853 flow [2022-12-05 20:28:25,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 797 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-05 20:28:25,347 INFO L231 Difference]: Finished difference. Result has 69 places, 44 transitions, 372 flow [2022-12-05 20:28:25,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=69, PETRI_TRANSITIONS=44} [2022-12-05 20:28:25,348 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2022-12-05 20:28:25,348 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 44 transitions, 372 flow [2022-12-05 20:28:25,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:25,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:25,349 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:25,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 20:28:25,349 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:25,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:25,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1894305941, now seen corresponding path program 1 times [2022-12-05 20:28:25,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:25,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990051625] [2022-12-05 20:28:25,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:25,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:25,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990051625] [2022-12-05 20:28:25,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990051625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:25,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:25,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:28:25,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505657623] [2022-12-05 20:28:25,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:25,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:28:25,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:25,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:28:25,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:28:25,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:28:25,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 44 transitions, 372 flow. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:25,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:25,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:28:25,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:26,049 INFO L130 PetriNetUnfolder]: 437/773 cut-off events. [2022-12-05 20:28:26,049 INFO L131 PetriNetUnfolder]: For 3848/3848 co-relation queries the response was YES. [2022-12-05 20:28:26,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3859 conditions, 773 events. 437/773 cut-off events. For 3848/3848 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3594 event pairs, 39 based on Foata normal form. 1/774 useless extension candidates. Maximal degree in co-relation 3825. Up to 423 conditions per place. [2022-12-05 20:28:26,053 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 31 selfloop transitions, 6 changer transitions 59/96 dead transitions. [2022-12-05 20:28:26,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 96 transitions, 995 flow [2022-12-05 20:28:26,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:28:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:28:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-12-05 20:28:26,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3466666666666667 [2022-12-05 20:28:26,055 INFO L175 Difference]: Start difference. First operand has 69 places, 44 transitions, 372 flow. Second operand 6 states and 52 transitions. [2022-12-05 20:28:26,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 96 transitions, 995 flow [2022-12-05 20:28:26,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 96 transitions, 851 flow, removed 21 selfloop flow, removed 14 redundant places. [2022-12-05 20:28:26,065 INFO L231 Difference]: Finished difference. Result has 62 places, 32 transitions, 225 flow [2022-12-05 20:28:26,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=62, PETRI_TRANSITIONS=32} [2022-12-05 20:28:26,065 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2022-12-05 20:28:26,066 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 32 transitions, 225 flow [2022-12-05 20:28:26,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:26,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:26,066 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:26,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 20:28:26,066 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:26,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:26,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1913331439, now seen corresponding path program 2 times [2022-12-05 20:28:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:26,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652126374] [2022-12-05 20:28:26,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:26,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:28:26,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:26,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652126374] [2022-12-05 20:28:26,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652126374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:26,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:26,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:28:26,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377033176] [2022-12-05 20:28:26,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:26,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:28:26,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:26,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:28:26,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:28:26,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-05 20:28:26,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 32 transitions, 225 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:26,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:26,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-05 20:28:26,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:27,149 INFO L130 PetriNetUnfolder]: 66/168 cut-off events. [2022-12-05 20:28:27,149 INFO L131 PetriNetUnfolder]: For 555/555 co-relation queries the response was YES. [2022-12-05 20:28:27,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 168 events. 66/168 cut-off events. For 555/555 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 608 event pairs, 10 based on Foata normal form. 1/169 useless extension candidates. Maximal degree in co-relation 784. Up to 63 conditions per place. [2022-12-05 20:28:27,150 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 35 selfloop transitions, 4 changer transitions 18/59 dead transitions. [2022-12-05 20:28:27,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 524 flow [2022-12-05 20:28:27,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:28:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:28:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-12-05 20:28:27,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-05 20:28:27,152 INFO L175 Difference]: Start difference. First operand has 62 places, 32 transitions, 225 flow. Second operand 6 states and 50 transitions. [2022-12-05 20:28:27,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 524 flow [2022-12-05 20:28:27,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 371 flow, removed 29 selfloop flow, removed 15 redundant places. [2022-12-05 20:28:27,155 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 135 flow [2022-12-05 20:28:27,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2022-12-05 20:28:27,156 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2022-12-05 20:28:27,156 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 135 flow [2022-12-05 20:28:27,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:27,156 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:27,156 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:27,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 20:28:27,157 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:27,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:27,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1886218883, now seen corresponding path program 3 times [2022-12-05 20:28:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:27,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484106810] [2022-12-05 20:28:27,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:28:27,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:28:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:28:27,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:28:27,295 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:28:27,296 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:28:27,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 20:28:27,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:28:27,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 20:28:27,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 20:28:27,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:28:27,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 20:28:27,300 INFO L458 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:27,307 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:28:27,307 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:28:27,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:28:27 BasicIcfg [2022-12-05 20:28:27,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:28:27,376 INFO L158 Benchmark]: Toolchain (without parser) took 17664.14ms. Allocated memory was 184.5MB in the beginning and 734.0MB in the end (delta: 549.5MB). Free memory was 143.7MB in the beginning and 448.6MB in the end (delta: -304.9MB). Peak memory consumption was 244.6MB. Max. memory is 8.0GB. [2022-12-05 20:28:27,377 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory was 160.4MB in the beginning and 160.4MB in the end (delta: 85.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:28:27,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.00ms. Allocated memory is still 184.5MB. Free memory was 143.2MB in the beginning and 117.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-05 20:28:27,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.76ms. Allocated memory is still 184.5MB. Free memory was 117.5MB in the beginning and 114.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:28:27,378 INFO L158 Benchmark]: Boogie Preprocessor took 55.50ms. Allocated memory is still 184.5MB. Free memory was 114.9MB in the beginning and 112.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:28:27,378 INFO L158 Benchmark]: RCFGBuilder took 771.25ms. Allocated memory is still 184.5MB. Free memory was 112.8MB in the beginning and 80.3MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-05 20:28:27,378 INFO L158 Benchmark]: TraceAbstraction took 16269.61ms. Allocated memory was 184.5MB in the beginning and 734.0MB in the end (delta: 549.5MB). Free memory was 79.8MB in the beginning and 448.6MB in the end (delta: -368.9MB). Peak memory consumption was 181.6MB. Max. memory is 8.0GB. [2022-12-05 20:28:27,379 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.15ms. Allocated memory is still 184.5MB. Free memory was 160.4MB in the beginning and 160.4MB in the end (delta: 85.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 490.00ms. Allocated memory is still 184.5MB. Free memory was 143.2MB in the beginning and 117.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.76ms. Allocated memory is still 184.5MB. Free memory was 117.5MB in the beginning and 114.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.50ms. Allocated memory is still 184.5MB. Free memory was 114.9MB in the beginning and 112.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 771.25ms. Allocated memory is still 184.5MB. Free memory was 112.8MB in the beginning and 80.3MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 16269.61ms. Allocated memory was 184.5MB in the beginning and 734.0MB in the end (delta: 549.5MB). Free memory was 79.8MB in the beginning and 448.6MB in the end (delta: -368.9MB). Peak memory consumption was 181.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 111 PlacesBefore, 34 PlacesAfterwards, 103 TransitionsBefore, 25 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1464, independent: 1411, independent conditional: 1411, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1464, independent: 1411, independent conditional: 0, independent unconditional: 1411, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1464, independent: 1411, independent conditional: 0, independent unconditional: 1411, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1464, independent: 1411, independent conditional: 0, independent unconditional: 1411, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1194, independent: 1153, independent conditional: 0, independent unconditional: 1153, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1194, independent: 1127, independent conditional: 0, independent unconditional: 1127, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 346, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 287, dependent conditional: 0, dependent unconditional: 287, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1464, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 1194, unknown conditional: 0, unknown unconditional: 1194] , Statistics on independence cache: Total cache size (in pairs): 1929, Positive cache size: 1888, Positive conditional cache size: 0, Positive unconditional cache size: 1888, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, 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; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2516, ((void *)0), P0, ((void *)0))=-1, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2517, ((void *)0), P1, ((void *)0))=0, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2518, ((void *)0), P2, ((void *)0))=1, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 816]: 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: 820]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 428 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 428 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1044 IncrementalHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 25 mSDtfsCounter, 1044 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=579occurred in iteration=11, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1740 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 20:28:27,408 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...