/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:43:59,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:43:59,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:43:59,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:43:59,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:43:59,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:43:59,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:43:59,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:43:59,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:43:59,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:43:59,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:43:59,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:43:59,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:43:59,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:43:59,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:43:59,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:43:59,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:43:59,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:43:59,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:43:59,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:43:59,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:43:59,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:43:59,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:43:59,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:43:59,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:43:59,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:43:59,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:43:59,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:43:59,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:43:59,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:43:59,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:43:59,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:43:59,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:43:59,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:43:59,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:43:59,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:43:59,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:43:59,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:43:59,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:43:59,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:43:59,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:43:59,863 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 21:43:59,889 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:43:59,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:43:59,891 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:43:59,891 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:43:59,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:43:59,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:43:59,892 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:43:59,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:43:59,892 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:43:59,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:43:59,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:43:59,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:43:59,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:43:59,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:43:59,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:43:59,894 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:43:59,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:43:59,894 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:43:59,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:43:59,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:43:59,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:43:59,894 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:43:59,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:43:59,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:43:59,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:43:59,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:43:59,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:43:59,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:43:59,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:43:59,895 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:43:59,895 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:44:00,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:44:00,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:44:00,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:44:00,192 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:44:00,199 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:44:00,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 21:44:01,233 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:44:01,448 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:44:01,448 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 21:44:01,475 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0827d3cf/f7c9cabf91bc461897a5e72c6e887f05/FLAG1ad1b935b [2022-12-12 21:44:01,489 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0827d3cf/f7c9cabf91bc461897a5e72c6e887f05 [2022-12-12 21:44:01,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:44:01,495 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:44:01,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:44:01,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:44:01,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:44:01,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:44:01" (1/1) ... [2022-12-12 21:44:01,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4a1d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:44:01, skipping insertion in model container [2022-12-12 21:44:01,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:44:01" (1/1) ... [2022-12-12 21:44:01,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:44:01,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:44:01,719 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-12 21:44:01,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:44:01,947 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:44:01,956 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-12 21:44:01,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:44:01,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:44:01,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:44:02,032 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:44:02,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:44:02 WrapperNode [2022-12-12 21:44:02,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:44:02,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:44:02,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:44:02,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:44:02,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:44:02" (1/1) ... [2022-12-12 21:44:02,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:44:02" (1/1) ... [2022-12-12 21:44:02,102 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-12 21:44:02,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:44:02,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:44:02,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:44:02,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:44:02,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:44:02" (1/1) ... [2022-12-12 21:44:02,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:44:02" (1/1) ... [2022-12-12 21:44:02,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:44:02" (1/1) ... [2022-12-12 21:44:02,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:44:02" (1/1) ... [2022-12-12 21:44:02,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:44:02" (1/1) ... [2022-12-12 21:44:02,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:44:02" (1/1) ... [2022-12-12 21:44:02,130 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:44:02" (1/1) ... [2022-12-12 21:44:02,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:44:02" (1/1) ... [2022-12-12 21:44:02,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:44:02,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:44:02,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:44:02,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:44:02,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:44:02" (1/1) ... [2022-12-12 21:44:02,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:44:02,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:44:02,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 21:44:02,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 21:44:02,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:44:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:44:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:44:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:44:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:44:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:44:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:44:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:44:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:44:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:44:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:44:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:44:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:44:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:44:02,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:44:02,208 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 21:44:02,381 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:44:02,383 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:44:02,663 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:44:02,810 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:44:02,810 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:44:02,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:44:02 BoogieIcfgContainer [2022-12-12 21:44:02,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:44:02,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:44:02,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:44:02,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:44:02,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:44:01" (1/3) ... [2022-12-12 21:44:02,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b35bdd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:44:02, skipping insertion in model container [2022-12-12 21:44:02,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:44:02" (2/3) ... [2022-12-12 21:44:02,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b35bdd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:44:02, skipping insertion in model container [2022-12-12 21:44:02,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:44:02" (3/3) ... [2022-12-12 21:44:02,821 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-12 21:44:02,835 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:44:02,835 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:44:02,836 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:44:02,887 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:44:02,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-12 21:44:03,056 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-12 21:44:03,056 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:44:03,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 21:44:03,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-12 21:44:03,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-12 21:44:03,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:44:03,093 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-12 21:44:03,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-12 21:44:03,112 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-12 21:44:03,112 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:44:03,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 21:44:03,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-12 21:44:03,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 1876 [2022-12-12 21:44:11,042 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-12 21:44:11,062 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:44:11,076 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;@249f0053, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:44:11,076 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 21:44:11,081 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-12 21:44:11,082 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:44:11,082 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:11,085 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:11,086 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-12 21:44:11,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:11,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2036216999, now seen corresponding path program 1 times [2022-12-12 21:44:11,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:11,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477115447] [2022-12-12 21:44:11,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:11,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:11,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:11,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477115447] [2022-12-12 21:44:11,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477115447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:11,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:11,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:44:11,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950836251] [2022-12-12 21:44:11,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:11,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:44:11,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:11,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:44:11,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:44:11,500 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:11,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:11,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:11,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:11,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:13,394 INFO L130 PetriNetUnfolder]: 11130/17672 cut-off events. [2022-12-12 21:44:13,395 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-12 21:44:13,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33520 conditions, 17672 events. 11130/17672 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 126088 event pairs, 1598 based on Foata normal form. 0/11326 useless extension candidates. Maximal degree in co-relation 33509. Up to 13173 conditions per place. [2022-12-12 21:44:13,457 INFO L137 encePairwiseOnDemand]: 51/57 looper letters, 34 selfloop transitions, 2 changer transitions 44/88 dead transitions. [2022-12-12 21:44:13,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 345 flow [2022-12-12 21:44:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:44:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:44:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-12-12 21:44:13,468 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2022-12-12 21:44:13,471 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2022-12-12 21:44:13,471 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 88 transitions, 345 flow [2022-12-12 21:44:13,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 44 transitions, 169 flow [2022-12-12 21:44:13,497 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 169 flow [2022-12-12 21:44:13,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:13,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:13,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:13,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:44:13,498 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-12 21:44:13,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:13,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1700510279, now seen corresponding path program 1 times [2022-12-12 21:44:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:13,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278195330] [2022-12-12 21:44:13,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:13,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:13,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278195330] [2022-12-12 21:44:13,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278195330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:13,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:13,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:44:13,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995253500] [2022-12-12 21:44:13,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:13,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:44:13,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:13,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:44:13,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:44:13,913 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 21:44:13,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:13,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:13,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 21:44:13,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:14,398 INFO L130 PetriNetUnfolder]: 2244/3476 cut-off events. [2022-12-12 21:44:14,399 INFO L131 PetriNetUnfolder]: For 314/314 co-relation queries the response was YES. [2022-12-12 21:44:14,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9991 conditions, 3476 events. 2244/3476 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18022 event pairs, 59 based on Foata normal form. 49/3026 useless extension candidates. Maximal degree in co-relation 9977. Up to 2885 conditions per place. [2022-12-12 21:44:14,415 INFO L137 encePairwiseOnDemand]: 47/57 looper letters, 61 selfloop transitions, 12 changer transitions 0/80 dead transitions. [2022-12-12 21:44:14,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 80 transitions, 463 flow [2022-12-12 21:44:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:44:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:44:14,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-12 21:44:14,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35964912280701755 [2022-12-12 21:44:14,417 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -20 predicate places. [2022-12-12 21:44:14,417 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 80 transitions, 463 flow [2022-12-12 21:44:14,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 80 transitions, 463 flow [2022-12-12 21:44:14,430 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 80 transitions, 463 flow [2022-12-12 21:44:14,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:14,430 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:14,430 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:14,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:44:14,430 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-12 21:44:14,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:14,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1176211328, now seen corresponding path program 1 times [2022-12-12 21:44:14,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:14,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642370775] [2022-12-12 21:44:14,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:14,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:14,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:14,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642370775] [2022-12-12 21:44:14,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642370775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:14,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:14,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:44:14,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569429569] [2022-12-12 21:44:14,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:14,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:44:14,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:14,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:44:14,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:44:14,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 21:44:14,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 80 transitions, 463 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:14,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:14,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 21:44:14,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:14,973 INFO L130 PetriNetUnfolder]: 2004/3116 cut-off events. [2022-12-12 21:44:14,973 INFO L131 PetriNetUnfolder]: For 262/262 co-relation queries the response was YES. [2022-12-12 21:44:14,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11916 conditions, 3116 events. 2004/3116 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15499 event pairs, 92 based on Foata normal form. 84/2737 useless extension candidates. Maximal degree in co-relation 11899. Up to 2571 conditions per place. [2022-12-12 21:44:14,990 INFO L137 encePairwiseOnDemand]: 48/57 looper letters, 95 selfloop transitions, 13 changer transitions 0/115 dead transitions. [2022-12-12 21:44:14,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 115 transitions, 891 flow [2022-12-12 21:44:14,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:44:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:44:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-12 21:44:14,991 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-12 21:44:14,992 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -17 predicate places. [2022-12-12 21:44:14,992 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 115 transitions, 891 flow [2022-12-12 21:44:15,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 115 transitions, 891 flow [2022-12-12 21:44:15,005 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 115 transitions, 891 flow [2022-12-12 21:44:15,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:15,006 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:15,006 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:15,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:44:15,006 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-12 21:44:15,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash 241632227, now seen corresponding path program 1 times [2022-12-12 21:44:15,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:15,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669553761] [2022-12-12 21:44:15,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:15,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:15,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:15,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669553761] [2022-12-12 21:44:15,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669553761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:15,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:15,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:44:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846972315] [2022-12-12 21:44:15,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:15,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:44:15,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:15,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:44:15,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:44:15,618 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:15,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 115 transitions, 891 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:15,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:15,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:15,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:15,973 INFO L130 PetriNetUnfolder]: 2035/3145 cut-off events. [2022-12-12 21:44:15,974 INFO L131 PetriNetUnfolder]: For 831/831 co-relation queries the response was YES. [2022-12-12 21:44:15,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14973 conditions, 3145 events. 2035/3145 cut-off events. For 831/831 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15404 event pairs, 73 based on Foata normal form. 16/2689 useless extension candidates. Maximal degree in co-relation 14953. Up to 2615 conditions per place. [2022-12-12 21:44:15,993 INFO L137 encePairwiseOnDemand]: 51/57 looper letters, 115 selfloop transitions, 17 changer transitions 0/143 dead transitions. [2022-12-12 21:44:15,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 143 transitions, 1385 flow [2022-12-12 21:44:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:44:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:44:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-12 21:44:15,995 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35964912280701755 [2022-12-12 21:44:15,995 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -14 predicate places. [2022-12-12 21:44:15,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 143 transitions, 1385 flow [2022-12-12 21:44:16,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 143 transitions, 1385 flow [2022-12-12 21:44:16,013 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 143 transitions, 1385 flow [2022-12-12 21:44:16,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:16,013 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:16,013 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:16,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:44:16,014 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-12 21:44:16,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:16,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1310787793, now seen corresponding path program 2 times [2022-12-12 21:44:16,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:16,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244042128] [2022-12-12 21:44:16,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:16,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:16,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:16,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244042128] [2022-12-12 21:44:16,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244042128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:16,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:16,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:44:16,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196225094] [2022-12-12 21:44:16,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:16,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:44:16,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:44:16,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:44:16,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:16,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 143 transitions, 1385 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:16,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:16,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:16,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:17,086 INFO L130 PetriNetUnfolder]: 2492/3828 cut-off events. [2022-12-12 21:44:17,086 INFO L131 PetriNetUnfolder]: For 3059/3059 co-relation queries the response was YES. [2022-12-12 21:44:17,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21576 conditions, 3828 events. 2492/3828 cut-off events. For 3059/3059 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19550 event pairs, 84 based on Foata normal form. 52/3337 useless extension candidates. Maximal degree in co-relation 21553. Up to 3065 conditions per place. [2022-12-12 21:44:17,110 INFO L137 encePairwiseOnDemand]: 48/57 looper letters, 154 selfloop transitions, 32 changer transitions 0/197 dead transitions. [2022-12-12 21:44:17,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 197 transitions, 2297 flow [2022-12-12 21:44:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:44:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:44:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-12 21:44:17,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34385964912280703 [2022-12-12 21:44:17,112 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2022-12-12 21:44:17,112 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 197 transitions, 2297 flow [2022-12-12 21:44:17,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 197 transitions, 2297 flow [2022-12-12 21:44:17,133 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 197 transitions, 2297 flow [2022-12-12 21:44:17,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:17,133 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:17,133 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:17,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:44:17,134 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-12 21:44:17,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:17,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1979073523, now seen corresponding path program 1 times [2022-12-12 21:44:17,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:17,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434803669] [2022-12-12 21:44:17,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:17,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:17,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:17,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434803669] [2022-12-12 21:44:17,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434803669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:17,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:17,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:44:17,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024841280] [2022-12-12 21:44:17,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:17,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:44:17,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:17,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:44:17,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:44:17,931 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:17,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 197 transitions, 2297 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:17,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:17,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:17,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:18,720 INFO L130 PetriNetUnfolder]: 2853/4374 cut-off events. [2022-12-12 21:44:18,721 INFO L131 PetriNetUnfolder]: For 6962/6962 co-relation queries the response was YES. [2022-12-12 21:44:18,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28518 conditions, 4374 events. 2853/4374 cut-off events. For 6962/6962 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 22993 event pairs, 70 based on Foata normal form. 18/3798 useless extension candidates. Maximal degree in co-relation 28492. Up to 3451 conditions per place. [2022-12-12 21:44:18,764 INFO L137 encePairwiseOnDemand]: 47/57 looper letters, 219 selfloop transitions, 90 changer transitions 0/320 dead transitions. [2022-12-12 21:44:18,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 320 transitions, 4397 flow [2022-12-12 21:44:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:44:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:44:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-12-12 21:44:18,766 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2022-12-12 21:44:18,767 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -5 predicate places. [2022-12-12 21:44:18,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 320 transitions, 4397 flow [2022-12-12 21:44:18,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 320 transitions, 4397 flow [2022-12-12 21:44:18,807 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 320 transitions, 4397 flow [2022-12-12 21:44:18,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:18,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:18,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:18,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:44:18,807 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-12 21:44:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1981351093, now seen corresponding path program 2 times [2022-12-12 21:44:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:18,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514014637] [2022-12-12 21:44:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:19,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:19,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514014637] [2022-12-12 21:44:19,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514014637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:19,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:19,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:44:19,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386158672] [2022-12-12 21:44:19,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:19,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:44:19,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:19,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:44:19,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:44:19,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:19,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 320 transitions, 4397 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:19,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:19,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:19,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:20,756 INFO L130 PetriNetUnfolder]: 3461/5325 cut-off events. [2022-12-12 21:44:20,756 INFO L131 PetriNetUnfolder]: For 13686/13686 co-relation queries the response was YES. [2022-12-12 21:44:20,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39436 conditions, 5325 events. 3461/5325 cut-off events. For 13686/13686 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 29385 event pairs, 64 based on Foata normal form. 9/4592 useless extension candidates. Maximal degree in co-relation 39407. Up to 4181 conditions per place. [2022-12-12 21:44:20,888 INFO L137 encePairwiseOnDemand]: 48/57 looper letters, 375 selfloop transitions, 101 changer transitions 0/487 dead transitions. [2022-12-12 21:44:20,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 487 transitions, 7711 flow [2022-12-12 21:44:20,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 21:44:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 21:44:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2022-12-12 21:44:20,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33771929824561403 [2022-12-12 21:44:20,892 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 2 predicate places. [2022-12-12 21:44:20,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 487 transitions, 7711 flow [2022-12-12 21:44:20,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 487 transitions, 7711 flow [2022-12-12 21:44:20,944 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 487 transitions, 7711 flow [2022-12-12 21:44:20,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:20,944 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:20,944 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:20,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:44:20,945 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-12 21:44:20,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:20,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1960132213, now seen corresponding path program 3 times [2022-12-12 21:44:20,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:20,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987220814] [2022-12-12 21:44:20,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:20,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:21,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:21,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:21,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987220814] [2022-12-12 21:44:21,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987220814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:21,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:21,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:44:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508621753] [2022-12-12 21:44:21,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:21,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:44:21,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:21,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:44:21,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:44:21,963 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:21,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 487 transitions, 7711 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:21,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:21,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:21,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:22,892 INFO L130 PetriNetUnfolder]: 3709/5717 cut-off events. [2022-12-12 21:44:22,892 INFO L131 PetriNetUnfolder]: For 21512/21512 co-relation queries the response was YES. [2022-12-12 21:44:22,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47267 conditions, 5717 events. 3709/5717 cut-off events. For 21512/21512 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 32164 event pairs, 62 based on Foata normal form. 36/4943 useless extension candidates. Maximal degree in co-relation 47235. Up to 4446 conditions per place. [2022-12-12 21:44:22,932 INFO L137 encePairwiseOnDemand]: 50/57 looper letters, 418 selfloop transitions, 90 changer transitions 0/519 dead transitions. [2022-12-12 21:44:22,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 519 transitions, 9239 flow [2022-12-12 21:44:22,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:44:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:44:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-12 21:44:22,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34385964912280703 [2022-12-12 21:44:22,934 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places. [2022-12-12 21:44:22,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 519 transitions, 9239 flow [2022-12-12 21:44:22,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 519 transitions, 9239 flow [2022-12-12 21:44:22,970 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 519 transitions, 9239 flow [2022-12-12 21:44:22,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:22,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:22,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:22,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:44:22,971 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-12 21:44:22,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:22,971 INFO L85 PathProgramCache]: Analyzing trace with hash 582918381, now seen corresponding path program 1 times [2022-12-12 21:44:22,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:22,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539752967] [2022-12-12 21:44:22,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:22,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:23,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:23,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539752967] [2022-12-12 21:44:23,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539752967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:23,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:23,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 21:44:23,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537037537] [2022-12-12 21:44:23,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:23,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 21:44:23,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:23,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 21:44:23,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-12 21:44:23,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:23,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 519 transitions, 9239 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:23,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:23,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:23,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:24,697 INFO L130 PetriNetUnfolder]: 4660/7243 cut-off events. [2022-12-12 21:44:24,697 INFO L131 PetriNetUnfolder]: For 35868/35868 co-relation queries the response was YES. [2022-12-12 21:44:24,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65925 conditions, 7243 events. 4660/7243 cut-off events. For 35868/35868 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 43508 event pairs, 62 based on Foata normal form. 84/6226 useless extension candidates. Maximal degree in co-relation 65890. Up to 5687 conditions per place. [2022-12-12 21:44:24,743 INFO L137 encePairwiseOnDemand]: 47/57 looper letters, 452 selfloop transitions, 52 changer transitions 68/583 dead transitions. [2022-12-12 21:44:24,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 583 transitions, 11535 flow [2022-12-12 21:44:24,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:44:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:44:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2022-12-12 21:44:24,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3533834586466165 [2022-12-12 21:44:24,745 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2022-12-12 21:44:24,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 583 transitions, 11535 flow [2022-12-12 21:44:24,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 515 transitions, 10175 flow [2022-12-12 21:44:24,786 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 515 transitions, 10175 flow [2022-12-12 21:44:24,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:24,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:24,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:24,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:44:24,786 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-12 21:44:24,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1243874961, now seen corresponding path program 2 times [2022-12-12 21:44:24,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:24,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459352537] [2022-12-12 21:44:24,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:24,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:25,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:25,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459352537] [2022-12-12 21:44:25,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459352537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:25,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:25,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:44:25,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506938676] [2022-12-12 21:44:25,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:25,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:44:25,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:25,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:44:25,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:44:25,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 21:44:25,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 515 transitions, 10175 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:25,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:25,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 21:44:25,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:26,770 INFO L130 PetriNetUnfolder]: 3887/6032 cut-off events. [2022-12-12 21:44:26,770 INFO L131 PetriNetUnfolder]: For 30982/30982 co-relation queries the response was YES. [2022-12-12 21:44:26,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61150 conditions, 6032 events. 3887/6032 cut-off events. For 30982/30982 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 34884 event pairs, 138 based on Foata normal form. 24/5184 useless extension candidates. Maximal degree in co-relation 61112. Up to 4676 conditions per place. [2022-12-12 21:44:26,817 INFO L137 encePairwiseOnDemand]: 45/57 looper letters, 440 selfloop transitions, 191 changer transitions 0/638 dead transitions. [2022-12-12 21:44:26,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 638 transitions, 13785 flow [2022-12-12 21:44:26,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 21:44:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 21:44:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2022-12-12 21:44:26,819 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-12 21:44:26,819 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 18 predicate places. [2022-12-12 21:44:26,819 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 638 transitions, 13785 flow [2022-12-12 21:44:26,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 638 transitions, 13785 flow [2022-12-12 21:44:26,863 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 638 transitions, 13785 flow [2022-12-12 21:44:26,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:26,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:26,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:26,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:44:26,863 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-12 21:44:26,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:26,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1293045921, now seen corresponding path program 3 times [2022-12-12 21:44:26,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:26,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481447396] [2022-12-12 21:44:26,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:26,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:27,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:27,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481447396] [2022-12-12 21:44:27,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481447396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:27,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:27,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:44:27,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960720610] [2022-12-12 21:44:27,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:27,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:44:27,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:27,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:44:27,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:44:27,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:27,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 638 transitions, 13785 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:27,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:27,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:27,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:28,925 INFO L130 PetriNetUnfolder]: 5163/8107 cut-off events. [2022-12-12 21:44:28,926 INFO L131 PetriNetUnfolder]: For 53032/53032 co-relation queries the response was YES. [2022-12-12 21:44:28,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88867 conditions, 8107 events. 5163/8107 cut-off events. For 53032/53032 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 50809 event pairs, 170 based on Foata normal form. 66/6879 useless extension candidates. Maximal degree in co-relation 88826. Up to 6253 conditions per place. [2022-12-12 21:44:29,004 INFO L137 encePairwiseOnDemand]: 47/57 looper letters, 585 selfloop transitions, 147 changer transitions 101/852 dead transitions. [2022-12-12 21:44:29,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 852 transitions, 20162 flow [2022-12-12 21:44:29,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-12 21:44:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-12 21:44:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 221 transitions. [2022-12-12 21:44:29,020 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3524720893141946 [2022-12-12 21:44:29,021 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 28 predicate places. [2022-12-12 21:44:29,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 852 transitions, 20162 flow [2022-12-12 21:44:29,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 751 transitions, 17735 flow [2022-12-12 21:44:29,082 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 751 transitions, 17735 flow [2022-12-12 21:44:29,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:29,083 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:29,083 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:29,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:44:29,083 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-12 21:44:29,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:29,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1293030111, now seen corresponding path program 4 times [2022-12-12 21:44:29,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:29,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936906278] [2022-12-12 21:44:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:29,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:29,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936906278] [2022-12-12 21:44:29,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936906278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:29,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:29,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:44:29,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7139721] [2022-12-12 21:44:29,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:29,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:44:29,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:29,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:44:29,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:44:29,801 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:29,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 751 transitions, 17735 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:29,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:29,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:29,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:31,099 INFO L130 PetriNetUnfolder]: 4923/7726 cut-off events. [2022-12-12 21:44:31,099 INFO L131 PetriNetUnfolder]: For 60653/60653 co-relation queries the response was YES. [2022-12-12 21:44:31,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91911 conditions, 7726 events. 4923/7726 cut-off events. For 60653/60653 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 47667 event pairs, 184 based on Foata normal form. 60/6563 useless extension candidates. Maximal degree in co-relation 91867. Up to 6095 conditions per place. [2022-12-12 21:44:31,164 INFO L137 encePairwiseOnDemand]: 48/57 looper letters, 638 selfloop transitions, 142 changer transitions 0/799 dead transitions. [2022-12-12 21:44:31,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 799 transitions, 20447 flow [2022-12-12 21:44:31,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:44:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:44:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-12 21:44:31,166 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3304093567251462 [2022-12-12 21:44:31,166 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 32 predicate places. [2022-12-12 21:44:31,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 799 transitions, 20447 flow [2022-12-12 21:44:31,226 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 799 transitions, 20447 flow [2022-12-12 21:44:31,226 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 799 transitions, 20447 flow [2022-12-12 21:44:31,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:31,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:31,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:31,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 21:44:31,227 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-12 21:44:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:31,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1292331681, now seen corresponding path program 5 times [2022-12-12 21:44:31,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:31,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119539420] [2022-12-12 21:44:31,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:31,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:31,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:31,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119539420] [2022-12-12 21:44:31,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119539420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:31,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:31,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 21:44:31,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454438607] [2022-12-12 21:44:31,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:31,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 21:44:31,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:31,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 21:44:31,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-12 21:44:31,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 21:44:31,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 799 transitions, 20447 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:31,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:31,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 21:44:31,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:33,877 INFO L130 PetriNetUnfolder]: 5573/8832 cut-off events. [2022-12-12 21:44:33,877 INFO L131 PetriNetUnfolder]: For 66719/66719 co-relation queries the response was YES. [2022-12-12 21:44:33,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112927 conditions, 8832 events. 5573/8832 cut-off events. For 66719/66719 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 56677 event pairs, 166 based on Foata normal form. 60/7427 useless extension candidates. Maximal degree in co-relation 112880. Up to 6980 conditions per place. [2022-12-12 21:44:33,952 INFO L137 encePairwiseOnDemand]: 45/57 looper letters, 455 selfloop transitions, 220 changer transitions 243/925 dead transitions. [2022-12-12 21:44:33,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 925 transitions, 25433 flow [2022-12-12 21:44:33,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-12 21:44:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-12 21:44:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 216 transitions. [2022-12-12 21:44:33,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3444976076555024 [2022-12-12 21:44:33,954 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 42 predicate places. [2022-12-12 21:44:33,954 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 925 transitions, 25433 flow [2022-12-12 21:44:34,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 682 transitions, 18728 flow [2022-12-12 21:44:34,010 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 682 transitions, 18728 flow [2022-12-12 21:44:34,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:34,010 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:34,010 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:34,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 21:44:34,010 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-12 21:44:34,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:34,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1450630225, now seen corresponding path program 6 times [2022-12-12 21:44:34,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:34,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543842884] [2022-12-12 21:44:34,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:34,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:34,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:34,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543842884] [2022-12-12 21:44:34,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543842884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:34,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:34,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:44:34,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229593940] [2022-12-12 21:44:34,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:34,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:44:34,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:34,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:44:34,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:44:34,560 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 21:44:34,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 682 transitions, 18728 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:34,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:34,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 21:44:34,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:36,034 INFO L130 PetriNetUnfolder]: 4961/7841 cut-off events. [2022-12-12 21:44:36,034 INFO L131 PetriNetUnfolder]: For 55542/55542 co-relation queries the response was YES. [2022-12-12 21:44:36,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108020 conditions, 7841 events. 4961/7841 cut-off events. For 55542/55542 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 49137 event pairs, 277 based on Foata normal form. 60/6619 useless extension candidates. Maximal degree in co-relation 107970. Up to 6365 conditions per place. [2022-12-12 21:44:36,100 INFO L137 encePairwiseOnDemand]: 45/57 looper letters, 539 selfloop transitions, 256 changer transitions 57/859 dead transitions. [2022-12-12 21:44:36,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 859 transitions, 25217 flow [2022-12-12 21:44:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-12 21:44:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-12 21:44:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 219 transitions. [2022-12-12 21:44:36,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3201754385964912 [2022-12-12 21:44:36,102 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 49 predicate places. [2022-12-12 21:44:36,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 859 transitions, 25217 flow [2022-12-12 21:44:36,162 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 802 transitions, 23561 flow [2022-12-12 21:44:36,162 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 802 transitions, 23561 flow [2022-12-12 21:44:36,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:36,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:36,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:36,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 21:44:36,163 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-12 21:44:36,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:36,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1451120335, now seen corresponding path program 7 times [2022-12-12 21:44:36,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:36,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217544206] [2022-12-12 21:44:36,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:36,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:37,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:37,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217544206] [2022-12-12 21:44:37,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217544206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:37,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:37,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 21:44:37,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266191923] [2022-12-12 21:44:37,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:37,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 21:44:37,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:37,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 21:44:37,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-12 21:44:37,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 21:44:37,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 802 transitions, 23561 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:37,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:37,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 21:44:37,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:39,098 INFO L130 PetriNetUnfolder]: 5099/8060 cut-off events. [2022-12-12 21:44:39,098 INFO L131 PetriNetUnfolder]: For 63741/63741 co-relation queries the response was YES. [2022-12-12 21:44:39,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117900 conditions, 8060 events. 5099/8060 cut-off events. For 63741/63741 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 51008 event pairs, 106 based on Foata normal form. 48/6856 useless extension candidates. Maximal degree in co-relation 117847. Up to 6480 conditions per place. [2022-12-12 21:44:39,173 INFO L137 encePairwiseOnDemand]: 51/57 looper letters, 767 selfloop transitions, 145 changer transitions 0/919 dead transitions. [2022-12-12 21:44:39,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 919 transitions, 28787 flow [2022-12-12 21:44:39,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:44:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:44:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-12 21:44:39,175 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34502923976608185 [2022-12-12 21:44:39,175 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 52 predicate places. [2022-12-12 21:44:39,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 919 transitions, 28787 flow [2022-12-12 21:44:39,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 919 transitions, 28787 flow [2022-12-12 21:44:39,264 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 919 transitions, 28787 flow [2022-12-12 21:44:39,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:39,265 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:39,265 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:39,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 21:44:39,265 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-12 21:44:39,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash -430426637, now seen corresponding path program 1 times [2022-12-12 21:44:39,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:39,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654867825] [2022-12-12 21:44:39,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:39,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:39,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:39,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654867825] [2022-12-12 21:44:39,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654867825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:39,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:39,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:44:39,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305845936] [2022-12-12 21:44:39,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:39,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:44:39,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:39,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:44:39,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:44:39,493 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-12 21:44:39,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 919 transitions, 28787 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:39,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:39,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-12 21:44:39,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:41,650 INFO L130 PetriNetUnfolder]: 6404/10202 cut-off events. [2022-12-12 21:44:41,651 INFO L131 PetriNetUnfolder]: For 63741/63741 co-relation queries the response was YES. [2022-12-12 21:44:41,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159211 conditions, 10202 events. 6404/10202 cut-off events. For 63741/63741 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 67802 event pairs, 94 based on Foata normal form. 60/8574 useless extension candidates. Maximal degree in co-relation 159155. Up to 8448 conditions per place. [2022-12-12 21:44:41,701 INFO L137 encePairwiseOnDemand]: 50/57 looper letters, 430 selfloop transitions, 57 changer transitions 605/1099 dead transitions. [2022-12-12 21:44:41,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 1099 transitions, 36731 flow [2022-12-12 21:44:41,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:44:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:44:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-12 21:44:41,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34210526315789475 [2022-12-12 21:44:41,703 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 55 predicate places. [2022-12-12 21:44:41,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 1099 transitions, 36731 flow [2022-12-12 21:44:41,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 494 transitions, 16341 flow [2022-12-12 21:44:41,745 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 494 transitions, 16341 flow [2022-12-12 21:44:41,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:41,745 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:41,745 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:41,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 21:44:41,745 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-12 21:44:41,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:41,746 INFO L85 PathProgramCache]: Analyzing trace with hash -458324090, now seen corresponding path program 1 times [2022-12-12 21:44:41,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:41,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910793407] [2022-12-12 21:44:41,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:41,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:41,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:41,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910793407] [2022-12-12 21:44:41,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910793407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:41,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:41,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:44:41,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585724015] [2022-12-12 21:44:41,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:41,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:44:41,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:41,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:44:41,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:44:41,839 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 57 [2022-12-12 21:44:41,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 494 transitions, 16341 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:41,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:41,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 57 [2022-12-12 21:44:41,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:42,556 INFO L130 PetriNetUnfolder]: 2818/4376 cut-off events. [2022-12-12 21:44:42,556 INFO L131 PetriNetUnfolder]: For 46046/46049 co-relation queries the response was YES. [2022-12-12 21:44:42,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67397 conditions, 4376 events. 2818/4376 cut-off events. For 46046/46049 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 23956 event pairs, 524 based on Foata normal form. 89/3778 useless extension candidates. Maximal degree in co-relation 67338. Up to 4156 conditions per place. [2022-12-12 21:44:42,593 INFO L137 encePairwiseOnDemand]: 46/57 looper letters, 301 selfloop transitions, 78 changer transitions 3/394 dead transitions. [2022-12-12 21:44:42,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 394 transitions, 13700 flow [2022-12-12 21:44:42,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:44:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:44:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-12 21:44:42,595 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3567251461988304 [2022-12-12 21:44:42,596 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 55 predicate places. [2022-12-12 21:44:42,596 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 394 transitions, 13700 flow [2022-12-12 21:44:42,625 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 391 transitions, 13626 flow [2022-12-12 21:44:42,626 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 391 transitions, 13626 flow [2022-12-12 21:44:42,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:42,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:42,626 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:42,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-12 21:44:42,626 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:42,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:42,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1055847959, now seen corresponding path program 1 times [2022-12-12 21:44:42,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:42,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534909461] [2022-12-12 21:44:42,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:42,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:42,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:42,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534909461] [2022-12-12 21:44:42,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534909461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:42,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:42,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:44:42,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371580502] [2022-12-12 21:44:42,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:42,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:44:42,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:42,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:44:42,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:44:42,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 57 [2022-12-12 21:44:42,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 391 transitions, 13626 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:42,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:42,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 57 [2022-12-12 21:44:42,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:43,421 INFO L130 PetriNetUnfolder]: 1418/2525 cut-off events. [2022-12-12 21:44:43,421 INFO L131 PetriNetUnfolder]: For 36777/36795 co-relation queries the response was YES. [2022-12-12 21:44:43,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41658 conditions, 2525 events. 1418/2525 cut-off events. For 36777/36795 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 15040 event pairs, 135 based on Foata normal form. 210/2352 useless extension candidates. Maximal degree in co-relation 41596. Up to 2327 conditions per place. [2022-12-12 21:44:43,440 INFO L137 encePairwiseOnDemand]: 46/57 looper letters, 238 selfloop transitions, 119 changer transitions 6/375 dead transitions. [2022-12-12 21:44:43,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 375 transitions, 13680 flow [2022-12-12 21:44:43,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:44:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:44:43,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-12 21:44:43,441 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35964912280701755 [2022-12-12 21:44:43,442 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 54 predicate places. [2022-12-12 21:44:43,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 375 transitions, 13680 flow [2022-12-12 21:44:43,462 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 369 transitions, 13452 flow [2022-12-12 21:44:43,462 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 369 transitions, 13452 flow [2022-12-12 21:44:43,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:43,462 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:43,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:43,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-12 21:44:43,463 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:43,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1977634212, now seen corresponding path program 1 times [2022-12-12 21:44:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:43,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608240838] [2022-12-12 21:44:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:43,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:43,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:43,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:43,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608240838] [2022-12-12 21:44:43,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608240838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:43,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:43,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:44:43,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754526775] [2022-12-12 21:44:43,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:43,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:44:43,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:43,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:44:43,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:44:43,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 57 [2022-12-12 21:44:43,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 369 transitions, 13452 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:43,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:43,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 57 [2022-12-12 21:44:43,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:43,940 INFO L130 PetriNetUnfolder]: 704/1370 cut-off events. [2022-12-12 21:44:43,940 INFO L131 PetriNetUnfolder]: For 29093/29108 co-relation queries the response was YES. [2022-12-12 21:44:43,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23366 conditions, 1370 events. 704/1370 cut-off events. For 29093/29108 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7686 event pairs, 0 based on Foata normal form. 195/1350 useless extension candidates. Maximal degree in co-relation 23301. Up to 1172 conditions per place. [2022-12-12 21:44:43,951 INFO L137 encePairwiseOnDemand]: 46/57 looper letters, 191 selfloop transitions, 114 changer transitions 38/355 dead transitions. [2022-12-12 21:44:43,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 355 transitions, 13606 flow [2022-12-12 21:44:43,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:44:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:44:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-12 21:44:43,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30526315789473685 [2022-12-12 21:44:43,953 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 58 predicate places. [2022-12-12 21:44:43,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 355 transitions, 13606 flow [2022-12-12 21:44:43,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 317 transitions, 12080 flow [2022-12-12 21:44:43,965 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 317 transitions, 12080 flow [2022-12-12 21:44:43,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:43,965 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:43,965 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:43,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-12 21:44:43,965 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:43,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:43,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1573451225, now seen corresponding path program 1 times [2022-12-12 21:44:43,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:43,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074540024] [2022-12-12 21:44:43,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:43,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:44,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:44,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074540024] [2022-12-12 21:44:44,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074540024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:44,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:44,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 21:44:44,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269306028] [2022-12-12 21:44:44,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:44,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 21:44:44,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:44,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 21:44:44,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-12 21:44:44,769 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:44,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 317 transitions, 12080 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:44,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:44,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:44,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:45,216 INFO L130 PetriNetUnfolder]: 738/1460 cut-off events. [2022-12-12 21:44:45,216 INFO L131 PetriNetUnfolder]: For 26576/26579 co-relation queries the response was YES. [2022-12-12 21:44:45,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25476 conditions, 1460 events. 738/1460 cut-off events. For 26576/26579 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8624 event pairs, 0 based on Foata normal form. 27/1234 useless extension candidates. Maximal degree in co-relation 25408. Up to 1265 conditions per place. [2022-12-12 21:44:45,227 INFO L137 encePairwiseOnDemand]: 48/57 looper letters, 259 selfloop transitions, 34 changer transitions 51/365 dead transitions. [2022-12-12 21:44:45,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 365 transitions, 14688 flow [2022-12-12 21:44:45,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 21:44:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 21:44:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2022-12-12 21:44:45,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26096491228070173 [2022-12-12 21:44:45,229 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 65 predicate places. [2022-12-12 21:44:45,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 365 transitions, 14688 flow [2022-12-12 21:44:45,241 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 314 transitions, 12546 flow [2022-12-12 21:44:45,241 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 314 transitions, 12546 flow [2022-12-12 21:44:45,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:45,241 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:45,241 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:45,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-12 21:44:45,241 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:45,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:45,242 INFO L85 PathProgramCache]: Analyzing trace with hash -326348063, now seen corresponding path program 2 times [2022-12-12 21:44:45,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:45,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566117525] [2022-12-12 21:44:45,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:45,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:45,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:45,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566117525] [2022-12-12 21:44:45,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566117525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:45,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:45,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:44:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835441472] [2022-12-12 21:44:45,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:45,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:44:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:45,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:44:45,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:44:45,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:45,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 314 transitions, 12546 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:45,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:45,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:45,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:45,929 INFO L130 PetriNetUnfolder]: 903/1730 cut-off events. [2022-12-12 21:44:45,930 INFO L131 PetriNetUnfolder]: For 34714/34716 co-relation queries the response was YES. [2022-12-12 21:44:45,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31690 conditions, 1730 events. 903/1730 cut-off events. For 34714/34716 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 10313 event pairs, 0 based on Foata normal form. 27/1454 useless extension candidates. Maximal degree in co-relation 31619. Up to 1530 conditions per place. [2022-12-12 21:44:45,947 INFO L137 encePairwiseOnDemand]: 49/57 looper letters, 259 selfloop transitions, 32 changer transitions 102/413 dead transitions. [2022-12-12 21:44:45,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 413 transitions, 17488 flow [2022-12-12 21:44:45,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:44:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:44:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-12 21:44:45,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30701754385964913 [2022-12-12 21:44:45,949 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 68 predicate places. [2022-12-12 21:44:45,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 413 transitions, 17488 flow [2022-12-12 21:44:45,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 311 transitions, 13025 flow [2022-12-12 21:44:45,964 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 311 transitions, 13025 flow [2022-12-12 21:44:45,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:45,964 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:45,964 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:45,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-12 21:44:45,965 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:45,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:45,965 INFO L85 PathProgramCache]: Analyzing trace with hash 40367655, now seen corresponding path program 3 times [2022-12-12 21:44:45,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:45,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872947183] [2022-12-12 21:44:45,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:45,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:46,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:46,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872947183] [2022-12-12 21:44:46,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872947183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:46,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:46,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 21:44:46,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470919111] [2022-12-12 21:44:46,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:46,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 21:44:46,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:46,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 21:44:46,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-12 21:44:46,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:46,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 311 transitions, 13025 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:46,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:46,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:46,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:47,387 INFO L130 PetriNetUnfolder]: 752/1481 cut-off events. [2022-12-12 21:44:47,387 INFO L131 PetriNetUnfolder]: For 31918/31920 co-relation queries the response was YES. [2022-12-12 21:44:47,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28165 conditions, 1481 events. 752/1481 cut-off events. For 31918/31920 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8789 event pairs, 0 based on Foata normal form. 27/1248 useless extension candidates. Maximal degree in co-relation 28091. Up to 1305 conditions per place. [2022-12-12 21:44:47,399 INFO L137 encePairwiseOnDemand]: 49/57 looper letters, 215 selfloop transitions, 59 changer transitions 68/362 dead transitions. [2022-12-12 21:44:47,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 362 transitions, 15953 flow [2022-12-12 21:44:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 21:44:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 21:44:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2022-12-12 21:44:47,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27680311890838205 [2022-12-12 21:44:47,401 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 71 predicate places. [2022-12-12 21:44:47,401 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 362 transitions, 15953 flow [2022-12-12 21:44:47,413 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 294 transitions, 12825 flow [2022-12-12 21:44:47,413 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 294 transitions, 12825 flow [2022-12-12 21:44:47,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:47,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:47,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:47,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-12 21:44:47,414 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2088226513, now seen corresponding path program 4 times [2022-12-12 21:44:47,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:47,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288190492] [2022-12-12 21:44:47,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:47,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:48,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:48,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288190492] [2022-12-12 21:44:48,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288190492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:48,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:48,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 21:44:48,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908921092] [2022-12-12 21:44:48,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:48,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-12 21:44:48,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:48,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-12 21:44:48,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-12 21:44:48,560 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:48,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 294 transitions, 12825 flow. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:48,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:48,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:48,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:49,029 INFO L130 PetriNetUnfolder]: 683/1369 cut-off events. [2022-12-12 21:44:49,029 INFO L131 PetriNetUnfolder]: For 31946/31947 co-relation queries the response was YES. [2022-12-12 21:44:49,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27052 conditions, 1369 events. 683/1369 cut-off events. For 31946/31947 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8028 event pairs, 0 based on Foata normal form. 27/1155 useless extension candidates. Maximal degree in co-relation 26975. Up to 1213 conditions per place. [2022-12-12 21:44:49,041 INFO L137 encePairwiseOnDemand]: 48/57 looper letters, 247 selfloop transitions, 13 changer transitions 57/335 dead transitions. [2022-12-12 21:44:49,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 335 transitions, 15341 flow [2022-12-12 21:44:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 21:44:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 21:44:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2022-12-12 21:44:49,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24561403508771928 [2022-12-12 21:44:49,042 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 79 predicate places. [2022-12-12 21:44:49,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 335 transitions, 15341 flow [2022-12-12 21:44:49,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 278 transitions, 12666 flow [2022-12-12 21:44:49,054 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 278 transitions, 12666 flow [2022-12-12 21:44:49,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:49,054 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:49,054 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:49,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-12 21:44:49,054 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:49,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1541505377, now seen corresponding path program 5 times [2022-12-12 21:44:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:49,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045433430] [2022-12-12 21:44:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:49,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:49,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:49,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045433430] [2022-12-12 21:44:49,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045433430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:49,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:49,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 21:44:49,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569835442] [2022-12-12 21:44:49,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:49,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 21:44:49,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:49,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 21:44:49,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:44:49,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:49,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 278 transitions, 12666 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:49,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:49,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:49,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:49,922 INFO L130 PetriNetUnfolder]: 738/1453 cut-off events. [2022-12-12 21:44:49,923 INFO L131 PetriNetUnfolder]: For 38807/38808 co-relation queries the response was YES. [2022-12-12 21:44:49,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29882 conditions, 1453 events. 738/1453 cut-off events. For 38807/38808 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8632 event pairs, 0 based on Foata normal form. 27/1221 useless extension candidates. Maximal degree in co-relation 29802. Up to 1309 conditions per place. [2022-12-12 21:44:49,934 INFO L137 encePairwiseOnDemand]: 48/57 looper letters, 244 selfloop transitions, 17 changer transitions 67/345 dead transitions. [2022-12-12 21:44:49,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 345 transitions, 16536 flow [2022-12-12 21:44:49,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 21:44:49,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 21:44:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2022-12-12 21:44:49,936 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25877192982456143 [2022-12-12 21:44:49,936 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 81 predicate places. [2022-12-12 21:44:49,936 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 345 transitions, 16536 flow [2022-12-12 21:44:49,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 278 transitions, 13220 flow [2022-12-12 21:44:49,948 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 278 transitions, 13220 flow [2022-12-12 21:44:49,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:49,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:49,949 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:49,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-12 21:44:49,949 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:49,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:49,949 INFO L85 PathProgramCache]: Analyzing trace with hash -366014733, now seen corresponding path program 6 times [2022-12-12 21:44:49,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:49,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768135103] [2022-12-12 21:44:49,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:49,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:50,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:50,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768135103] [2022-12-12 21:44:50,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768135103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:50,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:50,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:44:50,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488567575] [2022-12-12 21:44:50,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:50,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:44:50,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:50,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:44:50,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:44:50,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:50,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 278 transitions, 13220 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:50,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:50,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:50,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:50,728 INFO L130 PetriNetUnfolder]: 980/1926 cut-off events. [2022-12-12 21:44:50,728 INFO L131 PetriNetUnfolder]: For 57532/57533 co-relation queries the response was YES. [2022-12-12 21:44:50,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40306 conditions, 1926 events. 980/1926 cut-off events. For 57532/57533 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12293 event pairs, 0 based on Foata normal form. 27/1590 useless extension candidates. Maximal degree in co-relation 40223. Up to 1784 conditions per place. [2022-12-12 21:44:50,751 INFO L137 encePairwiseOnDemand]: 50/57 looper letters, 234 selfloop transitions, 28 changer transitions 112/389 dead transitions. [2022-12-12 21:44:50,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 389 transitions, 19514 flow [2022-12-12 21:44:50,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:44:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:44:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-12-12 21:44:50,752 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-12 21:44:50,753 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 84 predicate places. [2022-12-12 21:44:50,753 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 389 transitions, 19514 flow [2022-12-12 21:44:50,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 277 transitions, 13759 flow [2022-12-12 21:44:50,774 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 277 transitions, 13759 flow [2022-12-12 21:44:50,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:50,775 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:50,775 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:50,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-12 21:44:50,775 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:50,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1979908351, now seen corresponding path program 7 times [2022-12-12 21:44:50,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:50,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956906684] [2022-12-12 21:44:50,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:50,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:44:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:44:51,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:44:51,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956906684] [2022-12-12 21:44:51,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956906684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:44:51,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:44:51,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 21:44:51,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274011514] [2022-12-12 21:44:51,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:44:51,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 21:44:51,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:44:51,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 21:44:51,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-12 21:44:51,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2022-12-12 21:44:51,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 277 transitions, 13759 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:51,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:44:51,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2022-12-12 21:44:51,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:44:52,361 INFO L130 PetriNetUnfolder]: 980/1891 cut-off events. [2022-12-12 21:44:52,361 INFO L131 PetriNetUnfolder]: For 54070/54071 co-relation queries the response was YES. [2022-12-12 21:44:52,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41406 conditions, 1891 events. 980/1891 cut-off events. For 54070/54071 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11806 event pairs, 0 based on Foata normal form. 27/1539 useless extension candidates. Maximal degree in co-relation 41320. Up to 1795 conditions per place. [2022-12-12 21:44:52,379 INFO L137 encePairwiseOnDemand]: 50/57 looper letters, 103 selfloop transitions, 15 changer transitions 206/336 dead transitions. [2022-12-12 21:44:52,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 336 transitions, 17469 flow [2022-12-12 21:44:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:44:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:44:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-12-12 21:44:52,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2932330827067669 [2022-12-12 21:44:52,381 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 53 predicate places. [2022-12-12 21:44:52,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 336 transitions, 17469 flow [2022-12-12 21:44:52,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 130 transitions, 6473 flow [2022-12-12 21:44:52,395 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 130 transitions, 6473 flow [2022-12-12 21:44:52,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:44:52,395 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:44:52,396 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:52,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-12 21:44:52,396 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:44:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:44:52,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1532199685, now seen corresponding path program 8 times [2022-12-12 21:44:52,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:44:52,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286405164] [2022-12-12 21:44:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:44:52,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:44:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:44:52,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:44:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:44:52,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:44:52,524 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:44:52,525 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 21:44:52,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 21:44:52,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 21:44:52,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 21:44:52,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 21:44:52,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 21:44:52,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-12 21:44:52,538 INFO L445 BasicCegarLoop]: Path program histogram: [8, 7, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:44:52,543 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:44:52,543 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:44:52,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:44:52 BasicIcfg [2022-12-12 21:44:52,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:44:52,640 INFO L158 Benchmark]: Toolchain (without parser) took 51146.10ms. Allocated memory was 178.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 153.0MB in the beginning and 897.9MB in the end (delta: -744.9MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-12 21:44:52,641 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 178.3MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:44:52,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.39ms. Allocated memory is still 178.3MB. Free memory was 152.7MB in the beginning and 122.8MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-12 21:44:52,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.48ms. Allocated memory is still 178.3MB. Free memory was 122.8MB in the beginning and 120.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:44:52,642 INFO L158 Benchmark]: Boogie Preprocessor took 29.98ms. Allocated memory is still 178.3MB. Free memory was 120.2MB in the beginning and 118.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:44:52,643 INFO L158 Benchmark]: RCFGBuilder took 678.45ms. Allocated memory is still 178.3MB. Free memory was 118.1MB in the beginning and 70.4MB in the end (delta: 47.7MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. [2022-12-12 21:44:52,643 INFO L158 Benchmark]: TraceAbstraction took 49825.73ms. Allocated memory was 178.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 69.3MB in the beginning and 897.9MB in the end (delta: -828.5MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-12 21:44:52,644 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 178.3MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 537.39ms. Allocated memory is still 178.3MB. Free memory was 152.7MB in the beginning and 122.8MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.48ms. Allocated memory is still 178.3MB. Free memory was 122.8MB in the beginning and 120.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.98ms. Allocated memory is still 178.3MB. Free memory was 120.2MB in the beginning and 118.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 678.45ms. Allocated memory is still 178.3MB. Free memory was 118.1MB in the beginning and 70.4MB in the end (delta: 47.7MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. * TraceAbstraction took 49825.73ms. Allocated memory was 178.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 69.3MB in the beginning and 897.9MB in the end (delta: -828.5MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 112 PlacesBefore, 66 PlacesAfterwards, 104 TransitionsBefore, 57 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2911, independent: 2789, independent conditional: 2789, independent unconditional: 0, dependent: 122, dependent conditional: 122, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2911, independent: 2789, independent conditional: 0, independent unconditional: 2789, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2911, independent: 2789, independent conditional: 0, independent unconditional: 2789, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2911, independent: 2789, independent conditional: 0, independent unconditional: 2789, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1727, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1727, independent: 1638, independent conditional: 0, independent unconditional: 1638, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 89, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 535, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 474, dependent conditional: 0, dependent unconditional: 474, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2911, independent: 1121, independent conditional: 0, independent unconditional: 1121, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 1727, unknown conditional: 0, unknown unconditional: 1727] , Statistics on independence cache: Total cache size (in pairs): 3120, Positive cache size: 3061, Positive conditional cache size: 0, Positive unconditional cache size: 3061, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-3, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-2, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=-1, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 852]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.8s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 49.6s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 24.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1118 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1118 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 469 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4393 IncrementalHoareTripleChecker+Invalid, 4862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 469 mSolverCounterUnsat, 13 mSDtfsCounter, 4393 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28787occurred in iteration=15, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 67017 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 434 NumberOfCodeBlocks, 434 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 387 ConstructedInterpolants, 0 QuantifiedInterpolants, 5517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 21:44:52,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...