/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe035_power.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:21:15,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:21:15,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:21:15,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:21:15,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:21:15,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:21:15,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:21:15,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:21:15,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:21:15,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:21:15,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:21:15,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:21:15,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:21:15,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:21:15,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:21:15,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:21:15,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:21:15,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:21:15,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:21:15,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:21:15,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:21:15,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:21:15,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:21:15,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:21:15,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:21:15,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:21:15,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:21:15,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:21:15,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:21:15,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:21:15,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:21:15,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:21:15,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:21:15,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:21:15,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:21:15,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:21:15,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:21:15,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:21:15,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:21:15,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:21:15,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:21:15,865 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-RepeatedSemanticLbe.epf [2022-12-05 23:21:15,882 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:21:15,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:21:15,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:21:15,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:21:15,884 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:21:15,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:21:15,884 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:21:15,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:21:15,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:21:15,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:21:15,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:21:15,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:21:15,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:21:15,884 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:21:15,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:21:15,885 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:21:15,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:21:15,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:21:15,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:21:15,885 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:21:15,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:21:15,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:21:15,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:21:15,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:21:15,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:21:15,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:21:15,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:21:15,886 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:21:15,886 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:21:16,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:21:16,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:21:16,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:21:16,138 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:21:16,138 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:21:16,139 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe035_power.i [2022-12-05 23:21:17,136 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:21:17,395 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:21:17,395 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe035_power.i [2022-12-05 23:21:17,414 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/866e0c785/b0419ef2217e472baca39da66fa55887/FLAGe9a0a3fd1 [2022-12-05 23:21:17,424 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/866e0c785/b0419ef2217e472baca39da66fa55887 [2022-12-05 23:21:17,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:21:17,426 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:21:17,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:21:17,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:21:17,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:21:17,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:21:17" (1/1) ... [2022-12-05 23:21:17,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df43676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:17, skipping insertion in model container [2022-12-05 23:21:17,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:21:17" (1/1) ... [2022-12-05 23:21:17,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:21:17,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:21:17,577 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/safe035_power.i[947,960] [2022-12-05 23:21:17,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:21:17,750 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:21:17,760 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/safe035_power.i[947,960] [2022-12-05 23:21:17,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:17,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:17,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:21:17,876 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:21:17,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:17 WrapperNode [2022-12-05 23:21:17,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:21:17,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:21:17,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:21:17,877 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:21:17,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:17" (1/1) ... [2022-12-05 23:21:17,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:17" (1/1) ... [2022-12-05 23:21:17,934 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2022-12-05 23:21:17,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:21:17,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:21:17,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:21:17,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:21:17,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:17" (1/1) ... [2022-12-05 23:21:17,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:17" (1/1) ... [2022-12-05 23:21:17,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:17" (1/1) ... [2022-12-05 23:21:17,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:17" (1/1) ... [2022-12-05 23:21:17,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:17" (1/1) ... [2022-12-05 23:21:17,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:17" (1/1) ... [2022-12-05 23:21:17,975 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:17" (1/1) ... [2022-12-05 23:21:17,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:17" (1/1) ... [2022-12-05 23:21:17,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:21:17,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:21:17,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:21:17,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:21:17,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:17" (1/1) ... [2022-12-05 23:21:17,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:21:18,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:21:18,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:21:18,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:21:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:21:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:21:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:21:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:21:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:21:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:21:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:21:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:21:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:21:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:21:18,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:21:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:21:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:21:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:21:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:21:18,047 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:21:18,196 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:21:18,198 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:21:18,483 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:21:18,659 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:21:18,660 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:21:18,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:21:18 BoogieIcfgContainer [2022-12-05 23:21:18,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:21:18,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:21:18,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:21:18,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:21:18,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:21:17" (1/3) ... [2022-12-05 23:21:18,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f92dcd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:21:18, skipping insertion in model container [2022-12-05 23:21:18,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:17" (2/3) ... [2022-12-05 23:21:18,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f92dcd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:21:18, skipping insertion in model container [2022-12-05 23:21:18,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:21:18" (3/3) ... [2022-12-05 23:21:18,703 INFO L112 eAbstractionObserver]: Analyzing ICFG safe035_power.i [2022-12-05 23:21:18,717 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:21:18,717 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:21:18,718 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:21:18,764 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:21:18,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-05 23:21:18,847 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-05 23:21:18,847 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:21:18,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-05 23:21:18,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-05 23:21:18,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-05 23:21:18,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:18,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-05 23:21:18,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-05 23:21:18,912 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-05 23:21:18,912 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:21:18,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-05 23:21:18,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-05 23:21:18,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 2202 [2022-12-05 23:21:23,394 INFO L203 LiptonReduction]: Total number of compositions: 83 [2022-12-05 23:21:23,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:21:23,408 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=REPEATED_LIPTON_PN, 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;@60546b4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:21:23,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 23:21:23,412 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-05 23:21:23,412 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:21:23,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:23,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:23,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:21:23,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash -222839381, now seen corresponding path program 1 times [2022-12-05 23:21:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:23,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611707858] [2022-12-05 23:21:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:23,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:23,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:23,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611707858] [2022-12-05 23:21:23,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611707858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:23,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:23,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:21:23,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942496078] [2022-12-05 23:21:23,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:23,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:21:23,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:23,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:21:23,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:21:23,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-05 23:21:23,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:23,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:23,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-05 23:21:23,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:24,421 INFO L130 PetriNetUnfolder]: 2591/3744 cut-off events. [2022-12-05 23:21:24,421 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-05 23:21:24,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7563 conditions, 3744 events. 2591/3744 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 17473 event pairs, 371 based on Foata normal form. 0/3383 useless extension candidates. Maximal degree in co-relation 7552. Up to 3121 conditions per place. [2022-12-05 23:21:24,435 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2022-12-05 23:21:24,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 167 flow [2022-12-05 23:21:24,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:21:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:21:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-05 23:21:24,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2022-12-05 23:21:24,445 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 47 transitions. [2022-12-05 23:21:24,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 167 flow [2022-12-05 23:21:24,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:21:24,448 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2022-12-05 23:21:24,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-12-05 23:21:24,452 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-05 23:21:24,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:24,452 INFO L89 Accepts]: Start accepts. Operand has 35 places, 24 transitions, 58 flow [2022-12-05 23:21:24,454 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:24,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:24,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 58 flow [2022-12-05 23:21:24,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 58 flow [2022-12-05 23:21:24,459 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-05 23:21:24,459 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:21:24,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:21:24,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 58 flow [2022-12-05 23:21:24,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-05 23:21:24,542 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:21:24,543 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-05 23:21:24,543 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2022-12-05 23:21:24,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:24,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:24,544 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:24,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:21:24,544 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:21:24,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:24,545 INFO L85 PathProgramCache]: Analyzing trace with hash 599732064, now seen corresponding path program 1 times [2022-12-05 23:21:24,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:24,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374052015] [2022-12-05 23:21:24,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:24,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:24,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:24,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374052015] [2022-12-05 23:21:24,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374052015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:24,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:24,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:21:24,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231814306] [2022-12-05 23:21:24,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:24,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:21:24,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:24,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:21:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:21:24,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 23:21:24,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:24,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:24,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 23:21:24,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:24,994 INFO L130 PetriNetUnfolder]: 1466/2169 cut-off events. [2022-12-05 23:21:24,995 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-05 23:21:24,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4502 conditions, 2169 events. 1466/2169 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9196 event pairs, 698 based on Foata normal form. 90/2258 useless extension candidates. Maximal degree in co-relation 4492. Up to 1189 conditions per place. [2022-12-05 23:21:25,003 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-12-05 23:21:25,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 148 flow [2022-12-05 23:21:25,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:21:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:21:25,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 23:21:25,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-05 23:21:25,004 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 38 transitions. [2022-12-05 23:21:25,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 148 flow [2022-12-05 23:21:25,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:21:25,006 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 62 flow [2022-12-05 23:21:25,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-05 23:21:25,006 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2022-12-05 23:21:25,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:25,007 INFO L89 Accepts]: Start accepts. Operand has 34 places, 24 transitions, 62 flow [2022-12-05 23:21:25,007 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:25,007 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:25,007 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 62 flow [2022-12-05 23:21:25,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 62 flow [2022-12-05 23:21:25,012 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-05 23:21:25,012 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:21:25,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:21:25,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 62 flow [2022-12-05 23:21:25,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-05 23:21:25,047 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:21:25,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-05 23:21:25,048 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 62 flow [2022-12-05 23:21:25,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:25,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:25,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:25,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:21:25,048 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:21:25,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash -297827621, now seen corresponding path program 1 times [2022-12-05 23:21:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:25,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472556256] [2022-12-05 23:21:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:25,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:25,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472556256] [2022-12-05 23:21:25,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472556256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:25,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:25,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:21:25,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464966726] [2022-12-05 23:21:25,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:25,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:21:25,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:25,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:21:25,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:21:25,851 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 23:21:25,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:25,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:25,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 23:21:25,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:26,305 INFO L130 PetriNetUnfolder]: 2017/2976 cut-off events. [2022-12-05 23:21:26,306 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2022-12-05 23:21:26,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6451 conditions, 2976 events. 2017/2976 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13896 event pairs, 1134 based on Foata normal form. 30/3005 useless extension candidates. Maximal degree in co-relation 6440. Up to 2320 conditions per place. [2022-12-05 23:21:26,317 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 34 selfloop transitions, 14 changer transitions 0/49 dead transitions. [2022-12-05 23:21:26,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 211 flow [2022-12-05 23:21:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:21:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:21:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-05 23:21:26,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-05 23:21:26,320 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 62 flow. Second operand 5 states and 54 transitions. [2022-12-05 23:21:26,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 211 flow [2022-12-05 23:21:26,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:21:26,326 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 142 flow [2022-12-05 23:21:26,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2022-12-05 23:21:26,327 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2022-12-05 23:21:26,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:26,327 INFO L89 Accepts]: Start accepts. Operand has 38 places, 36 transitions, 142 flow [2022-12-05 23:21:26,328 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:26,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:26,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 36 transitions, 142 flow [2022-12-05 23:21:26,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 142 flow [2022-12-05 23:21:26,352 INFO L130 PetriNetUnfolder]: 90/254 cut-off events. [2022-12-05 23:21:26,352 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-05 23:21:26,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 254 events. 90/254 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1376 event pairs, 42 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 545. Up to 107 conditions per place. [2022-12-05 23:21:26,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 36 transitions, 142 flow [2022-12-05 23:21:26,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-05 23:21:26,384 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:21:26,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-05 23:21:26,385 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 142 flow [2022-12-05 23:21:26,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:26,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:26,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:26,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:21:26,386 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:21:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash -644169381, now seen corresponding path program 1 times [2022-12-05 23:21:26,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:26,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510382576] [2022-12-05 23:21:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:26,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:26,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510382576] [2022-12-05 23:21:26,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510382576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:26,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:26,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:21:26,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466293189] [2022-12-05 23:21:26,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:26,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:21:26,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:26,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:21:26,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:21:26,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 23:21:26,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:26,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:26,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 23:21:26,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:26,924 INFO L130 PetriNetUnfolder]: 1538/2411 cut-off events. [2022-12-05 23:21:26,925 INFO L131 PetriNetUnfolder]: For 1320/1320 co-relation queries the response was YES. [2022-12-05 23:21:26,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6752 conditions, 2411 events. 1538/2411 cut-off events. For 1320/1320 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12023 event pairs, 238 based on Foata normal form. 262/2672 useless extension candidates. Maximal degree in co-relation 6739. Up to 1113 conditions per place. [2022-12-05 23:21:26,933 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 61 selfloop transitions, 4 changer transitions 53/119 dead transitions. [2022-12-05 23:21:26,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 119 transitions, 719 flow [2022-12-05 23:21:26,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:21:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:21:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-05 23:21:26,935 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6416666666666667 [2022-12-05 23:21:26,935 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 142 flow. Second operand 5 states and 77 transitions. [2022-12-05 23:21:26,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 119 transitions, 719 flow [2022-12-05 23:21:26,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 119 transitions, 718 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:21:26,937 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 177 flow [2022-12-05 23:21:26,938 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2022-12-05 23:21:26,938 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2022-12-05 23:21:26,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:26,938 INFO L89 Accepts]: Start accepts. Operand has 44 places, 39 transitions, 177 flow [2022-12-05 23:21:26,939 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:26,939 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:26,939 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 39 transitions, 177 flow [2022-12-05 23:21:26,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 177 flow [2022-12-05 23:21:26,990 INFO L130 PetriNetUnfolder]: 156/401 cut-off events. [2022-12-05 23:21:26,991 INFO L131 PetriNetUnfolder]: For 134/162 co-relation queries the response was YES. [2022-12-05 23:21:26,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 401 events. 156/401 cut-off events. For 134/162 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2324 event pairs, 73 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 997. Up to 122 conditions per place. [2022-12-05 23:21:26,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 39 transitions, 177 flow [2022-12-05 23:21:26,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 442 [2022-12-05 23:21:26,995 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:21:26,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-05 23:21:26,996 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 177 flow [2022-12-05 23:21:26,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:26,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:26,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:26,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:21:26,996 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:21:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:26,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1011437616, now seen corresponding path program 1 times [2022-12-05 23:21:26,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:26,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944411913] [2022-12-05 23:21:26,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:26,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:27,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:27,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944411913] [2022-12-05 23:21:27,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944411913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:27,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:27,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 23:21:27,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262601770] [2022-12-05 23:21:27,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:27,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 23:21:27,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:27,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 23:21:27,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-05 23:21:27,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-05 23:21:27,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 177 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:27,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:27,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-05 23:21:27,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:28,358 INFO L130 PetriNetUnfolder]: 1720/2833 cut-off events. [2022-12-05 23:21:28,358 INFO L131 PetriNetUnfolder]: For 2194/2194 co-relation queries the response was YES. [2022-12-05 23:21:28,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9315 conditions, 2833 events. 1720/2833 cut-off events. For 2194/2194 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15411 event pairs, 626 based on Foata normal form. 60/2893 useless extension candidates. Maximal degree in co-relation 9298. Up to 1527 conditions per place. [2022-12-05 23:21:28,372 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 76 selfloop transitions, 15 changer transitions 12/104 dead transitions. [2022-12-05 23:21:28,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 104 transitions, 668 flow [2022-12-05 23:21:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:21:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:21:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-05 23:21:28,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:21:28,376 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 177 flow. Second operand 7 states and 84 transitions. [2022-12-05 23:21:28,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 104 transitions, 668 flow [2022-12-05 23:21:28,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 104 transitions, 648 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 23:21:28,387 INFO L231 Difference]: Finished difference. Result has 51 places, 53 transitions, 324 flow [2022-12-05 23:21:28,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=324, PETRI_PLACES=51, PETRI_TRANSITIONS=53} [2022-12-05 23:21:28,388 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-05 23:21:28,388 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:28,388 INFO L89 Accepts]: Start accepts. Operand has 51 places, 53 transitions, 324 flow [2022-12-05 23:21:28,389 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:28,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:28,390 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 53 transitions, 324 flow [2022-12-05 23:21:28,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 53 transitions, 324 flow [2022-12-05 23:21:28,465 INFO L130 PetriNetUnfolder]: 306/738 cut-off events. [2022-12-05 23:21:28,465 INFO L131 PetriNetUnfolder]: For 820/922 co-relation queries the response was YES. [2022-12-05 23:21:28,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 738 events. 306/738 cut-off events. For 820/922 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5051 event pairs, 113 based on Foata normal form. 3/680 useless extension candidates. Maximal degree in co-relation 2197. Up to 268 conditions per place. [2022-12-05 23:21:28,471 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 53 transitions, 324 flow [2022-12-05 23:21:28,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 482 [2022-12-05 23:21:28,506 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [520] $Ultimate##0-->L821: Formula: (and (= v_~y$r_buff0_thd2~0_125 v_~y$r_buff1_thd2~0_109) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~y$w_buff0~0_268 1) (= v_~y$w_buff1~0_240 v_~y$w_buff0~0_269) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_477 256) 0)) (not (= (mod v_~y$w_buff1_used~0_433 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~y$w_buff0_used~0_477 1) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= v_~y$r_buff0_thd3~0_151 v_~y$r_buff1_thd3~0_133) (= v_~y$w_buff0_used~0_478 v_~y$w_buff1_used~0_433) (= v_~y$r_buff0_thd0~0_152 v_~y$r_buff1_thd0~0_153) (= v_~y$r_buff0_thd3~0_150 1) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= v_~y$r_buff0_thd1~0_109 v_~y$r_buff1_thd1~0_100)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_478, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_152, ~y$w_buff0~0=v_~y$w_buff0~0_269, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_109, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_477, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_100, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_133, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_240, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_152, ~y$w_buff0~0=v_~y$w_buff0~0_268, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_109, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_433} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [452] $Ultimate##0-->L745: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~y~0_231 2)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_231, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] [2022-12-05 23:21:28,793 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [520] $Ultimate##0-->L821: Formula: (and (= v_~y$r_buff0_thd2~0_125 v_~y$r_buff1_thd2~0_109) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~y$w_buff0~0_268 1) (= v_~y$w_buff1~0_240 v_~y$w_buff0~0_269) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_477 256) 0)) (not (= (mod v_~y$w_buff1_used~0_433 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~y$w_buff0_used~0_477 1) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= v_~y$r_buff0_thd3~0_151 v_~y$r_buff1_thd3~0_133) (= v_~y$w_buff0_used~0_478 v_~y$w_buff1_used~0_433) (= v_~y$r_buff0_thd0~0_152 v_~y$r_buff1_thd0~0_153) (= v_~y$r_buff0_thd3~0_150 1) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= v_~y$r_buff0_thd1~0_109 v_~y$r_buff1_thd1~0_100)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_478, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_152, ~y$w_buff0~0=v_~y$w_buff0~0_269, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_109, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_477, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_100, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_133, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_240, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_152, ~y$w_buff0~0=v_~y$w_buff0~0_268, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_109, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_433} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [428] L772-->L779: Formula: (let ((.cse2 (not (= 0 (mod v_~y$r_buff1_thd2~0_56 256)))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_68 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_211 256))))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_212 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_183 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_211 (ite .cse0 0 v_~y$w_buff0_used~0_212)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_67 256) 0)) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_182 256) 0)))) 0 v_~y$r_buff1_thd2~0_56) v_~y$r_buff1_thd2~0_55) (= v_~y$r_buff0_thd2~0_67 (ite .cse3 0 v_~y$r_buff0_thd2~0_68)) (= v_~y$w_buff1_used~0_182 (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_183)) (= v_~y~0_137 (ite .cse0 v_~y$w_buff0~0_92 (ite .cse4 v_~y$w_buff1~0_87 v_~y~0_138)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$w_buff1~0=v_~y$w_buff1~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_92, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y~0=v_~y~0_138, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_183} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_55, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_211, ~y$w_buff1~0=v_~y$w_buff1~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_92, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, ~y~0=v_~y~0_137, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_182} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-05 23:21:28,985 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:21:28,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 598 [2022-12-05 23:21:28,986 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 52 transitions, 330 flow [2022-12-05 23:21:28,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:28,986 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:28,986 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:28,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:21:28,987 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:21:28,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1615888828, now seen corresponding path program 1 times [2022-12-05 23:21:28,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:28,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594270845] [2022-12-05 23:21:28,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:28,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:29,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:29,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594270845] [2022-12-05 23:21:29,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594270845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:29,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:29,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:21:29,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414582553] [2022-12-05 23:21:29,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:29,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:21:29,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:29,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:21:29,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:21:29,923 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-05 23:21:29,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 330 flow. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:29,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:29,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-05 23:21:29,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:30,440 INFO L130 PetriNetUnfolder]: 1790/2995 cut-off events. [2022-12-05 23:21:30,441 INFO L131 PetriNetUnfolder]: For 5088/5088 co-relation queries the response was YES. [2022-12-05 23:21:30,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11281 conditions, 2995 events. 1790/2995 cut-off events. For 5088/5088 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 17005 event pairs, 726 based on Foata normal form. 42/3037 useless extension candidates. Maximal degree in co-relation 11259. Up to 1235 conditions per place. [2022-12-05 23:21:30,455 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 90 selfloop transitions, 23 changer transitions 9/123 dead transitions. [2022-12-05 23:21:30,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 123 transitions, 937 flow [2022-12-05 23:21:30,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:21:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:21:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-12-05 23:21:30,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2022-12-05 23:21:30,457 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 330 flow. Second operand 6 states and 92 transitions. [2022-12-05 23:21:30,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 123 transitions, 937 flow [2022-12-05 23:21:30,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 123 transitions, 911 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-05 23:21:30,470 INFO L231 Difference]: Finished difference. Result has 58 places, 67 transitions, 511 flow [2022-12-05 23:21:30,470 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=511, PETRI_PLACES=58, PETRI_TRANSITIONS=67} [2022-12-05 23:21:30,472 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2022-12-05 23:21:30,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:30,472 INFO L89 Accepts]: Start accepts. Operand has 58 places, 67 transitions, 511 flow [2022-12-05 23:21:30,472 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:30,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:30,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 67 transitions, 511 flow [2022-12-05 23:21:30,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 67 transitions, 511 flow [2022-12-05 23:21:30,572 INFO L130 PetriNetUnfolder]: 490/1055 cut-off events. [2022-12-05 23:21:30,573 INFO L131 PetriNetUnfolder]: For 2770/2838 co-relation queries the response was YES. [2022-12-05 23:21:30,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4070 conditions, 1055 events. 490/1055 cut-off events. For 2770/2838 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7080 event pairs, 201 based on Foata normal form. 1/999 useless extension candidates. Maximal degree in co-relation 4046. Up to 439 conditions per place. [2022-12-05 23:21:30,584 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 67 transitions, 511 flow [2022-12-05 23:21:30,584 INFO L188 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-05 23:21:30,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:21:30,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-05 23:21:30,695 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 67 transitions, 513 flow [2022-12-05 23:21:30,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:30,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:30,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:30,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:21:30,695 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:21:30,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:30,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1892886673, now seen corresponding path program 1 times [2022-12-05 23:21:30,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:30,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560408957] [2022-12-05 23:21:30,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:30,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:30,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:30,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560408957] [2022-12-05 23:21:30,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560408957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:30,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:30,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:21:30,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705633740] [2022-12-05 23:21:30,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:30,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:21:30,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:30,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:21:30,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:21:30,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 23:21:30,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 67 transitions, 513 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:30,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:30,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 23:21:30,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:31,177 INFO L130 PetriNetUnfolder]: 1008/1750 cut-off events. [2022-12-05 23:21:31,177 INFO L131 PetriNetUnfolder]: For 5639/5639 co-relation queries the response was YES. [2022-12-05 23:21:31,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7538 conditions, 1750 events. 1008/1750 cut-off events. For 5639/5639 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9236 event pairs, 182 based on Foata normal form. 176/1924 useless extension candidates. Maximal degree in co-relation 7511. Up to 594 conditions per place. [2022-12-05 23:21:31,185 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 120 selfloop transitions, 7 changer transitions 57/185 dead transitions. [2022-12-05 23:21:31,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 185 transitions, 1760 flow [2022-12-05 23:21:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:21:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:21:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-05 23:21:31,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-05 23:21:31,187 INFO L175 Difference]: Start difference. First operand has 58 places, 67 transitions, 513 flow. Second operand 6 states and 98 transitions. [2022-12-05 23:21:31,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 185 transitions, 1760 flow [2022-12-05 23:21:31,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 185 transitions, 1700 flow, removed 22 selfloop flow, removed 1 redundant places. [2022-12-05 23:21:31,196 INFO L231 Difference]: Finished difference. Result has 65 places, 69 transitions, 542 flow [2022-12-05 23:21:31,196 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=542, PETRI_PLACES=65, PETRI_TRANSITIONS=69} [2022-12-05 23:21:31,196 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 27 predicate places. [2022-12-05 23:21:31,196 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:31,196 INFO L89 Accepts]: Start accepts. Operand has 65 places, 69 transitions, 542 flow [2022-12-05 23:21:31,197 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:31,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:31,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 69 transitions, 542 flow [2022-12-05 23:21:31,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 69 transitions, 542 flow [2022-12-05 23:21:31,248 INFO L130 PetriNetUnfolder]: 206/529 cut-off events. [2022-12-05 23:21:31,248 INFO L131 PetriNetUnfolder]: For 1512/1552 co-relation queries the response was YES. [2022-12-05 23:21:31,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2180 conditions, 529 events. 206/529 cut-off events. For 1512/1552 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3124 event pairs, 56 based on Foata normal form. 15/531 useless extension candidates. Maximal degree in co-relation 2152. Up to 207 conditions per place. [2022-12-05 23:21:31,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 69 transitions, 542 flow [2022-12-05 23:21:31,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-05 23:21:31,349 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:21:31,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-05 23:21:31,350 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 546 flow [2022-12-05 23:21:31,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:31,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:31,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:31,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:21:31,351 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:21:31,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1287095915, now seen corresponding path program 1 times [2022-12-05 23:21:31,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:31,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019392431] [2022-12-05 23:21:31,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:31,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:31,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:31,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019392431] [2022-12-05 23:21:31,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019392431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:31,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:31,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:21:31,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155791144] [2022-12-05 23:21:31,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:31,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:21:31,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:31,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:21:31,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:21:31,531 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 23:21:31,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 546 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:21:31,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:31,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 23:21:31,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:31,799 INFO L130 PetriNetUnfolder]: 679/1188 cut-off events. [2022-12-05 23:21:31,799 INFO L131 PetriNetUnfolder]: For 4071/4071 co-relation queries the response was YES. [2022-12-05 23:21:31,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 1188 events. 679/1188 cut-off events. For 4071/4071 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5911 event pairs, 176 based on Foata normal form. 32/1218 useless extension candidates. Maximal degree in co-relation 5329. Up to 594 conditions per place. [2022-12-05 23:21:31,806 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 112 selfloop transitions, 10 changer transitions 19/142 dead transitions. [2022-12-05 23:21:31,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 142 transitions, 1343 flow [2022-12-05 23:21:31,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:21:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:21:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-12-05 23:21:31,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4336734693877551 [2022-12-05 23:21:31,807 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 546 flow. Second operand 7 states and 85 transitions. [2022-12-05 23:21:31,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 142 transitions, 1343 flow [2022-12-05 23:21:31,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 142 transitions, 1260 flow, removed 34 selfloop flow, removed 5 redundant places. [2022-12-05 23:21:31,817 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 495 flow [2022-12-05 23:21:31,817 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=495, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2022-12-05 23:21:31,817 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 29 predicate places. [2022-12-05 23:21:31,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:31,818 INFO L89 Accepts]: Start accepts. Operand has 67 places, 67 transitions, 495 flow [2022-12-05 23:21:31,819 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:31,819 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:31,819 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 67 transitions, 495 flow [2022-12-05 23:21:31,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 67 transitions, 495 flow [2022-12-05 23:21:31,866 INFO L130 PetriNetUnfolder]: 164/416 cut-off events. [2022-12-05 23:21:31,867 INFO L131 PetriNetUnfolder]: For 832/851 co-relation queries the response was YES. [2022-12-05 23:21:31,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1552 conditions, 416 events. 164/416 cut-off events. For 832/851 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2399 event pairs, 38 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 1524. Up to 138 conditions per place. [2022-12-05 23:21:31,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 67 transitions, 495 flow [2022-12-05 23:21:31,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 394 Received shutdown request... [2022-12-05 23:35:57,429 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 23:35:57,455 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-12-05 23:35:57,456 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 23:35:57,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:35:57,457 WARN L619 AbstractCegarLoop]: Verification canceled: while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-5-4-5-4-5-4-5-4-3-2-5-4-3-2-5-4-3-2-3-2-5-4-3-2-2-2-3-2-2-2-5-4-2-2-5-4-2-2-5-4-2-2-5-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ATOM-1 context. [2022-12-05 23:35:57,458 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 23:35:57,460 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 23:35:57,460 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 23:35:57,460 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 23:35:57,460 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 23:35:57,460 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:35:57,463 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:35:57,463 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:35:57,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:35:57 BasicIcfg [2022-12-05 23:35:57,465 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:35:57,465 INFO L158 Benchmark]: Toolchain (without parser) took 880038.58ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 147.3MB in the beginning and 851.2MB in the end (delta: -703.9MB). Peak memory consumption was 749.5MB. Max. memory is 8.0GB. [2022-12-05 23:35:57,465 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 105.5MB in the beginning and 105.5MB in the end (delta: 38.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:35:57,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.13ms. Allocated memory is still 174.1MB. Free memory was 146.9MB in the beginning and 115.8MB in the end (delta: 31.1MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-05 23:35:57,466 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.79ms. Allocated memory is still 174.1MB. Free memory was 115.8MB in the beginning and 149.5MB in the end (delta: -33.8MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2022-12-05 23:35:57,466 INFO L158 Benchmark]: Boogie Preprocessor took 37.60ms. Allocated memory is still 174.1MB. Free memory was 149.5MB in the beginning and 146.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:35:57,466 INFO L158 Benchmark]: RCFGBuilder took 717.74ms. Allocated memory is still 174.1MB. Free memory was 146.9MB in the beginning and 146.6MB in the end (delta: 332.5kB). Peak memory consumption was 62.6MB. Max. memory is 8.0GB. [2022-12-05 23:35:57,466 INFO L158 Benchmark]: TraceAbstraction took 878766.25ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 146.2MB in the beginning and 851.2MB in the end (delta: -705.0MB). Peak memory consumption was 748.1MB. Max. memory is 8.0GB. [2022-12-05 23:35:57,467 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.09ms. Allocated memory is still 127.9MB. Free memory was 105.5MB in the beginning and 105.5MB in the end (delta: 38.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 449.13ms. Allocated memory is still 174.1MB. Free memory was 146.9MB in the beginning and 115.8MB in the end (delta: 31.1MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.79ms. Allocated memory is still 174.1MB. Free memory was 115.8MB in the beginning and 149.5MB in the end (delta: -33.8MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.60ms. Allocated memory is still 174.1MB. Free memory was 149.5MB in the beginning and 146.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 717.74ms. Allocated memory is still 174.1MB. Free memory was 146.9MB in the beginning and 146.6MB in the end (delta: 332.5kB). Peak memory consumption was 62.6MB. Max. memory is 8.0GB. * TraceAbstraction took 878766.25ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 146.2MB in the beginning and 851.2MB in the end (delta: -705.0MB). Peak memory consumption was 748.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 117 PlacesBefore, 38 PlacesAfterwards, 109 TransitionsBefore, 29 TransitionsAfterwards, 2202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1726, independent: 1659, independent conditional: 1659, independent unconditional: 0, dependent: 67, dependent conditional: 67, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1726, independent: 1659, independent conditional: 0, independent unconditional: 1659, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1726, independent: 1659, independent conditional: 0, independent unconditional: 1659, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1726, independent: 1659, independent conditional: 0, independent unconditional: 1659, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1342, independent: 1298, independent conditional: 0, independent unconditional: 1298, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1342, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 329, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 298, dependent conditional: 0, dependent unconditional: 298, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1726, independent: 361, independent conditional: 0, independent unconditional: 361, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1342, unknown conditional: 0, unknown unconditional: 1342] , Statistics on independence cache: Total cache size (in pairs): 2105, Positive cache size: 2061, Positive conditional cache size: 0, Positive unconditional cache size: 2061, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 83, independent: 55, independent conditional: 1, independent unconditional: 54, dependent: 28, dependent conditional: 1, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, independent: 55, independent conditional: 1, independent unconditional: 54, dependent: 28, dependent conditional: 1, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, independent: 55, independent conditional: 1, independent unconditional: 54, dependent: 28, dependent conditional: 1, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 79, independent: 54, independent conditional: 1, independent unconditional: 53, dependent: 25, dependent conditional: 1, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 79, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 25, dependent conditional: 1, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 79, dependent conditional: 3, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 79, unknown conditional: 2, unknown unconditional: 77] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 54, Positive conditional cache size: 1, Positive unconditional cache size: 53, Negative cache size: 25, Negative conditional cache size: 1, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 82, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 56, Positive conditional cache size: 1, Positive unconditional cache size: 55, Negative cache size: 29, Negative conditional cache size: 1, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 142, independent conditional: 142, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 164, independent: 142, independent conditional: 87, independent unconditional: 55, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 142, independent conditional: 69, independent unconditional: 73, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 142, independent conditional: 69, independent unconditional: 73, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 23, independent conditional: 11, independent unconditional: 12, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 19, dependent conditional: 8, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, independent: 119, independent conditional: 58, independent unconditional: 61, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 27, unknown conditional: 13, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 79, Positive conditional cache size: 12, Positive unconditional cache size: 67, Negative cache size: 33, Negative conditional cache size: 3, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 31, independent conditional: 13, independent unconditional: 18, dependent: 15, dependent conditional: 7, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 31, independent conditional: 10, independent unconditional: 21, dependent: 15, dependent conditional: 7, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 31, independent conditional: 10, independent unconditional: 21, dependent: 15, dependent conditional: 7, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 15, dependent conditional: 7, dependent unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 80, Positive conditional cache size: 12, Positive unconditional cache size: 68, Negative cache size: 33, Negative conditional cache size: 3, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 51 PlacesBefore, 50 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 69, independent conditional: 57, independent unconditional: 12, dependent: 30, dependent conditional: 12, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 69, independent conditional: 15, independent unconditional: 54, dependent: 30, dependent conditional: 12, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 69, independent conditional: 15, independent unconditional: 54, dependent: 30, dependent conditional: 12, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, independent: 68, independent conditional: 14, independent unconditional: 54, dependent: 29, dependent conditional: 11, dependent unconditional: 18, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 83, Positive conditional cache size: 13, Positive unconditional cache size: 70, Negative cache size: 34, Negative conditional cache size: 4, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 58 PlacesBefore, 58 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, independent: 132, independent conditional: 132, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 172, independent: 132, independent conditional: 93, independent unconditional: 39, dependent: 40, dependent conditional: 24, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 172, independent: 132, independent conditional: 34, independent unconditional: 98, dependent: 40, dependent conditional: 24, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 172, independent: 132, independent conditional: 34, independent unconditional: 98, dependent: 40, dependent conditional: 24, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 172, independent: 123, independent conditional: 30, independent unconditional: 93, dependent: 38, dependent conditional: 22, dependent unconditional: 16, unknown: 11, unknown conditional: 6, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 92, Positive conditional cache size: 17, Positive unconditional cache size: 75, Negative cache size: 36, Negative conditional cache size: 6, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 59, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 63 PlacesBefore, 63 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 152, independent conditional: 152, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 196, independent: 152, independent conditional: 81, independent unconditional: 71, dependent: 44, dependent conditional: 28, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 196, independent: 152, independent conditional: 60, independent unconditional: 92, dependent: 44, dependent conditional: 28, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 196, independent: 152, independent conditional: 60, independent unconditional: 92, dependent: 44, dependent conditional: 28, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 196, independent: 147, independent conditional: 58, independent unconditional: 89, dependent: 44, dependent conditional: 28, dependent unconditional: 16, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 98, Positive conditional cache size: 19, Positive unconditional cache size: 79, Negative cache size: 36, Negative conditional cache size: 6, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-5-4-5-4-5-4-5-4-3-2-5-4-3-2-5-4-3-2-3-2-5-4-3-2-2-2-3-2-2-2-5-4-2-2-5-4-2-2-5-4-2-2-5-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-5-4-5-4-5-4-5-4-3-2-5-4-3-2-5-4-3-2-3-2-5-4-3-2-2-2-3-2-2-2-5-4-2-2-5-4-2-2-5-4-2-2-5-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 871]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-5-4-5-4-5-4-5-4-3-2-5-4-3-2-5-4-3-2-3-2-5-4-3-2-2-2-3-2-2-2-5-4-2-2-5-4-2-2-5-4-2-2-5-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 873]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-5-4-5-4-5-4-5-4-3-2-5-4-3-2-5-4-3-2-3-2-5-4-3-2-2-2-3-2-2-2-5-4-2-2-5-4-2-2-5-4-2-2-5-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 869]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-5-4-5-4-5-4-5-4-3-2-5-4-3-2-5-4-3-2-3-2-5-4-3-2-2-2-3-2-2-2-5-4-2-2-5-4-2-2-5-4-2-2-5-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 878.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 289 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 289 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1079 IncrementalHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 0 mSDtfsCounter, 1079 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=546occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 615 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 could not prove your program: Timeout Completed graceful shutdown