/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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:10:22,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:10:22,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:10:22,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:10:22,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:10:22,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:10:22,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:10:22,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:10:22,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:10:22,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:10:22,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:10:22,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:10:22,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:10:22,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:10:22,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:10:22,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:10:22,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:10:22,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:10:22,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:10:22,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:10:22,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:10:22,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:10:22,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:10:22,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:10:22,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:10:22,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:10:22,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:10:22,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:10:22,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:10:22,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:10:22,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:10:22,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:10:22,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:10:22,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:10:22,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:10:22,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:10:22,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:10:22,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:10:22,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:10:22,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:10:22,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:10:22,898 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-06 01:10:22,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:10:22,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:10:22,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:10:22,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:10:22,922 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:10:22,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:10:22,923 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:10:22,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:10:22,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:10:22,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:10:22,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:10:22,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:10:22,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:10:22,924 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:10:22,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:10:22,924 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:10:22,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:10:22,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:10:22,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:10:22,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:10:22,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:10:22,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:10:22,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:10:22,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:10:22,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:10:22,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:10:22,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:10:22,925 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:10:22,925 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 01:10:23,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:10:23,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:10:23,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:10:23,350 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:10:23,363 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:10:23,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 01:10:24,528 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:10:24,785 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:10:24,785 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 01:10:24,805 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea63cffa/5bf83753781d4c629787bcbf23fc9a95/FLAG5e2a05c6e [2022-12-06 01:10:24,818 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea63cffa/5bf83753781d4c629787bcbf23fc9a95 [2022-12-06 01:10:24,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:10:24,820 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:10:24,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:10:24,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:10:24,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:10:24,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:10:24" (1/1) ... [2022-12-06 01:10:24,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a98ac01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:10:24, skipping insertion in model container [2022-12-06 01:10:24,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:10:24" (1/1) ... [2022-12-06 01:10:24,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:10:24,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:10:25,007 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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2022-12-06 01:10:25,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:10:25,215 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:10:25,222 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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2022-12-06 01:10:25,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:10:25,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:10:25,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:10:25,312 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:10:25,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:10:25 WrapperNode [2022-12-06 01:10:25,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:10:25,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:10:25,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:10:25,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:10:25,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:10:25" (1/1) ... [2022-12-06 01:10:25,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:10:25" (1/1) ... [2022-12-06 01:10:25,362 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-06 01:10:25,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:10:25,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:10:25,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:10:25,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:10:25,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:10:25" (1/1) ... [2022-12-06 01:10:25,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:10:25" (1/1) ... [2022-12-06 01:10:25,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:10:25" (1/1) ... [2022-12-06 01:10:25,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:10:25" (1/1) ... [2022-12-06 01:10:25,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:10:25" (1/1) ... [2022-12-06 01:10:25,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:10:25" (1/1) ... [2022-12-06 01:10:25,380 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:10:25" (1/1) ... [2022-12-06 01:10:25,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:10:25" (1/1) ... [2022-12-06 01:10:25,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:10:25,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:10:25,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:10:25,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:10:25,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:10:25" (1/1) ... [2022-12-06 01:10:25,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:10:25,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:10:25,408 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-06 01:10:25,432 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-06 01:10:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:10:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:10:25,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:10:25,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:10:25,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:10:25,449 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:10:25,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:10:25,450 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:10:25,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:10:25,450 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:10:25,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:10:25,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:10:25,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:10:25,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:10:25,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:10:25,452 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:10:25,545 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:10:25,546 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:10:25,844 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:10:25,981 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:10:25,981 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:10:25,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:10:25 BoogieIcfgContainer [2022-12-06 01:10:25,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:10:25,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:10:25,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:10:25,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:10:25,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:10:24" (1/3) ... [2022-12-06 01:10:25,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d7998f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:10:25, skipping insertion in model container [2022-12-06 01:10:25,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:10:25" (2/3) ... [2022-12-06 01:10:25,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d7998f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:10:25, skipping insertion in model container [2022-12-06 01:10:25,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:10:25" (3/3) ... [2022-12-06 01:10:25,991 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 01:10:26,005 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:10:26,005 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 01:10:26,005 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:10:26,046 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:10:26,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 01:10:26,127 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 01:10:26,127 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:10:26,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 01:10:26,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-06 01:10:26,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-06 01:10:26,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:10:26,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 01:10:26,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-06 01:10:26,199 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-06 01:10:26,200 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:10:26,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 01:10:26,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-06 01:10:26,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 1800 [2022-12-06 01:10:29,953 INFO L203 LiptonReduction]: Total number of compositions: 83 [2022-12-06 01:10:29,969 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:10:29,975 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;@4a952287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:10:29,975 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 01:10:29,979 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-06 01:10:29,979 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:10:29,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:10:29,980 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 01:10:29,980 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-06 01:10:29,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:10:29,984 INFO L85 PathProgramCache]: Analyzing trace with hash 466739718, now seen corresponding path program 1 times [2022-12-06 01:10:29,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:10:29,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646932275] [2022-12-06 01:10:29,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:10:29,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:10:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:10:30,256 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-06 01:10:30,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:10:30,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646932275] [2022-12-06 01:10:30,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646932275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:10:30,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:10:30,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:10:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419580711] [2022-12-06 01:10:30,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:10:30,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:10:30,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:10:30,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:10:30,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:10:30,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 01:10:30,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-06 01:10:30,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:10:30,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 01:10:30,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:10:30,538 INFO L130 PetriNetUnfolder]: 1124/1781 cut-off events. [2022-12-06 01:10:30,538 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 01:10:30,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3509 conditions, 1781 events. 1124/1781 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8728 event pairs, 144 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 3498. Up to 1413 conditions per place. [2022-12-06 01:10:30,550 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 28 selfloop transitions, 2 changer transitions 6/37 dead transitions. [2022-12-06 01:10:30,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 158 flow [2022-12-06 01:10:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:10:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:10:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 01:10:30,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 01:10:30,560 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2022-12-06 01:10:30,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:10:30,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 37 transitions, 158 flow [2022-12-06 01:10:30,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 37 transitions, 158 flow [2022-12-06 01:10:30,579 INFO L188 LiptonReduction]: Number of co-enabled transitions 28 [2022-12-06 01:10:30,688 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:10:30,689 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-06 01:10:30,690 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 156 flow [2022-12-06 01:10:30,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-06 01:10:30,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:10:30,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:10:30,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:10:30,690 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-06 01:10:30,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:10:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1003430744, now seen corresponding path program 1 times [2022-12-06 01:10:30,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:10:30,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729292578] [2022-12-06 01:10:30,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:10:30,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:10:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:10:30,854 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-06 01:10:30,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:10:30,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729292578] [2022-12-06 01:10:30,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729292578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:10:30,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:10:30,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:10:30,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868310687] [2022-12-06 01:10:30,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:10:30,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:10:30,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:10:30,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:10:30,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:10:30,857 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 01:10:30,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 156 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-06 01:10:30,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:10:30,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 01:10:30,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:10:31,080 INFO L130 PetriNetUnfolder]: 1044/1561 cut-off events. [2022-12-06 01:10:31,081 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 01:10:31,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4739 conditions, 1561 events. 1044/1561 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6870 event pairs, 152 based on Foata normal form. 0/1413 useless extension candidates. Maximal degree in co-relation 4725. Up to 1341 conditions per place. [2022-12-06 01:10:31,087 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 37 selfloop transitions, 2 changer transitions 9/48 dead transitions. [2022-12-06 01:10:31,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 303 flow [2022-12-06 01:10:31,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:10:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:10:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 01:10:31,090 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-06 01:10:31,090 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2022-12-06 01:10:31,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:10:31,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 48 transitions, 303 flow [2022-12-06 01:10:31,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 48 transitions, 303 flow [2022-12-06 01:10:31,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:10:31,100 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:10:31,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 01:10:31,102 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 48 transitions, 303 flow [2022-12-06 01:10:31,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-06 01:10:31,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:10:31,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:10:31,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:10:31,102 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-06 01:10:31,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:10:31,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2070666969, now seen corresponding path program 1 times [2022-12-06 01:10:31,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:10:31,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786818452] [2022-12-06 01:10:31,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:10:31,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:10:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:10:31,276 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-06 01:10:31,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:10:31,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786818452] [2022-12-06 01:10:31,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786818452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:10:31,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:10:31,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:10:31,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330746825] [2022-12-06 01:10:31,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:10:31,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:10:31,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:10:31,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:10:31,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:10:31,282 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 01:10:31,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 48 transitions, 303 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 01:10:31,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:10:31,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 01:10:31,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:10:31,513 INFO L130 PetriNetUnfolder]: 1088/1653 cut-off events. [2022-12-06 01:10:31,513 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-06 01:10:31,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6669 conditions, 1653 events. 1088/1653 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7551 event pairs, 36 based on Foata normal form. 0/1517 useless extension candidates. Maximal degree in co-relation 6652. Up to 1416 conditions per place. [2022-12-06 01:10:31,520 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 62 selfloop transitions, 4 changer transitions 37/103 dead transitions. [2022-12-06 01:10:31,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 103 transitions, 851 flow [2022-12-06 01:10:31,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:10:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:10:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 01:10:31,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-06 01:10:31,523 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2022-12-06 01:10:31,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:10:31,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 103 transitions, 851 flow [2022-12-06 01:10:31,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 103 transitions, 851 flow [2022-12-06 01:10:31,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:10:31,533 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:10:31,534 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 01:10:31,534 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 103 transitions, 851 flow [2022-12-06 01:10:31,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 01:10:31,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:10:31,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:10:31,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:10:31,538 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-06 01:10:31,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:10:31,540 INFO L85 PathProgramCache]: Analyzing trace with hash 233490800, now seen corresponding path program 1 times [2022-12-06 01:10:31,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:10:31,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744138403] [2022-12-06 01:10:31,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:10:31,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:10:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:10:31,675 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-06 01:10:31,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:10:31,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744138403] [2022-12-06 01:10:31,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744138403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:10:31,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:10:31,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:10:31,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719874303] [2022-12-06 01:10:31,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:10:31,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:10:31,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:10:31,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:10:31,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:10:31,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 01:10:31,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 103 transitions, 851 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:31,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:10:31,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 01:10:31,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:10:31,967 INFO L130 PetriNetUnfolder]: 1553/2379 cut-off events. [2022-12-06 01:10:31,967 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-06 01:10:31,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11953 conditions, 2379 events. 1553/2379 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11269 event pairs, 18 based on Foata normal form. 0/2207 useless extension candidates. Maximal degree in co-relation 11933. Up to 2034 conditions per place. [2022-12-06 01:10:31,974 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 58 selfloop transitions, 7 changer transitions 133/198 dead transitions. [2022-12-06 01:10:31,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 198 transitions, 2007 flow [2022-12-06 01:10:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:10:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:10:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 01:10:31,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2022-12-06 01:10:31,977 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2022-12-06 01:10:31,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:10:31,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 198 transitions, 2007 flow [2022-12-06 01:10:31,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 198 transitions, 2007 flow [2022-12-06 01:10:31,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:10:31,989 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:10:31,995 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 01:10:31,996 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 198 transitions, 2007 flow [2022-12-06 01:10:31,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:31,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:10:31,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:10:31,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:10:31,997 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-06 01:10:31,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:10:31,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1341149184, now seen corresponding path program 1 times [2022-12-06 01:10:31,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:10:31,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777126069] [2022-12-06 01:10:31,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:10:31,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:10:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:10:32,154 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-06 01:10:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:10:32,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777126069] [2022-12-06 01:10:32,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777126069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:10:32,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:10:32,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:10:32,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566655275] [2022-12-06 01:10:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:10:32,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:10:32,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:10:32,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:10:32,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:10:32,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 01:10:32,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 198 transitions, 2007 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:32,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:10:32,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 01:10:32,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:10:32,376 INFO L130 PetriNetUnfolder]: 969/1579 cut-off events. [2022-12-06 01:10:32,376 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-06 01:10:32,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9533 conditions, 1579 events. 969/1579 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7341 event pairs, 16 based on Foata normal form. 0/1467 useless extension candidates. Maximal degree in co-relation 9510. Up to 1377 conditions per place. [2022-12-06 01:10:32,381 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 76 selfloop transitions, 13 changer transitions 178/267 dead transitions. [2022-12-06 01:10:32,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 267 transitions, 3246 flow [2022-12-06 01:10:32,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:10:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:10:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 01:10:32,383 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2022-12-06 01:10:32,383 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2022-12-06 01:10:32,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:10:32,384 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 267 transitions, 3246 flow [2022-12-06 01:10:32,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 267 transitions, 3246 flow [2022-12-06 01:10:32,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:10:32,394 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:10:32,395 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 01:10:32,395 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 267 transitions, 3246 flow [2022-12-06 01:10:32,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:32,395 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:10:32,395 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:10:32,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:10:32,395 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-06 01:10:32,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:10:32,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1056532293, now seen corresponding path program 1 times [2022-12-06 01:10:32,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:10:32,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600738046] [2022-12-06 01:10:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:10:32,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:10:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:10:32,515 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-06 01:10:32,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:10:32,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600738046] [2022-12-06 01:10:32,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600738046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:10:32,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:10:32,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:10:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801083611] [2022-12-06 01:10:32,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:10:32,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:10:32,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:10:32,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:10:32,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:10:32,516 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 01:10:32,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 267 transitions, 3246 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:32,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:10:32,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 01:10:32,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:10:32,681 INFO L130 PetriNetUnfolder]: 593/988 cut-off events. [2022-12-06 01:10:32,681 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-06 01:10:32,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6976 conditions, 988 events. 593/988 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4130 event pairs, 3 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 6950. Up to 849 conditions per place. [2022-12-06 01:10:32,685 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 70 selfloop transitions, 22 changer transitions 165/257 dead transitions. [2022-12-06 01:10:32,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 257 transitions, 3643 flow [2022-12-06 01:10:32,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:10:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:10:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 01:10:32,686 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2022-12-06 01:10:32,687 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2022-12-06 01:10:32,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:10:32,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 257 transitions, 3643 flow [2022-12-06 01:10:32,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 257 transitions, 3643 flow [2022-12-06 01:10:32,694 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:10:32,695 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:10:32,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 01:10:32,695 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 257 transitions, 3643 flow [2022-12-06 01:10:32,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:32,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:10:32,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:10:32,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:10:32,696 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-06 01:10:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:10:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash 733346334, now seen corresponding path program 1 times [2022-12-06 01:10:32,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:10:32,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884601346] [2022-12-06 01:10:32,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:10:32,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:10:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:10:32,863 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-06 01:10:32,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:10:32,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884601346] [2022-12-06 01:10:32,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884601346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:10:32,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:10:32,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:10:32,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080507725] [2022-12-06 01:10:32,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:10:32,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:10:32,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:10:32,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:10:32,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:10:32,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 01:10:32,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 257 transitions, 3643 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:32,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:10:32,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 01:10:32,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:10:33,017 INFO L130 PetriNetUnfolder]: 535/861 cut-off events. [2022-12-06 01:10:33,017 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-06 01:10:33,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6949 conditions, 861 events. 535/861 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3415 event pairs, 0 based on Foata normal form. 0/838 useless extension candidates. Maximal degree in co-relation 6920. Up to 747 conditions per place. [2022-12-06 01:10:33,021 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 61 selfloop transitions, 25 changer transitions 138/224 dead transitions. [2022-12-06 01:10:33,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 224 transitions, 3629 flow [2022-12-06 01:10:33,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:10:33,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:10:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 01:10:33,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2022-12-06 01:10:33,022 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2022-12-06 01:10:33,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:10:33,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 224 transitions, 3629 flow [2022-12-06 01:10:33,029 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 224 transitions, 3629 flow [2022-12-06 01:10:33,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:10:33,030 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:10:33,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 01:10:33,031 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 224 transitions, 3629 flow [2022-12-06 01:10:33,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:33,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:10:33,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:10:33,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:10:33,031 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-06 01:10:33,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:10:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2038174928, now seen corresponding path program 1 times [2022-12-06 01:10:33,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:10:33,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760956243] [2022-12-06 01:10:33,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:10:33,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:10:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:10:34,130 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-06 01:10:34,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:10:34,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760956243] [2022-12-06 01:10:34,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760956243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:10:34,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:10:34,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:10:34,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501791784] [2022-12-06 01:10:34,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:10:34,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:10:34,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:10:34,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:10:34,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:10:34,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 01:10:34,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 224 transitions, 3629 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:34,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:10:34,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 01:10:34,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:10:34,669 INFO L130 PetriNetUnfolder]: 919/1521 cut-off events. [2022-12-06 01:10:34,670 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 01:10:34,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13775 conditions, 1521 events. 919/1521 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7349 event pairs, 2 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 13743. Up to 1388 conditions per place. [2022-12-06 01:10:34,678 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 92 selfloop transitions, 39 changer transitions 345/476 dead transitions. [2022-12-06 01:10:34,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 476 transitions, 8646 flow [2022-12-06 01:10:34,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 01:10:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 01:10:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2022-12-06 01:10:34,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4595959595959596 [2022-12-06 01:10:34,682 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2022-12-06 01:10:34,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:10:34,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 476 transitions, 8646 flow [2022-12-06 01:10:34,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 476 transitions, 8646 flow [2022-12-06 01:10:34,694 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:10:34,696 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:10:34,697 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 01:10:34,697 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 476 transitions, 8646 flow [2022-12-06 01:10:34,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:34,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:10:34,697 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:10:34,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:10:34,698 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-06 01:10:34,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:10:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash 102516084, now seen corresponding path program 2 times [2022-12-06 01:10:34,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:10:34,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39534290] [2022-12-06 01:10:34,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:10:34,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:10:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:10:34,885 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-06 01:10:34,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:10:34,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39534290] [2022-12-06 01:10:34,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39534290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:10:34,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:10:34,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:10:34,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429018374] [2022-12-06 01:10:34,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:10:34,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:10:34,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:10:34,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:10:34,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:10:34,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 01:10:34,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 476 transitions, 8646 flow. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:34,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:10:34,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 01:10:34,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:10:35,185 INFO L130 PetriNetUnfolder]: 1092/1835 cut-off events. [2022-12-06 01:10:35,185 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 01:10:35,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18437 conditions, 1835 events. 1092/1835 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9462 event pairs, 0 based on Foata normal form. 0/1793 useless extension candidates. Maximal degree in co-relation 18402. Up to 1702 conditions per place. [2022-12-06 01:10:35,190 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 0 selfloop transitions, 0 changer transitions 595/595 dead transitions. [2022-12-06 01:10:35,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 595 transitions, 11978 flow [2022-12-06 01:10:35,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:10:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:10:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 01:10:35,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-06 01:10:35,192 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2022-12-06 01:10:35,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:10:35,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 595 transitions, 11978 flow [2022-12-06 01:10:35,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 595 transitions, 11978 flow [2022-12-06 01:10:35,208 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:10:35,209 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:10:35,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 01:10:35,210 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 595 transitions, 11978 flow [2022-12-06 01:10:35,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:35,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 01:10:35,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 01:10:35,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 01:10:35,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 01:10:35,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 01:10:35,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 01:10:35,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:10:35,216 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:10:35,219 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:10:35,219 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:10:35,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:10:35 BasicIcfg [2022-12-06 01:10:35,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:10:35,221 INFO L158 Benchmark]: Toolchain (without parser) took 10400.98ms. Allocated memory was 184.5MB in the beginning and 531.6MB in the end (delta: 347.1MB). Free memory was 158.2MB in the beginning and 241.9MB in the end (delta: -83.6MB). Peak memory consumption was 262.9MB. Max. memory is 8.0GB. [2022-12-06 01:10:35,222 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:10:35,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.28ms. Allocated memory is still 184.5MB. Free memory was 158.2MB in the beginning and 131.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 01:10:35,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.78ms. Allocated memory is still 184.5MB. Free memory was 131.0MB in the beginning and 128.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:10:35,222 INFO L158 Benchmark]: Boogie Preprocessor took 20.65ms. Allocated memory is still 184.5MB. Free memory was 128.3MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:10:35,222 INFO L158 Benchmark]: RCFGBuilder took 598.82ms. Allocated memory is still 184.5MB. Free memory was 126.3MB in the beginning and 88.0MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-06 01:10:35,222 INFO L158 Benchmark]: TraceAbstraction took 9236.37ms. Allocated memory was 184.5MB in the beginning and 531.6MB in the end (delta: 347.1MB). Free memory was 86.9MB in the beginning and 241.9MB in the end (delta: -154.9MB). Peak memory consumption was 191.6MB. Max. memory is 8.0GB. [2022-12-06 01:10:35,223 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 490.28ms. Allocated memory is still 184.5MB. Free memory was 158.2MB in the beginning and 131.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.78ms. Allocated memory is still 184.5MB. Free memory was 131.0MB in the beginning and 128.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.65ms. Allocated memory is still 184.5MB. Free memory was 128.3MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 598.82ms. Allocated memory is still 184.5MB. Free memory was 126.3MB in the beginning and 88.0MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 9236.37ms. Allocated memory was 184.5MB in the beginning and 531.6MB in the end (delta: 347.1MB). Free memory was 86.9MB in the beginning and 241.9MB in the end (delta: -154.9MB). Peak memory consumption was 191.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 113 PlacesBefore, 35 PlacesAfterwards, 105 TransitionsBefore, 26 TransitionsAfterwards, 1800 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1416, independent: 1364, independent conditional: 1364, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1416, independent: 1364, independent conditional: 0, independent unconditional: 1364, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1416, independent: 1364, independent conditional: 0, independent unconditional: 1364, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1416, independent: 1364, independent conditional: 0, independent unconditional: 1364, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1179, independent: 1142, independent conditional: 0, independent unconditional: 1142, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1179, independent: 1136, independent conditional: 0, independent unconditional: 1136, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 254, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1416, independent: 222, independent conditional: 0, independent unconditional: 222, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1179, unknown conditional: 0, unknown unconditional: 1179] , Statistics on independence cache: Total cache size (in pairs): 1816, Positive cache size: 1779, Positive conditional cache size: 0, Positive unconditional cache size: 1779, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, 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, 35 PlacesBefore, 34 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 36 PlacesBefore, 36 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 39 PlacesBefore, 39 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 42 PlacesBefore, 42 PlacesAfterwards, 198 TransitionsBefore, 198 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 44 PlacesBefore, 44 PlacesAfterwards, 267 TransitionsBefore, 267 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 47 PlacesBefore, 47 PlacesAfterwards, 257 TransitionsBefore, 257 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 51 PlacesBefore, 51 PlacesAfterwards, 224 TransitionsBefore, 224 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 59 PlacesBefore, 59 PlacesAfterwards, 476 TransitionsBefore, 476 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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.0s, 61 PlacesBefore, 61 PlacesAfterwards, 595 TransitionsBefore, 595 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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: 9.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 318 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 318 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 613 IncrementalHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 0 mSDtfsCounter, 613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11978occurred in iteration=9, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 601 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 01:10:35,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...