/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/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:10:26,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:10:26,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:10:26,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:10:26,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:10:26,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:10:26,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:10:26,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:10:26,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:10:26,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:10:26,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:10:26,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:10:27,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:10:27,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:10:27,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:10:27,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:10:27,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:10:27,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:10:27,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:10:27,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:10:27,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:10:27,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:10:27,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:10:27,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:10:27,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:10:27,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:10:27,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:10:27,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:10:27,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:10:27,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:10:27,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:10:27,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:10:27,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:10:27,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:10:27,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:10:27,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:10:27,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:10:27,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:10:27,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:10:27,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:10:27,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:10:27,017 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:10:27,031 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:10:27,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:10:27,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:10:27,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:10:27,032 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:10:27,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:10:27,033 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:10:27,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:10:27,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:10:27,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:10:27,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:10:27,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:10:27,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:10:27,034 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:10:27,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:10:27,034 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:10:27,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:10:27,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:10:27,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:10:27,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:10:27,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:10:27,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:10:27,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:10:27,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:10:27,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:10:27,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:10:27,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:10:27,035 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:10:27,036 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:10:27,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:10:27,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:10:27,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:10:27,345 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:10:27,346 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:10:27,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-12-05 23:10:28,375 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:10:28,590 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:10:28,591 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-12-05 23:10:28,604 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/677e2ba5a/e1a1cadbfe134f93bcf36cabeb44ec36/FLAGe2bcebdf2 [2022-12-05 23:10:28,615 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/677e2ba5a/e1a1cadbfe134f93bcf36cabeb44ec36 [2022-12-05 23:10:28,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:10:28,618 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:10:28,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:10:28,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:10:28,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:10:28,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:10:28" (1/1) ... [2022-12-05 23:10:28,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39da6313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:10:28, skipping insertion in model container [2022-12-05 23:10:28,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:10:28" (1/1) ... [2022-12-05 23:10:28,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:10:28,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:10:28,764 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/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2022-12-05 23:10:28,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:10:28,884 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:10:28,896 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/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2022-12-05 23:10:28,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:10:28,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:10:28,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:10:28,996 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:10:28,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:10:28 WrapperNode [2022-12-05 23:10:28,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:10:28,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:10:28,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:10:28,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:10:29,002 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:10:28" (1/1) ... [2022-12-05 23:10:29,022 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:10:28" (1/1) ... [2022-12-05 23:10:29,039 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-05 23:10:29,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:10:29,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:10:29,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:10:29,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:10:29,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:10:28" (1/1) ... [2022-12-05 23:10:29,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:10:28" (1/1) ... [2022-12-05 23:10:29,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:10:28" (1/1) ... [2022-12-05 23:10:29,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:10:28" (1/1) ... [2022-12-05 23:10:29,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:10:28" (1/1) ... [2022-12-05 23:10:29,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:10:28" (1/1) ... [2022-12-05 23:10:29,073 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:10:28" (1/1) ... [2022-12-05 23:10:29,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:10:28" (1/1) ... [2022-12-05 23:10:29,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:10:29,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:10:29,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:10:29,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:10:29,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:10:28" (1/1) ... [2022-12-05 23:10:29,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:10:29,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:10:29,110 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:10:29,117 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:10:29,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:10:29,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:10:29,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:10:29,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:10:29,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:10:29,141 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:10:29,141 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:10:29,141 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:10:29,141 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:10:29,141 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:10:29,141 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:10:29,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:10:29,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:10:29,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:10:29,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:10:29,142 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:10:29,296 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:10:29,297 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:10:29,566 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:10:29,677 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:10:29,678 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:10:29,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:10:29 BoogieIcfgContainer [2022-12-05 23:10:29,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:10:29,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:10:29,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:10:29,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:10:29,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:10:28" (1/3) ... [2022-12-05 23:10:29,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f92325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:10:29, skipping insertion in model container [2022-12-05 23:10:29,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:10:28" (2/3) ... [2022-12-05 23:10:29,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f92325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:10:29, skipping insertion in model container [2022-12-05 23:10:29,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:10:29" (3/3) ... [2022-12-05 23:10:29,686 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-12-05 23:10:29,698 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:10:29,698 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:10:29,698 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:10:29,746 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:10:29,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-05 23:10:29,850 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-05 23:10:29,851 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:10:29,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 23:10:29,855 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-05 23:10:29,858 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-05 23:10:29,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:10:29,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-05 23:10:29,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-05 23:10:29,919 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-05 23:10:29,920 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:10:29,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 23:10:29,923 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-05 23:10:29,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-05 23:10:34,383 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-05 23:10:34,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:10:34,397 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;@4b8178e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:10:34,397 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 23:10:34,399 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-05 23:10:34,399 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:10:34,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:10:34,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:10:34,400 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:10:34,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:10:34,403 INFO L85 PathProgramCache]: Analyzing trace with hash 443002296, now seen corresponding path program 1 times [2022-12-05 23:10:34,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:10:34,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791822995] [2022-12-05 23:10:34,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:10:34,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:10:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:10:34,630 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:10:34,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:10:34,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791822995] [2022-12-05 23:10:34,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791822995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:10:34,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:10:34,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:10:34,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722721447] [2022-12-05 23:10:34,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:10:34,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:10:34,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:10:34,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:10:34,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:10:34,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 23:10:34,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:10:34,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:10:34,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 23:10:34,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:10:34,915 INFO L130 PetriNetUnfolder]: 879/1434 cut-off events. [2022-12-05 23:10:34,916 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 23:10:34,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 1434 events. 879/1434 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7495 event pairs, 144 based on Foata normal form. 0/1281 useless extension candidates. Maximal degree in co-relation 2790. Up to 1060 conditions per place. [2022-12-05 23:10:34,923 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2022-12-05 23:10:34,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2022-12-05 23:10:34,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:10:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:10:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-05 23:10:34,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-05 23:10:34,932 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 49 transitions. [2022-12-05 23:10:34,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2022-12-05 23:10:34,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:10:34,935 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 52 flow [2022-12-05 23:10:34,936 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, 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=52, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-05 23:10:34,938 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-05 23:10:34,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:10:34,939 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 52 flow [2022-12-05 23:10:34,940 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:10:34,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:10:34,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 52 flow [2022-12-05 23:10:34,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-05 23:10:34,945 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-05 23:10:34,945 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:10:34,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:10:34,946 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-05 23:10:34,946 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-05 23:10:35,013 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:10:35,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-05 23:10:35,031 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-05 23:10:35,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:10:35,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:10:35,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:10:35,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:10:35,035 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:10:35,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:10:35,035 INFO L85 PathProgramCache]: Analyzing trace with hash 539521193, now seen corresponding path program 1 times [2022-12-05 23:10:35,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:10:35,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907059990] [2022-12-05 23:10:35,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:10:35,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:10:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:10:35,188 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:10:35,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:10:35,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907059990] [2022-12-05 23:10:35,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907059990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:10:35,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:10:35,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:10:35,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323670905] [2022-12-05 23:10:35,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:10:35,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:10:35,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:10:35,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:10:35,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:10:35,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-05 23:10:35,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:10:35,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:10:35,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-05 23:10:35,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:10:35,309 INFO L130 PetriNetUnfolder]: 527/830 cut-off events. [2022-12-05 23:10:35,309 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-05 23:10:35,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1752 conditions, 830 events. 527/830 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3477 event pairs, 259 based on Foata normal form. 16/841 useless extension candidates. Maximal degree in co-relation 1742. Up to 687 conditions per place. [2022-12-05 23:10:35,312 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 28 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-05 23:10:35,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 142 flow [2022-12-05 23:10:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:10:35,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:10:35,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-05 23:10:35,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2022-12-05 23:10:35,314 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 40 transitions. [2022-12-05 23:10:35,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 142 flow [2022-12-05 23:10:35,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:10:35,314 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-12-05 23:10:35,315 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-05 23:10:35,315 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2022-12-05 23:10:35,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:10:35,315 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 56 flow [2022-12-05 23:10:35,316 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:10:35,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:10:35,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-05 23:10:35,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2022-12-05 23:10:35,319 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-05 23:10:35,319 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:10:35,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:10:35,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-05 23:10:35,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-05 23:10:35,328 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:10:35,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-05 23:10:35,329 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2022-12-05 23:10:35,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:10:35,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:10:35,329 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:10:35,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:10:35,329 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:10:35,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:10:35,330 INFO L85 PathProgramCache]: Analyzing trace with hash -454712494, now seen corresponding path program 1 times [2022-12-05 23:10:35,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:10:35,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061914151] [2022-12-05 23:10:35,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:10:35,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:10:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:10:35,429 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:10:35,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:10:35,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061914151] [2022-12-05 23:10:35,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061914151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:10:35,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:10:35,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:10:35,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644494474] [2022-12-05 23:10:35,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:10:35,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:10:35,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:10:35,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:10:35,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:10:35,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 23:10:35,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:10:35,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:10:35,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 23:10:35,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:10:35,619 INFO L130 PetriNetUnfolder]: 1187/1877 cut-off events. [2022-12-05 23:10:35,619 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-12-05 23:10:35,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 1877 events. 1187/1877 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9410 event pairs, 209 based on Foata normal form. 75/1951 useless extension candidates. Maximal degree in co-relation 3982. Up to 853 conditions per place. [2022-12-05 23:10:35,626 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 36 selfloop transitions, 4 changer transitions 5/46 dead transitions. [2022-12-05 23:10:35,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 203 flow [2022-12-05 23:10:35,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:10:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:10:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-05 23:10:35,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-05 23:10:35,629 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 4 states and 51 transitions. [2022-12-05 23:10:35,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 203 flow [2022-12-05 23:10:35,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 46 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:10:35,630 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 78 flow [2022-12-05 23:10:35,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-12-05 23:10:35,631 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2022-12-05 23:10:35,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:10:35,631 INFO L89 Accepts]: Start accepts. Operand has 34 places, 23 transitions, 78 flow [2022-12-05 23:10:35,632 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:10:35,632 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:10:35,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 78 flow [2022-12-05 23:10:35,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 78 flow [2022-12-05 23:10:35,637 INFO L130 PetriNetUnfolder]: 3/35 cut-off events. [2022-12-05 23:10:35,637 INFO L131 PetriNetUnfolder]: For 9/12 co-relation queries the response was YES. [2022-12-05 23:10:35,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 35 events. 3/35 cut-off events. For 9/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 85 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 60. Up to 10 conditions per place. [2022-12-05 23:10:35,638 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 78 flow [2022-12-05 23:10:35,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-05 23:10:35,668 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:10:35,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-05 23:10:35,669 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 78 flow [2022-12-05 23:10:35,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:10:35,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:10:35,670 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:10:35,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:10:35,670 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:10:35,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:10:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash 72532859, now seen corresponding path program 1 times [2022-12-05 23:10:35,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:10:35,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617797545] [2022-12-05 23:10:35,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:10:35,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:10:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:10:35,777 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:10:35,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:10:35,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617797545] [2022-12-05 23:10:35,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617797545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:10:35,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:10:35,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:10:35,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537034585] [2022-12-05 23:10:35,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:10:35,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:10:35,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:10:35,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:10:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:10:35,779 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 23:10:35,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:10:35,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:10:35,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 23:10:35,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:10:35,979 INFO L130 PetriNetUnfolder]: 1130/1848 cut-off events. [2022-12-05 23:10:35,980 INFO L131 PetriNetUnfolder]: For 875/875 co-relation queries the response was YES. [2022-12-05 23:10:35,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4186 conditions, 1848 events. 1130/1848 cut-off events. For 875/875 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9840 event pairs, 326 based on Foata normal form. 99/1947 useless extension candidates. Maximal degree in co-relation 4173. Up to 661 conditions per place. [2022-12-05 23:10:35,985 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 30 selfloop transitions, 3 changer transitions 21/55 dead transitions. [2022-12-05 23:10:35,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 55 transitions, 260 flow [2022-12-05 23:10:35,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:10:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:10:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-05 23:10:35,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2022-12-05 23:10:35,986 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 78 flow. Second operand 5 states and 61 transitions. [2022-12-05 23:10:35,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 55 transitions, 260 flow [2022-12-05 23:10:35,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 248 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-05 23:10:35,989 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 86 flow [2022-12-05 23:10:35,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2022-12-05 23:10:35,990 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-05 23:10:35,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:10:35,990 INFO L89 Accepts]: Start accepts. Operand has 38 places, 23 transitions, 86 flow [2022-12-05 23:10:35,990 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:10:35,990 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:10:35,990 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 23 transitions, 86 flow [2022-12-05 23:10:35,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 23 transitions, 86 flow [2022-12-05 23:10:35,994 INFO L130 PetriNetUnfolder]: 0/38 cut-off events. [2022-12-05 23:10:35,994 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-05 23:10:35,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 38 events. 0/38 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 103 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2022-12-05 23:10:35,995 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 86 flow [2022-12-05 23:10:35,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-05 23:10:36,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] L791-->L794: Formula: (= 2 v_~y~0_4) InVars {} OutVars{~y~0=v_~y~0_4} AuxVars[] AssignedVars[~y~0] and [367] $Ultimate##0-->L742: 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_32 v_~__unbuffered_p0_EAX~0_28)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_32} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, 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_32, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_~arg.base] [2022-12-05 23:10:36,050 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:10:36,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-05 23:10:36,051 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 89 flow [2022-12-05 23:10:36,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:10:36,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:10:36,052 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:10:36,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:10:36,052 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:10:36,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:10:36,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1177093035, now seen corresponding path program 1 times [2022-12-05 23:10:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:10:36,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031088678] [2022-12-05 23:10:36,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:10:36,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:10:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:10:36,156 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:10:36,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:10:36,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031088678] [2022-12-05 23:10:36,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031088678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:10:36,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:10:36,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:10:36,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285040677] [2022-12-05 23:10:36,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:10:36,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:10:36,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:10:36,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:10:36,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:10:36,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-05 23:10:36,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:10:36,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:10:36,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-05 23:10:36,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:10:36,289 INFO L130 PetriNetUnfolder]: 740/1221 cut-off events. [2022-12-05 23:10:36,289 INFO L131 PetriNetUnfolder]: For 1190/1190 co-relation queries the response was YES. [2022-12-05 23:10:36,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2812 conditions, 1221 events. 740/1221 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5832 event pairs, 359 based on Foata normal form. 45/1266 useless extension candidates. Maximal degree in co-relation 2798. Up to 732 conditions per place. [2022-12-05 23:10:36,292 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 25 selfloop transitions, 3 changer transitions 10/39 dead transitions. [2022-12-05 23:10:36,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 207 flow [2022-12-05 23:10:36,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:10:36,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:10:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-05 23:10:36,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48863636363636365 [2022-12-05 23:10:36,293 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 89 flow. Second operand 4 states and 43 transitions. [2022-12-05 23:10:36,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 207 flow [2022-12-05 23:10:36,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 193 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-05 23:10:36,297 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 76 flow [2022-12-05 23:10:36,297 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2022-12-05 23:10:36,297 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-05 23:10:36,297 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:10:36,297 INFO L89 Accepts]: Start accepts. Operand has 37 places, 21 transitions, 76 flow [2022-12-05 23:10:36,298 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:10:36,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:10:36,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 21 transitions, 76 flow [2022-12-05 23:10:36,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 21 transitions, 76 flow [2022-12-05 23:10:36,301 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-05 23:10:36,301 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-05 23:10:36,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 21 events. 0/21 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-05 23:10:36,301 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 21 transitions, 76 flow [2022-12-05 23:10:36,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-05 23:10:36,442 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:10:36,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-05 23:10:36,443 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 72 flow [2022-12-05 23:10:36,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:10:36,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:10:36,443 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:10:36,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:10:36,443 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:10:36,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:10:36,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1378453527, now seen corresponding path program 1 times [2022-12-05 23:10:36,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:10:36,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706629244] [2022-12-05 23:10:36,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:10:36,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:10:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:10:36,866 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:10:36,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:10:36,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706629244] [2022-12-05 23:10:36,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706629244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:10:36,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:10:36,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:10:36,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400981449] [2022-12-05 23:10:36,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:10:36,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:10:36,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:10:36,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:10:36,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:10:36,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-05 23:10:36,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 19 transitions, 72 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:10:36,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:10:36,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-05 23:10:36,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:10:36,968 INFO L130 PetriNetUnfolder]: 336/529 cut-off events. [2022-12-05 23:10:36,968 INFO L131 PetriNetUnfolder]: For 441/441 co-relation queries the response was YES. [2022-12-05 23:10:36,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1319 conditions, 529 events. 336/529 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1803 event pairs, 142 based on Foata normal form. 1/530 useless extension candidates. Maximal degree in co-relation 1305. Up to 503 conditions per place. [2022-12-05 23:10:36,970 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 27 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2022-12-05 23:10:36,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 174 flow [2022-12-05 23:10:36,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:10:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:10:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-05 23:10:36,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2022-12-05 23:10:36,972 INFO L175 Difference]: Start difference. First operand has 35 places, 19 transitions, 72 flow. Second operand 4 states and 33 transitions. [2022-12-05 23:10:36,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 174 flow [2022-12-05 23:10:36,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 153 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-05 23:10:36,973 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 82 flow [2022-12-05 23:10:36,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-05 23:10:36,973 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-05 23:10:36,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:10:36,974 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 82 flow [2022-12-05 23:10:36,974 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:10:36,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:10:36,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 82 flow [2022-12-05 23:10:36,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 82 flow [2022-12-05 23:10:36,980 INFO L130 PetriNetUnfolder]: 14/50 cut-off events. [2022-12-05 23:10:36,980 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-05 23:10:36,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 50 events. 14/50 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 145 event pairs, 6 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 96. Up to 29 conditions per place. [2022-12-05 23:10:36,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 82 flow [2022-12-05 23:10:36,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 23:10:37,225 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:10:37,226 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-05 23:10:37,226 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 89 flow [2022-12-05 23:10:37,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:10:37,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:10:37,226 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:10:37,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:10:37,226 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:10:37,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:10:37,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1110313103, now seen corresponding path program 1 times [2022-12-05 23:10:37,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:10:37,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197804440] [2022-12-05 23:10:37,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:10:37,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:10:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:10:37,318 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:10:37,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:10:37,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197804440] [2022-12-05 23:10:37,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197804440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:10:37,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:10:37,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:10:37,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174005743] [2022-12-05 23:10:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:10:37,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:10:37,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:10:37,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:10:37,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:10:37,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 23:10:37,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:10:37,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:10:37,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 23:10:37,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:10:37,465 INFO L130 PetriNetUnfolder]: 242/435 cut-off events. [2022-12-05 23:10:37,465 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-12-05 23:10:37,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 435 events. 242/435 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1769 event pairs, 42 based on Foata normal form. 49/480 useless extension candidates. Maximal degree in co-relation 1124. Up to 276 conditions per place. [2022-12-05 23:10:37,467 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 40 selfloop transitions, 7 changer transitions 5/53 dead transitions. [2022-12-05 23:10:37,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 53 transitions, 306 flow [2022-12-05 23:10:37,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:10:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:10:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-05 23:10:37,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2022-12-05 23:10:37,468 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 89 flow. Second operand 5 states and 57 transitions. [2022-12-05 23:10:37,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 53 transitions, 306 flow [2022-12-05 23:10:37,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 53 transitions, 290 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-05 23:10:37,471 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 134 flow [2022-12-05 23:10:37,471 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-12-05 23:10:37,472 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-05 23:10:37,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:10:37,472 INFO L89 Accepts]: Start accepts. Operand has 38 places, 28 transitions, 134 flow [2022-12-05 23:10:37,472 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:10:37,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:10:37,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 134 flow [2022-12-05 23:10:37,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 134 flow [2022-12-05 23:10:37,485 INFO L130 PetriNetUnfolder]: 59/148 cut-off events. [2022-12-05 23:10:37,489 INFO L131 PetriNetUnfolder]: For 79/87 co-relation queries the response was YES. [2022-12-05 23:10:37,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 148 events. 59/148 cut-off events. For 79/87 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 645 event pairs, 25 based on Foata normal form. 5/141 useless extension candidates. Maximal degree in co-relation 396. Up to 79 conditions per place. [2022-12-05 23:10:37,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 134 flow [2022-12-05 23:10:37,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-05 23:10:37,494 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] L823-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_20 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_20 256)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [429] L801-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] [2022-12-05 23:10:37,531 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] L823-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_20 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_20 256)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [416] L781-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res#1.offset_7| 0) (= v_~__unbuffered_cnt~0_65 (+ v_~__unbuffered_cnt~0_66 1)) (= |v_P1Thread1of1ForFork0_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_7|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset] [2022-12-05 23:10:37,576 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:10:37,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-05 23:10:37,577 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 136 flow [2022-12-05 23:10:37,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:10:37,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:10:37,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:10:37,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:10:37,577 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:10:37,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:10:37,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1570882283, now seen corresponding path program 1 times [2022-12-05 23:10:37,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:10:37,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39275773] [2022-12-05 23:10:37,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:10:37,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:10:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:10:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:10:37,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:10:37,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39275773] [2022-12-05 23:10:37,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39275773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:10:37,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:10:37,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:10:37,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267810019] [2022-12-05 23:10:37,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:10:37,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:10:37,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:10:37,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:10:37,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:10:37,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-05 23:10:37,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:10:37,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:10:37,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-05 23:10:37,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:10:37,832 INFO L130 PetriNetUnfolder]: 136/278 cut-off events. [2022-12-05 23:10:37,832 INFO L131 PetriNetUnfolder]: For 330/330 co-relation queries the response was YES. [2022-12-05 23:10:37,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 278 events. 136/278 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1107 event pairs, 14 based on Foata normal form. 30/308 useless extension candidates. Maximal degree in co-relation 987. Up to 133 conditions per place. [2022-12-05 23:10:37,834 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 36 selfloop transitions, 12 changer transitions 8/57 dead transitions. [2022-12-05 23:10:37,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 57 transitions, 380 flow [2022-12-05 23:10:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:10:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:10:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-05 23:10:37,835 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45652173913043476 [2022-12-05 23:10:37,835 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 136 flow. Second operand 6 states and 63 transitions. [2022-12-05 23:10:37,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 57 transitions, 380 flow [2022-12-05 23:10:37,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 372 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 23:10:37,836 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 214 flow [2022-12-05 23:10:37,837 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-12-05 23:10:37,837 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-05 23:10:37,837 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:10:37,837 INFO L89 Accepts]: Start accepts. Operand has 44 places, 33 transitions, 214 flow [2022-12-05 23:10:37,838 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:10:37,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:10:37,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 214 flow [2022-12-05 23:10:37,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 214 flow [2022-12-05 23:10:37,846 INFO L130 PetriNetUnfolder]: 26/99 cut-off events. [2022-12-05 23:10:37,846 INFO L131 PetriNetUnfolder]: For 205/212 co-relation queries the response was YES. [2022-12-05 23:10:37,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 99 events. 26/99 cut-off events. For 205/212 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 404 event pairs, 5 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 362. Up to 60 conditions per place. [2022-12-05 23:10:37,847 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 214 flow [2022-12-05 23:10:37,847 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-05 23:10:37,871 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:10:37,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-05 23:10:37,872 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 206 flow [2022-12-05 23:10:37,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:10:37,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:10:37,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:10:37,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:10:37,872 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:10:37,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:10:37,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1281019689, now seen corresponding path program 1 times [2022-12-05 23:10:37,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:10:37,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927814277] [2022-12-05 23:10:37,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:10:37,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:10:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:10:37,981 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:10:37,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:10:37,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927814277] [2022-12-05 23:10:37,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927814277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:10:37,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:10:37,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:10:37,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333210179] [2022-12-05 23:10:37,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:10:37,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:10:37,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:10:37,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:10:37,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:10:37,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-05 23:10:37,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:10:37,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:10:37,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-05 23:10:37,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:10:38,084 INFO L130 PetriNetUnfolder]: 82/176 cut-off events. [2022-12-05 23:10:38,085 INFO L131 PetriNetUnfolder]: For 487/487 co-relation queries the response was YES. [2022-12-05 23:10:38,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 176 events. 82/176 cut-off events. For 487/487 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 619 event pairs, 11 based on Foata normal form. 9/185 useless extension candidates. Maximal degree in co-relation 706. Up to 81 conditions per place. [2022-12-05 23:10:38,086 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 33 selfloop transitions, 15 changer transitions 7/56 dead transitions. [2022-12-05 23:10:38,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 422 flow [2022-12-05 23:10:38,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 23:10:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 23:10:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-12-05 23:10:38,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2022-12-05 23:10:38,087 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 206 flow. Second operand 8 states and 64 transitions. [2022-12-05 23:10:38,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 422 flow [2022-12-05 23:10:38,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 381 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-05 23:10:38,089 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 221 flow [2022-12-05 23:10:38,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=221, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2022-12-05 23:10:38,090 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2022-12-05 23:10:38,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:10:38,090 INFO L89 Accepts]: Start accepts. Operand has 51 places, 33 transitions, 221 flow [2022-12-05 23:10:38,091 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:10:38,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:10:38,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 33 transitions, 221 flow [2022-12-05 23:10:38,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 33 transitions, 221 flow [2022-12-05 23:10:38,096 INFO L130 PetriNetUnfolder]: 14/62 cut-off events. [2022-12-05 23:10:38,097 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-05 23:10:38,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 62 events. 14/62 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 1 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 222. Up to 23 conditions per place. [2022-12-05 23:10:38,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 33 transitions, 221 flow [2022-12-05 23:10:38,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 Received shutdown request... [2022-12-05 23:25:10,152 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 23:25:10,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:25:10,153 WARN L619 AbstractCegarLoop]: Verification canceled: while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-2-3-2-2-1 context. [2022-12-05 23:25:10,157 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 23:25:10,158 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 23:25:10,159 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 23:25:10,159 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 23:25:10,160 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 23:25:10,160 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:25:10,163 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:25:10,164 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:25:10,164 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:25:10,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:25:10 BasicIcfg [2022-12-05 23:25:10,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:25:10,167 INFO L158 Benchmark]: Toolchain (without parser) took 881549.57ms. Allocated memory was 185.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 160.9MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-05 23:25:10,168 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory was 163.3MB in the beginning and 163.2MB in the end (delta: 77.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:25:10,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.03ms. Allocated memory is still 185.6MB. Free memory was 160.9MB in the beginning and 134.7MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 23:25:10,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.77ms. Allocated memory is still 185.6MB. Free memory was 134.7MB in the beginning and 132.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:25:10,169 INFO L158 Benchmark]: Boogie Preprocessor took 36.13ms. Allocated memory is still 185.6MB. Free memory was 132.1MB in the beginning and 130.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:25:10,169 INFO L158 Benchmark]: RCFGBuilder took 603.89ms. Allocated memory is still 185.6MB. Free memory was 130.0MB in the beginning and 93.8MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-05 23:25:10,170 INFO L158 Benchmark]: TraceAbstraction took 880485.34ms. Allocated memory was 185.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 93.3MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-05 23:25:10,171 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.10ms. Allocated memory is still 185.6MB. Free memory was 163.3MB in the beginning and 163.2MB in the end (delta: 77.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 378.03ms. Allocated memory is still 185.6MB. Free memory was 160.9MB in the beginning and 134.7MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.77ms. Allocated memory is still 185.6MB. Free memory was 134.7MB in the beginning and 132.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.13ms. Allocated memory is still 185.6MB. Free memory was 132.1MB in the beginning and 130.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 603.89ms. Allocated memory is still 185.6MB. Free memory was 130.0MB in the beginning and 93.8MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 880485.34ms. Allocated memory was 185.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 93.3MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 112 PlacesBefore, 36 PlacesAfterwards, 104 TransitionsBefore, 27 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1298, independent: 1244, independent conditional: 1244, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1298, independent: 1244, independent conditional: 0, independent unconditional: 1244, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1298, independent: 1244, independent conditional: 0, independent unconditional: 1244, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1298, independent: 1244, independent conditional: 0, independent unconditional: 1244, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1127, independent: 1088, independent conditional: 0, independent unconditional: 1088, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1127, independent: 1062, independent conditional: 0, independent unconditional: 1062, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 248, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1298, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1127, unknown conditional: 0, unknown unconditional: 1127] , Statistics on independence cache: Total cache size (in pairs): 1658, Positive cache size: 1619, Positive conditional cache size: 0, Positive unconditional cache size: 1619, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, 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, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 69, independent conditional: 69, 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: 91, independent: 69, independent conditional: 9, independent unconditional: 60, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 69, independent conditional: 9, independent unconditional: 60, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 69, independent conditional: 9, independent unconditional: 60, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 81, independent: 66, independent conditional: 8, independent unconditional: 58, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 81, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 63, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 50, dependent conditional: 14, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 81, unknown conditional: 10, unknown unconditional: 71] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 66, Positive conditional cache size: 8, Positive unconditional cache size: 58, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, 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, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 78, independent: 58, independent conditional: 7, independent unconditional: 51, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 78, Positive conditional cache size: 8, Positive unconditional cache size: 70, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 86, independent: 66, independent conditional: 16, independent unconditional: 50, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 86, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 86, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 1, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 11, unknown conditional: 1, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 86, Positive conditional cache size: 8, Positive unconditional cache size: 78, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, 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.1s, 36 PlacesBefore, 36 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, independent: 109, independent conditional: 109, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 151, independent: 109, independent conditional: 25, independent unconditional: 84, dependent: 42, dependent conditional: 4, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 42, dependent conditional: 4, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 42, dependent conditional: 4, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 151, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 36, dependent conditional: 4, dependent unconditional: 32, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 107, Positive conditional cache size: 8, Positive unconditional cache size: 99, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 35 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 82, independent: 53, independent conditional: 10, independent unconditional: 43, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 121, Positive conditional cache size: 8, Positive unconditional cache size: 113, Negative cache size: 32, Negative conditional cache size: 3, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 63, independent conditional: 21, independent unconditional: 42, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 63, independent conditional: 15, independent unconditional: 48, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 63, independent conditional: 15, independent unconditional: 48, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 5, independent unconditional: 5, 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: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 35, independent conditional: 33, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 53, independent conditional: 10, independent unconditional: 43, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 10, unknown conditional: 5, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 147, Positive conditional cache size: 15, Positive unconditional cache size: 132, Negative cache size: 32, Negative conditional cache size: 3, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 44, independent conditional: 28, independent unconditional: 16, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 44, independent conditional: 22, independent unconditional: 22, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 44, independent conditional: 22, independent unconditional: 22, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 56, independent: 41, independent conditional: 21, independent unconditional: 20, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 166, Positive conditional cache size: 16, Positive unconditional cache size: 150, Negative cache size: 32, Negative conditional cache size: 3, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 18, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 166, Positive conditional cache size: 16, Positive unconditional cache size: 150, Negative cache size: 32, Negative conditional cache size: 3, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, 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 ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 821]: 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 ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 819]: 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 ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 823]: 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 ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-2-3-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 880.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 581 IncrementalHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 9 mSDtfsCounter, 581 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=9, 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.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown