/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/weaver/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:13:06,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:13:06,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:13:06,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:13:06,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:13:06,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:13:06,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:13:06,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:13:06,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:13:06,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:13:06,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:13:06,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:13:06,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:13:06,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:13:06,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:13:06,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:13:06,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:13:06,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:13:06,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:13:06,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:13:06,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:13:06,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:13:06,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:13:06,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:13:06,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:13:06,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:13:06,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:13:06,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:13:06,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:13:06,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:13:06,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:13:06,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:13:06,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:13:06,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:13:06,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:13:06,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:13:06,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:13:06,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:13:06,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:13:06,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:13:06,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:13:06,809 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 02:13:06,833 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:13:06,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:13:06,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:13:06,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:13:06,835 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:13:06,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:13:06,836 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:13:06,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:13:06,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:13:06,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:13:06,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:13:06,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:13:06,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:13:06,837 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:13:06,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:13:06,837 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:13:06,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:13:06,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:13:06,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:13:06,838 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:13:06,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:13:06,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:13:06,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:13:06,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:13:06,838 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:13:06,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:13:06,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:13:06,838 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:13:06,839 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 02:13:07,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:13:07,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:13:07,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:13:07,168 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:13:07,168 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:13:07,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-12-06 02:13:08,278 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:13:08,471 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:13:08,475 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-12-06 02:13:08,485 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d1744b2/4cef242c1b6b4dc09f4ea37d87a5ad0f/FLAG82f118219 [2022-12-06 02:13:08,496 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d1744b2/4cef242c1b6b4dc09f4ea37d87a5ad0f [2022-12-06 02:13:08,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:13:08,499 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:13:08,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:13:08,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:13:08,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:13:08,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:13:08" (1/1) ... [2022-12-06 02:13:08,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f15567e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:13:08, skipping insertion in model container [2022-12-06 02:13:08,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:13:08" (1/1) ... [2022-12-06 02:13:08,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:13:08,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:13:08,650 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-12-06 02:13:08,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:13:08,671 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:13:08,702 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-12-06 02:13:08,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:13:08,718 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:13:08,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:13:08 WrapperNode [2022-12-06 02:13:08,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:13:08,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:13:08,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:13:08,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:13:08,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:13:08" (1/1) ... [2022-12-06 02:13:08,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:13:08" (1/1) ... [2022-12-06 02:13:08,772 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 277 [2022-12-06 02:13:08,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:13:08,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:13:08,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:13:08,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:13:08,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:13:08" (1/1) ... [2022-12-06 02:13:08,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:13:08" (1/1) ... [2022-12-06 02:13:08,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:13:08" (1/1) ... [2022-12-06 02:13:08,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:13:08" (1/1) ... [2022-12-06 02:13:08,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:13:08" (1/1) ... [2022-12-06 02:13:08,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:13:08" (1/1) ... [2022-12-06 02:13:08,809 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:13:08" (1/1) ... [2022-12-06 02:13:08,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:13:08" (1/1) ... [2022-12-06 02:13:08,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:13:08,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:13:08,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:13:08,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:13:08,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:13:08" (1/1) ... [2022-12-06 02:13:08,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:13:08,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:13:08,877 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 02:13:08,899 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 02:13:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:13:08,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:13:08,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:13:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:13:08,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:13:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:13:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:13:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:13:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:13:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:13:08,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:13:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:13:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:13:08,912 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 02:13:09,035 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:13:09,036 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:13:09,418 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:13:09,427 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:13:09,427 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 02:13:09,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:13:09 BoogieIcfgContainer [2022-12-06 02:13:09,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:13:09,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:13:09,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:13:09,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:13:09,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:13:08" (1/3) ... [2022-12-06 02:13:09,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293c123b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:13:09, skipping insertion in model container [2022-12-06 02:13:09,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:13:08" (2/3) ... [2022-12-06 02:13:09,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293c123b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:13:09, skipping insertion in model container [2022-12-06 02:13:09,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:13:09" (3/3) ... [2022-12-06 02:13:09,434 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-12-06 02:13:09,446 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:13:09,446 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:13:09,446 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:13:09,618 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 02:13:09,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 336 transitions, 688 flow [2022-12-06 02:13:09,774 INFO L130 PetriNetUnfolder]: 28/334 cut-off events. [2022-12-06 02:13:09,774 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:13:09,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 334 events. 28/334 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 760 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-12-06 02:13:09,786 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 336 transitions, 688 flow [2022-12-06 02:13:09,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 305 places, 326 transitions, 664 flow [2022-12-06 02:13:09,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:09,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 305 places, 326 transitions, 664 flow [2022-12-06 02:13:09,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 305 places, 326 transitions, 664 flow [2022-12-06 02:13:09,915 INFO L130 PetriNetUnfolder]: 28/326 cut-off events. [2022-12-06 02:13:09,916 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:13:09,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 326 events. 28/326 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 759 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-12-06 02:13:09,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 305 places, 326 transitions, 664 flow [2022-12-06 02:13:09,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 25652 [2022-12-06 02:13:20,076 INFO L203 LiptonReduction]: Total number of compositions: 310 [2022-12-06 02:13:20,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:13:20,091 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;@3305b5d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:13:20,091 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 02:13:20,094 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-06 02:13:20,095 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:13:20,095 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:20,095 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:20,095 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:13:20,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash -156050190, now seen corresponding path program 1 times [2022-12-06 02:13:20,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:20,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359745189] [2022-12-06 02:13:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:20,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:20,629 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 02:13:20,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:20,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359745189] [2022-12-06 02:13:20,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359745189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:13:20,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:13:20,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:13:20,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477752901] [2022-12-06 02:13:20,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:13:20,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:13:20,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:20,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:13:20,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:13:20,652 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 02:13:20,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 02:13:20,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:20,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 02:13:20,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:20,794 INFO L130 PetriNetUnfolder]: 99/168 cut-off events. [2022-12-06 02:13:20,794 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 02:13:20,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 168 events. 99/168 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 480 event pairs, 15 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 294. Up to 91 conditions per place. [2022-12-06 02:13:20,800 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 32 selfloop transitions, 10 changer transitions 1/43 dead transitions. [2022-12-06 02:13:20,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 43 transitions, 199 flow [2022-12-06 02:13:20,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:13:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:13:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 02:13:20,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 02:13:20,812 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 4 predicate places. [2022-12-06 02:13:20,813 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:20,813 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 43 transitions, 199 flow [2022-12-06 02:13:20,816 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 43 transitions, 199 flow [2022-12-06 02:13:20,816 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:20,816 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:13:20,818 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 02:13:20,818 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 43 transitions, 199 flow [2022-12-06 02:13:20,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 02:13:20,818 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:20,819 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:20,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:13:20,822 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:13:20,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:20,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1029066208, now seen corresponding path program 1 times [2022-12-06 02:13:20,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:20,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583657307] [2022-12-06 02:13:20,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:20,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:20,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:20,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583657307] [2022-12-06 02:13:20,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583657307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:13:20,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:13:20,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:13:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760463756] [2022-12-06 02:13:20,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:13:20,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:13:20,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:20,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:13:20,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:13:20,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 02:13:20,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 43 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 02:13:20,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:20,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 02:13:20,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:21,039 INFO L130 PetriNetUnfolder]: 109/196 cut-off events. [2022-12-06 02:13:21,041 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 02:13:21,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 196 events. 109/196 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 624 event pairs, 5 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 505. Up to 123 conditions per place. [2022-12-06 02:13:21,046 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 54 selfloop transitions, 16 changer transitions 8/78 dead transitions. [2022-12-06 02:13:21,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 78 transitions, 507 flow [2022-12-06 02:13:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:13:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:13:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 02:13:21,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 02:13:21,049 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 8 predicate places. [2022-12-06 02:13:21,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:21,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 78 transitions, 507 flow [2022-12-06 02:13:21,051 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 78 transitions, 507 flow [2022-12-06 02:13:21,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:21,053 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:13:21,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 02:13:21,054 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 78 transitions, 507 flow [2022-12-06 02:13:21,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 02:13:21,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:21,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:21,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:13:21,055 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:13:21,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1675031090, now seen corresponding path program 2 times [2022-12-06 02:13:21,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:21,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943206076] [2022-12-06 02:13:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:21,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:21,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:21,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943206076] [2022-12-06 02:13:21,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943206076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:13:21,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:13:21,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:13:21,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475636696] [2022-12-06 02:13:21,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:13:21,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:13:21,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:21,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:13:21,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:13:21,251 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 02:13:21,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 78 transitions, 507 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 02:13:21,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:21,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 02:13:21,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:21,338 INFO L130 PetriNetUnfolder]: 169/319 cut-off events. [2022-12-06 02:13:21,338 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-06 02:13:21,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 319 events. 169/319 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1264 event pairs, 8 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 668. Up to 187 conditions per place. [2022-12-06 02:13:21,341 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 106 selfloop transitions, 10 changer transitions 19/135 dead transitions. [2022-12-06 02:13:21,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 135 transitions, 1155 flow [2022-12-06 02:13:21,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:13:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:13:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-06 02:13:21,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4625 [2022-12-06 02:13:21,343 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 12 predicate places. [2022-12-06 02:13:21,344 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:21,344 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 135 transitions, 1155 flow [2022-12-06 02:13:21,346 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 135 transitions, 1155 flow [2022-12-06 02:13:21,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:23,474 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:13:23,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2133 [2022-12-06 02:13:23,476 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 134 transitions, 1147 flow [2022-12-06 02:13:23,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 02:13:23,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:23,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:23,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:13:23,476 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:13:23,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:23,476 INFO L85 PathProgramCache]: Analyzing trace with hash -378789959, now seen corresponding path program 1 times [2022-12-06 02:13:23,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:23,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857128223] [2022-12-06 02:13:23,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:23,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:13:23,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:23,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857128223] [2022-12-06 02:13:23,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857128223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:13:23,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:13:23,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:13:23,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557334075] [2022-12-06 02:13:23,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:13:23,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:13:23,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:23,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:13:23,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:13:23,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 02:13:23,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 134 transitions, 1147 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 02:13:23,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:23,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 02:13:23,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:23,722 INFO L130 PetriNetUnfolder]: 258/469 cut-off events. [2022-12-06 02:13:23,722 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-06 02:13:23,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423 conditions, 469 events. 258/469 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1984 event pairs, 5 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 831. Up to 287 conditions per place. [2022-12-06 02:13:23,725 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 174 selfloop transitions, 47 changer transitions 19/240 dead transitions. [2022-12-06 02:13:23,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 240 transitions, 2520 flow [2022-12-06 02:13:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:13:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:13:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 02:13:23,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5176470588235295 [2022-12-06 02:13:23,727 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 15 predicate places. [2022-12-06 02:13:23,729 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:23,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 240 transitions, 2520 flow [2022-12-06 02:13:23,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 240 transitions, 2520 flow [2022-12-06 02:13:23,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:23,753 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:13:23,757 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 02:13:23,757 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 240 transitions, 2520 flow [2022-12-06 02:13:23,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 02:13:23,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:23,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:23,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:13:23,758 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:13:23,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:23,759 INFO L85 PathProgramCache]: Analyzing trace with hash -479100590, now seen corresponding path program 1 times [2022-12-06 02:13:23,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:23,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583608146] [2022-12-06 02:13:23,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:23,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:23,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:23,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583608146] [2022-12-06 02:13:23,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583608146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:13:23,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:13:23,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:13:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104834049] [2022-12-06 02:13:23,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:13:23,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:13:23,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:23,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:13:23,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:13:23,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 02:13:23,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 240 transitions, 2520 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 02:13:23,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:23,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 02:13:23,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:23,960 INFO L130 PetriNetUnfolder]: 207/374 cut-off events. [2022-12-06 02:13:23,960 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-06 02:13:23,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2308 conditions, 374 events. 207/374 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1449 event pairs, 5 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 994. Up to 348 conditions per place. [2022-12-06 02:13:23,963 INFO L137 encePairwiseOnDemand]: 15/17 looper letters, 165 selfloop transitions, 0 changer transitions 26/191 dead transitions. [2022-12-06 02:13:23,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 191 transitions, 2388 flow [2022-12-06 02:13:23,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:13:23,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:13:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 02:13:23,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2022-12-06 02:13:23,965 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2022-12-06 02:13:23,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:23,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 191 transitions, 2388 flow [2022-12-06 02:13:23,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 191 transitions, 2388 flow [2022-12-06 02:13:23,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:23,969 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:13:23,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 02:13:23,971 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 191 transitions, 2388 flow [2022-12-06 02:13:23,971 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 02:13:23,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:23,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:23,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:13:23,972 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:13:23,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:23,972 INFO L85 PathProgramCache]: Analyzing trace with hash 93513105, now seen corresponding path program 1 times [2022-12-06 02:13:23,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:23,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887590561] [2022-12-06 02:13:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:23,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:24,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:24,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887590561] [2022-12-06 02:13:24,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887590561] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:13:24,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344191405] [2022-12-06 02:13:24,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:24,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:13:24,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:13:24,197 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:13:24,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 02:13:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:24,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 02:13:24,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:13:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:24,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:13:24,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 212 [2022-12-06 02:13:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:24,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344191405] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:13:24,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:13:24,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 02:13:24,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827833116] [2022-12-06 02:13:24,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:13:24,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:13:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:24,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:13:24,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:13:24,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 02:13:24,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 191 transitions, 2388 flow. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:13:24,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:24,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 02:13:24,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:25,305 INFO L130 PetriNetUnfolder]: 236/412 cut-off events. [2022-12-06 02:13:25,305 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-06 02:13:25,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2943 conditions, 412 events. 236/412 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1525 event pairs, 5 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 1414. Up to 386 conditions per place. [2022-12-06 02:13:25,308 INFO L137 encePairwiseOnDemand]: 7/17 looper letters, 136 selfloop transitions, 58 changer transitions 15/209 dead transitions. [2022-12-06 02:13:25,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 209 transitions, 3010 flow [2022-12-06 02:13:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 02:13:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 02:13:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 133 transitions. [2022-12-06 02:13:25,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2022-12-06 02:13:25,310 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 37 predicate places. [2022-12-06 02:13:25,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:25,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 209 transitions, 3010 flow [2022-12-06 02:13:25,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 209 transitions, 3010 flow [2022-12-06 02:13:25,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:25,315 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:13:25,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 02:13:25,315 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 209 transitions, 3010 flow [2022-12-06 02:13:25,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:13:25,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:25,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:25,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 02:13:25,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 02:13:25,521 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:13:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:25,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1283166092, now seen corresponding path program 1 times [2022-12-06 02:13:25,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:25,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155987622] [2022-12-06 02:13:25,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:25,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:13:25,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:25,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155987622] [2022-12-06 02:13:25,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155987622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:13:25,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:13:25,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:13:25,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185508769] [2022-12-06 02:13:25,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:13:25,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:13:25,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:25,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:13:25,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:13:25,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 02:13:25,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 209 transitions, 3010 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:13:25,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:25,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 02:13:25,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:25,730 INFO L130 PetriNetUnfolder]: 244/422 cut-off events. [2022-12-06 02:13:25,730 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-06 02:13:25,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3437 conditions, 422 events. 244/422 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1549 event pairs, 5 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 1614. Up to 396 conditions per place. [2022-12-06 02:13:25,733 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 184 selfloop transitions, 15 changer transitions 15/214 dead transitions. [2022-12-06 02:13:25,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 214 transitions, 3511 flow [2022-12-06 02:13:25,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:13:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:13:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 02:13:25,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 02:13:25,734 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 39 predicate places. [2022-12-06 02:13:25,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:25,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 214 transitions, 3511 flow [2022-12-06 02:13:25,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 214 transitions, 3511 flow [2022-12-06 02:13:25,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:25,739 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:13:25,739 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 02:13:25,739 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 214 transitions, 3511 flow [2022-12-06 02:13:25,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:13:25,740 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:25,740 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:25,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 02:13:25,740 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:13:25,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:25,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1123905128, now seen corresponding path program 1 times [2022-12-06 02:13:25,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:25,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762491074] [2022-12-06 02:13:25,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:25,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:26,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:26,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762491074] [2022-12-06 02:13:26,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762491074] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:13:26,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977445112] [2022-12-06 02:13:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:26,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:13:26,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:13:26,709 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:13:26,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 02:13:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:26,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 02:13:26,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:13:26,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 157 [2022-12-06 02:13:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:27,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:13:27,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:13:27,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 266 [2022-12-06 02:13:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:27,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977445112] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:13:27,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:13:27,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2022-12-06 02:13:27,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188023212] [2022-12-06 02:13:27,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:13:27,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:13:27,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:27,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:13:27,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:13:27,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 02:13:27,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 214 transitions, 3511 flow. Second operand has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 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 02:13:27,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:27,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 02:13:27,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:28,098 INFO L130 PetriNetUnfolder]: 301/524 cut-off events. [2022-12-06 02:13:28,098 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 02:13:28,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4796 conditions, 524 events. 301/524 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2116 event pairs, 2 based on Foata normal form. 1/426 useless extension candidates. Maximal degree in co-relation 2153. Up to 498 conditions per place. [2022-12-06 02:13:28,103 INFO L137 encePairwiseOnDemand]: 7/17 looper letters, 204 selfloop transitions, 53 changer transitions 20/277 dead transitions. [2022-12-06 02:13:28,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 277 transitions, 5112 flow [2022-12-06 02:13:28,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:13:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:13:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-12-06 02:13:28,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2022-12-06 02:13:28,106 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 48 predicate places. [2022-12-06 02:13:28,106 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:28,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 277 transitions, 5112 flow [2022-12-06 02:13:28,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 277 transitions, 5112 flow [2022-12-06 02:13:28,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:28,113 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:13:28,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 02:13:28,114 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 277 transitions, 5112 flow [2022-12-06 02:13:28,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 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 02:13:28,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:28,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:28,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 02:13:28,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-06 02:13:28,320 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:13:28,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:28,321 INFO L85 PathProgramCache]: Analyzing trace with hash 740056506, now seen corresponding path program 2 times [2022-12-06 02:13:28,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:28,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311825465] [2022-12-06 02:13:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:28,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:29,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:29,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311825465] [2022-12-06 02:13:29,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311825465] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:13:29,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250552275] [2022-12-06 02:13:29,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:13:29,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:13:29,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:13:29,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:13:29,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 02:13:29,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:13:29,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:13:29,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 02:13:29,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:13:29,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 157 [2022-12-06 02:13:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:29,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:13:30,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:13:30,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 266 [2022-12-06 02:13:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:30,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250552275] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:13:30,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:13:30,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 02:13:30,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784983419] [2022-12-06 02:13:30,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:13:30,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:13:30,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:30,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:13:30,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:13:30,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 02:13:30,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 277 transitions, 5112 flow. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 18 states have internal predecessors, (40), 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 02:13:30,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:30,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 02:13:30,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:32,140 INFO L130 PetriNetUnfolder]: 437/753 cut-off events. [2022-12-06 02:13:32,140 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 02:13:32,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7626 conditions, 753 events. 437/753 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3287 event pairs, 2 based on Foata normal form. 1/599 useless extension candidates. Maximal degree in co-relation 3192. Up to 719 conditions per place. [2022-12-06 02:13:32,147 INFO L137 encePairwiseOnDemand]: 6/17 looper letters, 210 selfloop transitions, 166 changer transitions 33/409 dead transitions. [2022-12-06 02:13:32,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 409 transitions, 8345 flow [2022-12-06 02:13:32,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-06 02:13:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-06 02:13:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 215 transitions. [2022-12-06 02:13:32,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32428355957767724 [2022-12-06 02:13:32,151 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 86 predicate places. [2022-12-06 02:13:32,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:32,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 409 transitions, 8345 flow [2022-12-06 02:13:32,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 409 transitions, 8345 flow [2022-12-06 02:13:32,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:32,161 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:13:32,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 02:13:32,162 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 409 transitions, 8345 flow [2022-12-06 02:13:32,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 18 states have internal predecessors, (40), 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 02:13:32,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:32,163 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:32,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 02:13:32,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:13:32,369 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:13:32,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1046836536, now seen corresponding path program 3 times [2022-12-06 02:13:32,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:32,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916403976] [2022-12-06 02:13:32,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:32,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:33,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:33,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916403976] [2022-12-06 02:13:33,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916403976] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:13:33,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26555839] [2022-12-06 02:13:33,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:13:33,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:13:33,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:13:33,168 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:13:33,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 02:13:33,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:13:33,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:13:33,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 02:13:33,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:13:33,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-06 02:13:33,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:13:33,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:13:33,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 157 [2022-12-06 02:13:33,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:33,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:13:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:34,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26555839] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:13:34,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:13:34,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-06 02:13:34,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027238805] [2022-12-06 02:13:34,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:13:34,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:13:34,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:13:34,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:13:34,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=337, Unknown=5, NotChecked=0, Total=420 [2022-12-06 02:13:34,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 02:13:34,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 409 transitions, 8345 flow. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 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 02:13:34,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:13:34,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 02:13:34,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:13:40,587 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 95 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:13:53,952 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| c_~A~0.base)) (.cse18 (+ c_~A~0.offset (* c_~j~0 4)))) (let ((.cse26 (select .cse10 .cse18)) (.cse13 (+ c_~bag1~0 c_~sum1~0))) (let ((.cse14 (<= (+ c_~i~0 1) c_~N~0)) (.cse3 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648)))) (.cse11 (+ c_~A~0.offset (* c_~i~0 4))) (.cse5 (not (<= .cse13 2147483647))) (.cse0 (not (<= (+ c_~bag2~0 .cse26) 2147483647))) (.cse1 (not (<= 0 (+ c_~bag2~0 .cse26 2147483648)))) (.cse2 (not (< c_~j~0 c_~N~0))) (.cse9 (+ c_~bag2~0 .cse26 c_~sum2~0 1)) (.cse7 (+ c_~bag2~0 .cse26 c_~sum2~0))) (and (or .cse0 .cse1 .cse2 (let ((.cse6 (select .cse10 .cse11))) (let ((.cse4 (let ((.cse8 (+ c_~bag1~0 c_~sum1~0 .cse6))) (and (<= .cse7 .cse8) (< .cse8 .cse9))))) (and (or .cse3 .cse4 .cse5) (or (not (<= (+ c_~bag1~0 .cse6) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse6 2147483648))) .cse4))))) (or (let ((.cse12 (+ c_~bag2~0 c_~sum2~0))) (and (<= .cse12 .cse13) (<= .cse13 .cse12))) (<= (+ c_~j~0 1) c_~N~0) .cse14) (or (and (<= .cse13 c_~sum2~0) (<= c_~sum2~0 .cse13)) .cse14) (or (and (forall ((v_ArrVal_210 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_210) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse11)) (.cse15 (select .cse17 .cse18))) (or (not (<= 0 (+ c_~bag2~0 .cse15 2147483648))) (not (<= (+ c_~bag1~0 .cse16) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse16 2147483648))) (<= (+ c_~bag2~0 .cse15 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse16)) (not (<= (+ c_~bag2~0 .cse15) 2147483647)))))) (forall ((v_ArrVal_210 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_210) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse11)) (.cse19 (select .cse21 .cse18))) (or (not (<= 0 (+ c_~bag2~0 .cse19 2147483648))) (not (<= (+ c_~bag1~0 .cse20) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse20 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 .cse20) (+ c_~bag2~0 .cse19 c_~sum2~0 1)) (not (<= (+ c_~bag2~0 .cse19) 2147483647)))))) (or .cse3 (and (forall ((v_ArrVal_210 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_210) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse18))) (or (not (<= 0 (+ c_~bag2~0 .cse22 2147483648))) (<= (+ c_~bag2~0 .cse22 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse23 .cse11))) (not (<= (+ c_~bag2~0 .cse22) 2147483647)))))) (forall ((v_ArrVal_210 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_210) c_~A~0.base))) (let ((.cse24 (select .cse25 .cse18))) (or (not (<= 0 (+ c_~bag2~0 .cse24 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse25 .cse11)) (+ c_~bag2~0 .cse24 c_~sum2~0 1)) (not (<= (+ c_~bag2~0 .cse24) 2147483647))))))) .cse5)) .cse2) (or .cse0 .cse1 .cse2 (and (< .cse13 .cse9) (<= .cse7 .cse13))))))) is different from false [2022-12-06 02:13:56,183 INFO L130 PetriNetUnfolder]: 616/1078 cut-off events. [2022-12-06 02:13:56,184 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-06 02:13:56,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11987 conditions, 1078 events. 616/1078 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5367 event pairs, 0 based on Foata normal form. 1/868 useless extension candidates. Maximal degree in co-relation 5725. Up to 1044 conditions per place. [2022-12-06 02:13:56,192 INFO L137 encePairwiseOnDemand]: 5/17 looper letters, 286 selfloop transitions, 275 changer transitions 41/602 dead transitions. [2022-12-06 02:13:56,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 602 transitions, 13472 flow [2022-12-06 02:13:56,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-12-06 02:13:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2022-12-06 02:13:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 292 transitions. [2022-12-06 02:13:56,195 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27703984819734345 [2022-12-06 02:13:56,196 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 147 predicate places. [2022-12-06 02:13:56,196 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:13:56,196 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 602 transitions, 13472 flow [2022-12-06 02:13:56,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 602 transitions, 13472 flow [2022-12-06 02:13:56,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:13:56,214 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1378] L46-1-->L121: Formula: (and (= (select (select |v_#memory_int_In_25| v_~A~0.base_In_13) (+ v_~A~0.offset_In_13 (* v_~i~0_In_10 4))) |v_thread1Thread1of1ForFork0_#t~mem1#1_Out_8|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_Out_28| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_14|) (= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_14|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_14| v_~bag1~0_In_12) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_14| |v_thread1Thread1of1ForFork0_#t~mem1#1_Out_8|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_44| (ite (or (<= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| 0) (<= (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_28|) 2147483647)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_42| (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_28| 2147483648)) (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32|)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_42| 0)) (< v_~i~0_In_10 v_~N~0_In_2)) InVars {~A~0.base=v_~A~0.base_In_13, ~A~0.offset=v_~A~0.offset_In_13, ~i~0=v_~i~0_In_10, ~bag1~0=v_~bag1~0_In_12, #memory_int=|v_#memory_int_In_25|, ~N~0=v_~N~0_In_2} OutVars{~A~0.base=v_~A~0.base_In_13, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_Out_28|, ~i~0=v_~i~0_In_10, ~bag1~0=v_~bag1~0_In_12, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_Out_32|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_14|, ~N~0=v_~N~0_In_2, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_44|, ~A~0.offset=v_~A~0.offset_In_13, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_42|, #memory_int=|v_#memory_int_In_25|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_14|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_Out_38|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1267] L97-3-->L98-3: Formula: (and (= |v_#pthreadsForks_32| |v_ULTIMATE.start_main_#t~pre29#1_31|) (= |v_#memory_int_85| (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre29#1_31|))) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_31|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #memory_int=|v_#memory_int_85|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 02:13:56,965 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:13:56,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 770 [2022-12-06 02:13:56,966 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 601 transitions, 13452 flow [2022-12-06 02:13:56,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 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 02:13:56,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:13:56,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:13:56,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 02:13:57,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:13:57,171 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:13:57,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:13:57,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1050999058, now seen corresponding path program 4 times [2022-12-06 02:13:57,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:13:57,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784176185] [2022-12-06 02:13:57,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:13:57,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:13:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:13:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:58,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:13:58,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784176185] [2022-12-06 02:13:58,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784176185] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:13:58,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633268028] [2022-12-06 02:13:58,815 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:13:58,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:13:58,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:13:58,817 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:13:58,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 02:13:58,896 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:13:58,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:13:58,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 02:13:58,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:13:59,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 153 [2022-12-06 02:13:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:13:59,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:13:59,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:13:59,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 382 treesize of output 298 [2022-12-06 02:14:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:00,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633268028] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:14:00,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:14:00,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 19 [2022-12-06 02:14:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369500571] [2022-12-06 02:14:00,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:14:00,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:14:00,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:14:00,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:14:00,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-12-06 02:14:00,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 02:14:00,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 601 transitions, 13452 flow. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 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 02:14:00,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:14:00,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 02:14:00,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:14:02,965 INFO L130 PetriNetUnfolder]: 626/1116 cut-off events. [2022-12-06 02:14:02,965 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-12-06 02:14:02,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13532 conditions, 1116 events. 626/1116 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5761 event pairs, 0 based on Foata normal form. 1/898 useless extension candidates. Maximal degree in co-relation 6194. Up to 1082 conditions per place. [2022-12-06 02:14:02,982 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 340 selfloop transitions, 246 changer transitions 57/643 dead transitions. [2022-12-06 02:14:02,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 643 transitions, 15692 flow [2022-12-06 02:14:02,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 02:14:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 02:14:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 183 transitions. [2022-12-06 02:14:02,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31069609507640067 [2022-12-06 02:14:02,986 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 176 predicate places. [2022-12-06 02:14:02,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:14:02,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 643 transitions, 15692 flow [2022-12-06 02:14:03,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 196 places, 643 transitions, 15692 flow [2022-12-06 02:14:03,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:14:03,012 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:14:03,021 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 02:14:03,023 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 643 transitions, 15692 flow [2022-12-06 02:14:03,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 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 02:14:03,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:14:03,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:14:03,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 02:14:03,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 02:14:03,233 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:14:03,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:14:03,233 INFO L85 PathProgramCache]: Analyzing trace with hash 191529882, now seen corresponding path program 5 times [2022-12-06 02:14:03,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:14:03,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501834239] [2022-12-06 02:14:03,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:14:03,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:14:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:14:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:04,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:14:04,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501834239] [2022-12-06 02:14:04,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501834239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:14:04,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837809853] [2022-12-06 02:14:04,425 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:14:04,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:14:04,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:14:04,426 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:14:04,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 02:14:04,538 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 02:14:04,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:14:04,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-06 02:14:04,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:14:04,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-06 02:14:04,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:14:04,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:14:04,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 145 [2022-12-06 02:14:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:04,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:14:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:05,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837809853] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:14:05,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:14:05,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2022-12-06 02:14:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822102312] [2022-12-06 02:14:05,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:14:05,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 02:14:05,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:14:05,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 02:14:05,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=406, Unknown=2, NotChecked=0, Total=506 [2022-12-06 02:14:05,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 02:14:05,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 643 transitions, 15692 flow. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 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 02:14:05,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:14:05,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 02:14:05,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:14:06,001 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~bag2~0 c_~sum2~0)) (.cse24 (< c_~j~0 c_~N~0)) (.cse1 (+ c_~bag1~0 c_~sum1~0))) (let ((.cse12 (+ c_~A~0.offset (* c_~i~0 4))) (.cse13 (+ c_~A~0.offset (* c_~j~0 4))) (.cse6 (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648)))) (.cse8 (not (<= .cse1 2147483647))) (.cse4 (not .cse24)) (.cse5 (< (+ c_~j~0 1) c_~N~0)) (.cse0 (<= .cse2 .cse1))) (and (= c_~sum1~0 0) (or (and .cse0 (<= .cse1 .cse2)) (<= (+ c_~i~0 1) c_~N~0)) (<= 0 (+ c_~bag1~0 2147483648)) (<= c_~sum2~0 2147483647) (let ((.cse11 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse11 .cse13))) (or (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) .cse4 .cse5 (let ((.cse9 (select .cse11 .cse12))) (let ((.cse7 (let ((.cse10 (+ c_~bag1~0 c_~sum1~0 .cse9))) (and (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse10) (< .cse10 (+ c_~bag2~0 .cse3 c_~sum2~0 1)))))) (and (or .cse6 .cse7 .cse8) (or (not (<= (+ c_~bag1~0 .cse9) 2147483647)) (not (<= 0 (+ c_~bag1~0 .cse9 2147483648))) .cse7))))))) (= c_~sum1~0 c_~sum2~0) (<= c_~bag1~0 2147483647) (<= 0 (+ c_~sum2~0 2147483648)) (or (and (forall ((v_ArrVal_274 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_274) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse12)) (.cse14 (select .cse16 .cse13))) (or (not (<= 0 (+ c_~bag2~0 .cse14 2147483648))) (not (<= 0 (+ c_~bag1~0 .cse15 2147483648))) (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (not (<= (+ c_~bag1~0 .cse15) 2147483647)) (< (+ c_~bag1~0 c_~sum1~0 .cse15) (+ c_~bag2~0 .cse14 c_~sum2~0 1)))))) (forall ((v_ArrVal_274 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_274) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse13)) (.cse18 (select .cse19 .cse12))) (or (not (<= 0 (+ c_~bag2~0 .cse17 2147483648))) (<= (+ c_~bag2~0 .cse17 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 .cse18)) (not (<= 0 (+ c_~bag1~0 .cse18 2147483648))) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= (+ c_~bag1~0 .cse18) 2147483647)))))) (or (and (forall ((v_ArrVal_274 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_274) c_~A~0.base))) (let ((.cse20 (select .cse21 .cse13))) (or (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (< (+ c_~bag1~0 c_~sum1~0 (select .cse21 .cse12)) (+ c_~bag2~0 .cse20 c_~sum2~0 1)))))) (forall ((v_ArrVal_274 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_274) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse13))) (or (not (<= 0 (+ c_~bag2~0 .cse22 2147483648))) (<= (+ c_~bag2~0 .cse22 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse23 .cse12))) (not (<= (+ c_~bag2~0 .cse22) 2147483647))))))) .cse6 .cse8)) (not (< c_~i~0 c_~N~0)) .cse4 .cse5) (= c_~bag1~0 c_~sum2~0) (or .cse24 (and (< .cse1 (+ c_~bag2~0 c_~sum2~0 1)) .cse0))))) is different from false [2022-12-06 02:14:09,795 INFO L130 PetriNetUnfolder]: 702/1245 cut-off events. [2022-12-06 02:14:09,795 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2022-12-06 02:14:09,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16341 conditions, 1245 events. 702/1245 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6533 event pairs, 2 based on Foata normal form. 1/1003 useless extension candidates. Maximal degree in co-relation 7989. Up to 1211 conditions per place. [2022-12-06 02:14:09,804 INFO L137 encePairwiseOnDemand]: 5/19 looper letters, 341 selfloop transitions, 317 changer transitions 62/720 dead transitions. [2022-12-06 02:14:09,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 720 transitions, 19010 flow [2022-12-06 02:14:09,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-06 02:14:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-06 02:14:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 220 transitions. [2022-12-06 02:14:09,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2692778457772338 [2022-12-06 02:14:09,806 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 216 predicate places. [2022-12-06 02:14:09,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:14:09,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 720 transitions, 19010 flow [2022-12-06 02:14:09,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 720 transitions, 19010 flow [2022-12-06 02:14:09,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:14:09,819 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:14:09,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 02:14:09,820 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 720 transitions, 19010 flow [2022-12-06 02:14:09,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 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 02:14:09,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:14:09,820 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:14:09,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 02:14:10,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:14:10,034 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:14:10,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:14:10,035 INFO L85 PathProgramCache]: Analyzing trace with hash -115250148, now seen corresponding path program 6 times [2022-12-06 02:14:10,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:14:10,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449360943] [2022-12-06 02:14:10,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:14:10,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:14:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:14:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:10,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:14:10,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449360943] [2022-12-06 02:14:10,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449360943] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:14:10,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651466918] [2022-12-06 02:14:10,824 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:14:10,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:14:10,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:14:10,840 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:14:10,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 02:14:10,968 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:14:10,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:14:10,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 02:14:10,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:14:11,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 153 [2022-12-06 02:14:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:11,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:14:11,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:14:11,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 372 treesize of output 288 [2022-12-06 02:14:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:11,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651466918] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:14:11,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:14:11,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 02:14:11,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027618031] [2022-12-06 02:14:11,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:14:11,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:14:11,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:14:11,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:14:11,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:14:11,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 02:14:11,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 720 transitions, 19010 flow. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 18 states have internal predecessors, (40), 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 02:14:11,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:14:11,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 02:14:11,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:14:13,720 INFO L130 PetriNetUnfolder]: 780/1407 cut-off events. [2022-12-06 02:14:13,720 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2022-12-06 02:14:13,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19871 conditions, 1407 events. 780/1407 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7707 event pairs, 0 based on Foata normal form. 1/1129 useless extension candidates. Maximal degree in co-relation 10238. Up to 1373 conditions per place. [2022-12-06 02:14:13,728 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 458 selfloop transitions, 278 changer transitions 82/818 dead transitions. [2022-12-06 02:14:13,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 818 transitions, 23242 flow [2022-12-06 02:14:13,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 02:14:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 02:14:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 192 transitions. [2022-12-06 02:14:13,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3062200956937799 [2022-12-06 02:14:13,730 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 248 predicate places. [2022-12-06 02:14:13,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:14:13,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 268 places, 818 transitions, 23242 flow [2022-12-06 02:14:13,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 268 places, 818 transitions, 23242 flow [2022-12-06 02:14:13,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:14:13,747 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:14:13,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 02:14:13,748 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 818 transitions, 23242 flow [2022-12-06 02:14:13,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 18 states have internal predecessors, (40), 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 02:14:13,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:14:13,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:14:13,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 02:14:13,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:14:13,950 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:14:13,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:14:13,959 INFO L85 PathProgramCache]: Analyzing trace with hash -892692180, now seen corresponding path program 7 times [2022-12-06 02:14:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:14:13,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433151154] [2022-12-06 02:14:13,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:14:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:14:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:14:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:14,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:14:14,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433151154] [2022-12-06 02:14:14,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433151154] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:14:14,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444339907] [2022-12-06 02:14:14,801 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:14:14,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:14:14,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:14:14,802 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:14:14,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 02:14:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:14:14,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 02:14:14,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:14:14,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 02:14:14,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:14:15,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:14:15,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-06 02:14:15,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 157 [2022-12-06 02:14:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:15,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:14:15,798 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_337))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse0 2147483648))) (not (<= .cse0 2147483647)) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse0))))) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_337))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse2 2147483648))) (<= .cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (<= .cse2 2147483647)))))) (forall ((v_ArrVal_337 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_337))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse4 2147483648))) (not (<= .cse4 2147483647)) (forall ((v_ArrVal_338 (Array Int Int))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= .cse5 .cse4) (not (<= .cse5 2147483647))))))))) (forall ((v_ArrVal_337 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_337))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse7 2147483648))) (not (<= .cse7 2147483647)) (forall ((v_ArrVal_338 (Array Int Int))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse8 2147483648))) (<= .cse7 .cse8))))))))) is different from false [2022-12-06 02:14:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:15,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444339907] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:14:15,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:14:15,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-12-06 02:14:15,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33850251] [2022-12-06 02:14:15,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:14:15,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:14:15,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:14:15,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:14:15,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=334, Unknown=13, NotChecked=38, Total=462 [2022-12-06 02:14:15,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 02:14:15,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 818 transitions, 23242 flow. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 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 02:14:15,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:14:15,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 02:14:15,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:14:17,037 INFO L130 PetriNetUnfolder]: 795/1445 cut-off events. [2022-12-06 02:14:17,038 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-12-06 02:14:17,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21859 conditions, 1445 events. 795/1445 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8026 event pairs, 2 based on Foata normal form. 1/1163 useless extension candidates. Maximal degree in co-relation 11056. Up to 1411 conditions per place. [2022-12-06 02:14:17,047 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 662 selfloop transitions, 92 changer transitions 87/841 dead transitions. [2022-12-06 02:14:17,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 841 transitions, 25592 flow [2022-12-06 02:14:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 02:14:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 02:14:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 108 transitions. [2022-12-06 02:14:17,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35526315789473684 [2022-12-06 02:14:17,068 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 263 predicate places. [2022-12-06 02:14:17,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:14:17,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 283 places, 841 transitions, 25592 flow [2022-12-06 02:14:17,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 283 places, 841 transitions, 25592 flow [2022-12-06 02:14:17,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:14:17,089 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:14:17,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 02:14:17,090 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 841 transitions, 25592 flow [2022-12-06 02:14:17,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 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 02:14:17,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:14:17,090 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:14:17,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 02:14:17,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 02:14:17,296 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:14:17,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:14:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash 384275740, now seen corresponding path program 8 times [2022-12-06 02:14:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:14:17,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821548946] [2022-12-06 02:14:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:14:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:14:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:14:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:18,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:14:18,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821548946] [2022-12-06 02:14:18,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821548946] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:14:18,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341583502] [2022-12-06 02:14:18,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:14:18,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:14:18,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:14:18,601 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:14:18,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 02:14:18,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:14:18,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:14:18,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 02:14:18,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:14:18,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-06 02:14:18,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:14:18,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:14:18,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:14:19,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 157 [2022-12-06 02:14:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:19,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:14:20,014 WARN L837 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< 0 c_~N~0)) (and (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_371))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse1) (not (<= 0 (+ .cse1 2147483648))) (not (<= .cse1 2147483647)))))) (forall ((v_ArrVal_371 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_371))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse2 2147483647)) (forall ((v_ArrVal_372 (Array Int Int))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= .cse2 .cse3) (not (<= 0 (+ .cse3 2147483648)))))) (not (<= 0 (+ .cse2 2147483648))))))) (forall ((v_ArrVal_371 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_371))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse5 2147483647)) (forall ((v_ArrVal_372 (Array Int Int))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse6 (+ .cse5 1)) (not (<= .cse6 2147483647))))) (not (<= 0 (+ .cse5 2147483648))))))) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_371))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse8 (+ (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (<= 0 (+ .cse8 2147483648))) (not (<= .cse8 2147483647)))))))) is different from false [2022-12-06 02:14:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:20,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341583502] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:14:20,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:14:20,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-12-06 02:14:20,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914330193] [2022-12-06 02:14:20,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:14:20,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 02:14:20,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:14:20,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 02:14:20,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=379, Unknown=7, NotChecked=40, Total=506 [2022-12-06 02:14:20,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 02:14:20,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 841 transitions, 25592 flow. Second operand has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:14:20,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:14:20,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 02:14:20,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:14:28,190 INFO L130 PetriNetUnfolder]: 889/1617 cut-off events. [2022-12-06 02:14:28,191 INFO L131 PetriNetUnfolder]: For 169/169 co-relation queries the response was YES. [2022-12-06 02:14:28,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26073 conditions, 1617 events. 889/1617 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9190 event pairs, 2 based on Foata normal form. 3/1287 useless extension candidates. Maximal degree in co-relation 13870. Up to 1583 conditions per place. [2022-12-06 02:14:28,207 INFO L137 encePairwiseOnDemand]: 8/19 looper letters, 491 selfloop transitions, 340 changer transitions 114/945 dead transitions. [2022-12-06 02:14:28,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 945 transitions, 30650 flow [2022-12-06 02:14:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-06 02:14:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-12-06 02:14:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 238 transitions. [2022-12-06 02:14:28,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2783625730994152 [2022-12-06 02:14:28,223 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 307 predicate places. [2022-12-06 02:14:28,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:14:28,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 327 places, 945 transitions, 30650 flow [2022-12-06 02:14:28,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 327 places, 945 transitions, 30650 flow [2022-12-06 02:14:28,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:14:28,292 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:14:28,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-06 02:14:28,293 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 945 transitions, 30650 flow [2022-12-06 02:14:28,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:14:28,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:14:28,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:14:28,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 02:14:28,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 02:14:28,501 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:14:28,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:14:28,501 INFO L85 PathProgramCache]: Analyzing trace with hash 691055770, now seen corresponding path program 9 times [2022-12-06 02:14:28,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:14:28,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047678249] [2022-12-06 02:14:28,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:14:28,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:14:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:14:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:29,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:14:29,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047678249] [2022-12-06 02:14:29,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047678249] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:14:29,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570318159] [2022-12-06 02:14:29,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:14:29,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:14:29,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:14:29,514 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:14:29,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 02:14:29,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:14:29,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:14:29,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 02:14:29,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:14:29,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-06 02:14:29,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 02:14:29,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:14:29,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 02:14:30,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 157 [2022-12-06 02:14:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:30,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:14:30,892 WARN L837 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_405 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_405))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_406 (Array Int Int))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse0 2147483647)) (<= .cse0 .cse1)))) (not (<= 0 (+ .cse1 2147483648))) (not (<= .cse1 2147483647)))))) (forall ((v_ArrVal_405 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_405))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse3 2147483648))) (not (<= .cse3 2147483647)) (forall ((v_ArrVal_406 (Array Int Int))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse3 (+ .cse4 1)) (not (<= 0 (+ .cse4 2147483648)))))))))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_405))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse6 2147483647)) (not (<= 0 (+ .cse6 2147483648))) (<= .cse6 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_405))) (let ((.cse9 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_406) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse9 1)) (not (<= .cse9 2147483647)) (not (<= 0 (+ .cse9 2147483648)))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< 0 c_~N~0))) is different from false [2022-12-06 02:14:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:14:30,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570318159] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:14:30,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:14:30,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-12-06 02:14:30,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170676636] [2022-12-06 02:14:30,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:14:30,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 02:14:30,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:14:30,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 02:14:30,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=381, Unknown=8, NotChecked=40, Total=506 [2022-12-06 02:14:30,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 02:14:30,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 945 transitions, 30650 flow. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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 02:14:30,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:14:30,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 02:14:30,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:14:45,482 WARN L233 SmtUtils]: Spent 11.03s on a formula simplification. DAG size of input: 110 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:14:56,188 INFO L130 PetriNetUnfolder]: 915/1684 cut-off events. [2022-12-06 02:14:56,188 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2022-12-06 02:14:56,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28836 conditions, 1684 events. 915/1684 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9793 event pairs, 2 based on Foata normal form. 2/1343 useless extension candidates. Maximal degree in co-relation 15720. Up to 1650 conditions per place. [2022-12-06 02:14:56,226 INFO L137 encePairwiseOnDemand]: 8/19 looper letters, 509 selfloop transitions, 353 changer transitions 129/991 dead transitions. [2022-12-06 02:14:56,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 991 transitions, 34122 flow [2022-12-06 02:14:56,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-06 02:14:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-12-06 02:14:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 251 transitions. [2022-12-06 02:14:56,230 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2540485829959514 [2022-12-06 02:14:56,231 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 358 predicate places. [2022-12-06 02:14:56,232 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:14:56,232 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 378 places, 991 transitions, 34122 flow [2022-12-06 02:14:56,267 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 378 places, 991 transitions, 34122 flow [2022-12-06 02:14:56,267 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:14:56,269 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:14:56,270 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 02:14:56,270 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 991 transitions, 34122 flow [2022-12-06 02:14:56,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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 02:14:56,270 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:14:56,270 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:14:56,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 02:14:56,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 02:14:56,490 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:14:56,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:14:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash -325601185, now seen corresponding path program 1 times [2022-12-06 02:14:56,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:14:56,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509586642] [2022-12-06 02:14:56,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:14:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:14:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:14:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:14:56,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:14:56,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509586642] [2022-12-06 02:14:56,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509586642] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:14:56,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799059361] [2022-12-06 02:14:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:14:56,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:14:56,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:14:56,772 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:14:56,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 02:14:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:14:56,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 02:14:56,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:14:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:14:56,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:14:57,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 223 [2022-12-06 02:14:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:14:57,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799059361] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:14:57,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:14:57,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 02:14:57,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432928080] [2022-12-06 02:14:57,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:14:57,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 02:14:57,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:14:57,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 02:14:57,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:14:57,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 02:14:57,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 991 transitions, 34122 flow. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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 02:14:57,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:14:57,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 02:14:57,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:14:57,777 INFO L130 PetriNetUnfolder]: 926/1694 cut-off events. [2022-12-06 02:14:57,777 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-12-06 02:14:57,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30688 conditions, 1694 events. 926/1694 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9745 event pairs, 0 based on Foata normal form. 0/1350 useless extension candidates. Maximal degree in co-relation 16642. Up to 1660 conditions per place. [2022-12-06 02:14:57,789 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 677 selfloop transitions, 194 changer transitions 129/1000 dead transitions. [2022-12-06 02:14:57,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1000 transitions, 36398 flow [2022-12-06 02:14:57,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:14:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:14:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-12-06 02:14:57,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39766081871345027 [2022-12-06 02:14:57,794 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 362 predicate places. [2022-12-06 02:14:57,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:14:57,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 382 places, 1000 transitions, 36398 flow [2022-12-06 02:14:57,819 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 382 places, 1000 transitions, 36398 flow [2022-12-06 02:14:57,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:14:57,821 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:14:57,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 02:14:57,822 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 1000 transitions, 36398 flow [2022-12-06 02:14:57,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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 02:14:57,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:14:57,822 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:14:57,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 02:14:58,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 02:14:58,028 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:14:58,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:14:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2073818594, now seen corresponding path program 10 times [2022-12-06 02:14:58,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:14:58,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978197623] [2022-12-06 02:14:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:14:58,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:14:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:14:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:14:58,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:14:58,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978197623] [2022-12-06 02:14:58,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978197623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:14:58,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:14:58,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:14:58,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271952571] [2022-12-06 02:14:58,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:14:58,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:14:58,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:14:58,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:14:58,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:14:58,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 02:14:58,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 1000 transitions, 36398 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:14:58,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:14:58,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 02:14:58,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:14:58,698 INFO L130 PetriNetUnfolder]: 599/1174 cut-off events. [2022-12-06 02:14:58,699 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-06 02:14:58,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22474 conditions, 1174 events. 599/1174 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6714 event pairs, 0 based on Foata normal form. 0/1028 useless extension candidates. Maximal degree in co-relation 9641. Up to 1140 conditions per place. [2022-12-06 02:14:58,706 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 533 selfloop transitions, 49 changer transitions 128/710 dead transitions. [2022-12-06 02:14:58,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 710 transitions, 27291 flow [2022-12-06 02:14:58,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:14:58,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:14:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-06 02:14:58,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2022-12-06 02:14:58,708 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 334 predicate places. [2022-12-06 02:14:58,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:14:58,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 354 places, 710 transitions, 27291 flow [2022-12-06 02:14:58,727 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 354 places, 710 transitions, 27291 flow [2022-12-06 02:14:58,727 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:15:01,290 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:15:01,291 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2583 [2022-12-06 02:15:01,291 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 709 transitions, 27253 flow [2022-12-06 02:15:01,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:15:01,291 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:15:01,291 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:15:01,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 02:15:01,291 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:15:01,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:15:01,291 INFO L85 PathProgramCache]: Analyzing trace with hash -772261219, now seen corresponding path program 1 times [2022-12-06 02:15:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:15:01,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548625562] [2022-12-06 02:15:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:15:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:15:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:15:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:15:01,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:15:01,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548625562] [2022-12-06 02:15:01,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548625562] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:15:01,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687242133] [2022-12-06 02:15:01,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:15:01,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:15:01,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:15:01,413 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:15:01,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 02:15:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:15:01,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 02:15:01,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:15:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:15:01,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:15:01,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 223 [2022-12-06 02:15:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:15:01,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687242133] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 02:15:01,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 02:15:01,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 7 [2022-12-06 02:15:01,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243380584] [2022-12-06 02:15:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:15:01,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:15:01,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:15:01,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:15:01,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-06 02:15:01,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:15:01,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 709 transitions, 27253 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:15:01,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:15:01,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:15:01,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:15:02,150 INFO L130 PetriNetUnfolder]: 377/748 cut-off events. [2022-12-06 02:15:02,150 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-06 02:15:02,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15080 conditions, 748 events. 377/748 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3819 event pairs, 0 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 9487. Up to 714 conditions per place. [2022-12-06 02:15:02,154 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 306 selfloop transitions, 7 changer transitions 150/463 dead transitions. [2022-12-06 02:15:02,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 463 transitions, 18729 flow [2022-12-06 02:15:02,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:15:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:15:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 02:15:02,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 02:15:02,156 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 271 predicate places. [2022-12-06 02:15:02,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:15:02,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 463 transitions, 18729 flow [2022-12-06 02:15:02,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 463 transitions, 18729 flow [2022-12-06 02:15:02,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:15:02,199 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:15:02,201 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 02:15:02,201 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 463 transitions, 18729 flow [2022-12-06 02:15:02,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:15:02,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:15:02,202 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:15:02,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 02:15:02,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:15:02,406 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:15:02,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:15:02,407 INFO L85 PathProgramCache]: Analyzing trace with hash 405998545, now seen corresponding path program 1 times [2022-12-06 02:15:02,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:15:02,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402777703] [2022-12-06 02:15:02,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:15:02,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:15:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:16:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:16:01,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:16:01,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402777703] [2022-12-06 02:16:01,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402777703] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:16:01,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973004502] [2022-12-06 02:16:01,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:16:01,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:16:01,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:16:01,605 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:16:01,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 02:16:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:16:01,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 02:16:01,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:16:01,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:16:01,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-12-06 02:16:02,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:16:02,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 168 [2022-12-06 02:16:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:16:02,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:16:06,412 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~i~0 c_~N~0)) (let ((.cse55 (* c_~j~0 4))) (let ((.cse13 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse14 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse11 (not (< (+ c_~j~0 1) c_~N~0))) (.cse4 (+ c_~A~0.offset .cse55)) (.cse6 (+ c_~A~0.offset (* c_~i~0 4))) (.cse5 (+ c_~A~0.offset .cse55 4)) (.cse12 (< (+ 2 c_~j~0) c_~N~0))) (and (or (and (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse6)) (.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse0 .cse1 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse1 2147483648))) (not (<= (+ c_~bag2~0 .cse1) 2147483647)) (< c_~cap1~0 (+ .cse2 c_~bag1~0 1)) (not (<= (+ .cse2 c_~bag1~0) 2147483647)) (not (<= 0 (+ .cse2 c_~bag1~0 2147483648))) (not (<= (+ c_~bag2~0 .cse0 .cse1) 2147483647)) (<= (+ .cse2 c_~bag1~0 c_~sum1~0) (+ c_~bag2~0 .cse0 .cse1 c_~sum2~0)))))) (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse6)) (.cse7 (select .cse10 .cse5)) (.cse8 (select .cse10 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse7 .cse8 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse8 2147483648))) (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (< c_~cap1~0 (+ .cse9 c_~bag1~0 1)) (not (<= (+ .cse9 c_~bag1~0) 2147483647)) (< (+ c_~bag2~0 .cse7 .cse8 c_~sum2~0) (+ .cse9 c_~bag1~0 c_~sum1~0 1)) (not (<= 0 (+ .cse9 c_~bag1~0 2147483648))) (not (<= (+ c_~bag2~0 .cse7 .cse8) 2147483647))))))) .cse11 .cse12) (or (not (<= 0 (+ c_~bag1~0 c_~sum1~0 2147483648))) (< 2147483647 c_~cap1~0) (and (or .cse13 .cse14 (and (or (and (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse4)) (.cse15 (select .cse18 .cse6)) (.cse17 (select .cse18 .cse5))) (or (< 2147483647 (+ .cse15 c_~bag1~0)) (not (<= (+ c_~bag2~0 .cse16) 2147483647)) (not (<= 0 (+ .cse17 .cse16 2147483648))) (< (+ c_~bag2~0 .cse17 .cse16 c_~sum2~0) (+ .cse15 c_~bag1~0 c_~sum1~0 1)) (< c_~bag2~0 (+ .cse17 1)))))) (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~A~0.base))) (let ((.cse19 (select .cse22 .cse6)) (.cse21 (select .cse22 .cse5)) (.cse20 (select .cse22 .cse4))) (or (< 2147483647 (+ .cse19 c_~bag1~0)) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (not (<= 0 (+ .cse21 .cse20 2147483648))) (< c_~bag2~0 (+ .cse21 1)) (<= (+ .cse19 c_~bag1~0 c_~sum1~0) (+ c_~bag2~0 .cse21 .cse20 c_~sum2~0))))))) .cse11 .cse12) (or (and (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~A~0.base))) (let ((.cse23 (select .cse26 .cse6)) (.cse25 (select .cse26 .cse5)) (.cse24 (select .cse26 .cse4))) (or (< 2147483647 (+ .cse23 c_~bag1~0)) (not (<= 0 (+ c_~bag2~0 .cse24 2147483648))) (not (<= (+ c_~bag2~0 .cse24 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse24) 2147483647)) (not (<= 0 (+ .cse25 .cse24 2147483648))) (< (+ c_~bag2~0 .cse25 .cse24 c_~sum2~0) (+ .cse23 c_~bag1~0 c_~sum1~0 1)) (not (<= (+ .cse25 .cse24) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse24 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~A~0.base))) (let ((.cse27 (select .cse30 .cse6)) (.cse29 (select .cse30 .cse5)) (.cse28 (select .cse30 .cse4))) (or (< 2147483647 (+ .cse27 c_~bag1~0)) (not (<= 0 (+ c_~bag2~0 .cse28 2147483648))) (not (<= (+ c_~bag2~0 .cse28 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse28) 2147483647)) (not (<= 0 (+ .cse29 .cse28 2147483648))) (not (<= (+ .cse29 .cse28) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse28 c_~sum2~0 2147483648))) (<= (+ .cse27 c_~bag1~0 c_~sum1~0) (+ c_~bag2~0 .cse29 .cse28 c_~sum2~0))))))) .cse11 .cse12))) (or .cse11 (and (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~A~0.base))) (let ((.cse31 (select .cse34 .cse6)) (.cse32 (select .cse34 .cse5)) (.cse33 (select .cse34 .cse4))) (or (< 2147483647 (+ .cse31 c_~bag1~0)) (not (<= 0 (+ c_~bag2~0 .cse32 .cse33 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse33 2147483648))) (not (<= (+ c_~bag2~0 .cse33) 2147483647)) (< (+ c_~bag2~0 .cse32 .cse33 c_~sum2~0) (+ .cse31 c_~bag1~0 c_~sum1~0 1)) (not (<= (+ c_~bag2~0 .cse32 .cse33) 2147483647)))))) (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~A~0.base))) (let ((.cse35 (select .cse38 .cse6)) (.cse36 (select .cse38 .cse5)) (.cse37 (select .cse38 .cse4))) (or (< 2147483647 (+ .cse35 c_~bag1~0)) (not (<= 0 (+ c_~bag2~0 .cse36 .cse37 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse37 2147483648))) (not (<= (+ c_~bag2~0 .cse37) 2147483647)) (not (<= (+ c_~bag2~0 .cse36 .cse37) 2147483647)) (<= (+ .cse35 c_~bag1~0 c_~sum1~0) (+ c_~bag2~0 .cse36 .cse37 c_~sum2~0))))))) .cse12)) (not (<= (+ c_~bag1~0 c_~sum1~0) 2147483647))) (or .cse13 .cse14 (and (or (and (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~A~0.base))) (let ((.cse39 (select .cse42 .cse4)) (.cse41 (select .cse42 .cse5)) (.cse40 (select .cse42 .cse6))) (or (not (<= (+ c_~bag2~0 .cse39) 2147483647)) (< c_~cap1~0 (+ .cse40 c_~bag1~0 1)) (not (<= 0 (+ .cse41 .cse39 2147483648))) (not (<= (+ .cse40 c_~bag1~0) 2147483647)) (< (+ c_~bag2~0 .cse41 .cse39 c_~sum2~0) (+ .cse40 c_~bag1~0 c_~sum1~0 1)) (< c_~bag2~0 (+ .cse41 1)) (not (<= 0 (+ .cse40 c_~bag1~0 2147483648))))))) (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse46 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~A~0.base))) (let ((.cse44 (select .cse46 .cse6)) (.cse45 (select .cse46 .cse5)) (.cse43 (select .cse46 .cse4))) (or (not (<= (+ c_~bag2~0 .cse43) 2147483647)) (< c_~cap1~0 (+ .cse44 c_~bag1~0 1)) (not (<= 0 (+ .cse45 .cse43 2147483648))) (not (<= (+ .cse44 c_~bag1~0) 2147483647)) (< c_~bag2~0 (+ .cse45 1)) (not (<= 0 (+ .cse44 c_~bag1~0 2147483648))) (<= (+ .cse44 c_~bag1~0 c_~sum1~0) (+ c_~bag2~0 .cse45 .cse43 c_~sum2~0))))))) .cse11 .cse12) (or .cse11 (and (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse50 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~A~0.base))) (let ((.cse48 (select .cse50 .cse6)) (.cse49 (select .cse50 .cse5)) (.cse47 (select .cse50 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse47 2147483648))) (not (<= (+ c_~bag2~0 .cse47 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse47) 2147483647)) (< c_~cap1~0 (+ .cse48 c_~bag1~0 1)) (not (<= 0 (+ .cse49 .cse47 2147483648))) (not (<= (+ .cse48 c_~bag1~0) 2147483647)) (not (<= (+ .cse49 .cse47) 2147483647)) (not (<= 0 (+ .cse48 c_~bag1~0 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse47 c_~sum2~0 2147483648))) (<= (+ .cse48 c_~bag1~0 c_~sum1~0) (+ c_~bag2~0 .cse49 .cse47 c_~sum2~0)))))) (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse54 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~A~0.base))) (let ((.cse53 (select .cse54 .cse5)) (.cse52 (select .cse54 .cse6)) (.cse51 (select .cse54 .cse4))) (or (not (<= 0 (+ c_~bag2~0 .cse51 2147483648))) (not (<= (+ c_~bag2~0 .cse51 c_~sum2~0) 2147483647)) (not (<= (+ c_~bag2~0 .cse51) 2147483647)) (< c_~cap1~0 (+ .cse52 c_~bag1~0 1)) (not (<= 0 (+ .cse53 .cse51 2147483648))) (not (<= (+ .cse52 c_~bag1~0) 2147483647)) (< (+ c_~bag2~0 .cse53 .cse51 c_~sum2~0) (+ .cse52 c_~bag1~0 c_~sum1~0 1)) (not (<= (+ .cse53 .cse51) 2147483647)) (not (<= 0 (+ .cse52 c_~bag1~0 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse51 c_~sum2~0 2147483648)))))))) .cse12))))))) is different from false [2022-12-06 02:16:06,759 INFO L321 Elim1Store]: treesize reduction 26, result has 60.0 percent of original size [2022-12-06 02:16:06,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4410 treesize of output 3300 [2022-12-06 02:16:06,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:16:06,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3055 treesize of output 3007 [2022-12-06 02:16:06,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:16:06,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2980 treesize of output 2932 [2022-12-06 02:16:06,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:16:06,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2905 treesize of output 2881 [2022-12-06 02:16:07,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:16:07,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2854 treesize of output 2830 [2022-12-06 02:16:07,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:16:07,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2803 treesize of output 2767 [2022-12-06 02:16:07,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:16:07,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2740 treesize of output 2704 [2022-12-06 02:16:07,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:16:07,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2677 treesize of output 2629 [2022-12-06 02:16:07,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:16:07,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2602 treesize of output 2554 [2022-12-06 02:16:07,437 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:16:07,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2527 treesize of output 2491 [2022-12-06 02:16:07,473 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-06 02:16:07,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:16:07,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2464 treesize of output 2428 [2022-12-06 02:16:07,593 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:16:07,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2401 treesize of output 2341 [2022-12-06 02:16:07,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:16:07,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2314 treesize of output 2254 Received shutdown request... [2022-12-06 02:27:15,451 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 02:27:15,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 02:27:15,465 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:27:15,465 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:27:15,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-12-06 02:27:15,656 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 18 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-40-14-4-10-7-16-4-16-3-14-2-10-2-8-1 context. [2022-12-06 02:27:15,657 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 02:27:15,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 02:27:15,658 INFO L458 BasicCegarLoop]: Path program histogram: [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:15,660 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:27:15,660 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:27:15,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:27:15 BasicIcfg [2022-12-06 02:27:15,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:27:15,662 INFO L158 Benchmark]: Toolchain (without parser) took 847163.65ms. Allocated memory was 229.6MB in the beginning and 1.2GB in the end (delta: 978.3MB). Free memory was 205.7MB in the beginning and 488.9MB in the end (delta: -283.2MB). Peak memory consumption was 771.3MB. Max. memory is 8.0GB. [2022-12-06 02:27:15,662 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 229.6MB. Free memory is still 205.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:27:15,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.99ms. Allocated memory is still 229.6MB. Free memory was 205.7MB in the beginning and 193.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 02:27:15,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.22ms. Allocated memory is still 229.6MB. Free memory was 193.6MB in the beginning and 191.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 02:27:15,663 INFO L158 Benchmark]: Boogie Preprocessor took 38.61ms. Allocated memory is still 229.6MB. Free memory was 191.0MB in the beginning and 188.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:27:15,663 INFO L158 Benchmark]: RCFGBuilder took 616.96ms. Allocated memory is still 229.6MB. Free memory was 188.9MB in the beginning and 163.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 02:27:15,663 INFO L158 Benchmark]: TraceAbstraction took 846231.32ms. Allocated memory was 229.6MB in the beginning and 1.2GB in the end (delta: 978.3MB). Free memory was 163.2MB in the beginning and 488.9MB in the end (delta: -325.7MB). Peak memory consumption was 729.4MB. Max. memory is 8.0GB. [2022-12-06 02:27:15,664 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 229.6MB. Free memory is still 205.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.99ms. Allocated memory is still 229.6MB. Free memory was 205.7MB in the beginning and 193.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.22ms. Allocated memory is still 229.6MB. Free memory was 193.6MB in the beginning and 191.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.61ms. Allocated memory is still 229.6MB. Free memory was 191.0MB in the beginning and 188.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 616.96ms. Allocated memory is still 229.6MB. Free memory was 188.9MB in the beginning and 163.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 846231.32ms. Allocated memory was 229.6MB in the beginning and 1.2GB in the end (delta: 978.3MB). Free memory was 163.2MB in the beginning and 488.9MB in the end (delta: -325.7MB). Peak memory consumption was 729.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.1s, 305 PlacesBefore, 20 PlacesAfterwards, 326 TransitionsBefore, 16 TransitionsAfterwards, 25652 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 91 TrivialYvCompositions, 194 ConcurrentYvCompositions, 25 ChoiceCompositions, 310 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 17021, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15363, independent: 15348, independent conditional: 0, independent unconditional: 15348, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15363, independent: 15348, independent conditional: 0, independent unconditional: 15348, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17040, independent: 1673, independent conditional: 0, independent unconditional: 1673, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 15363, unknown conditional: 0, unknown unconditional: 15363] , Statistics on independence cache: Total cache size (in pairs): 34757, Positive cache size: 34742, Positive conditional cache size: 0, Positive unconditional cache size: 34742, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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, 24 PlacesBefore, 24 PlacesAfterwards, 43 TransitionsBefore, 43 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, 28 PlacesBefore, 28 PlacesAfterwards, 78 TransitionsBefore, 78 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: 2.1s, 32 PlacesBefore, 31 PlacesAfterwards, 135 TransitionsBefore, 134 TransitionsAfterwards, 0 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, 35 PlacesBefore, 35 PlacesAfterwards, 240 TransitionsBefore, 240 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, 37 PlacesBefore, 37 PlacesAfterwards, 191 TransitionsBefore, 191 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, 57 PlacesBefore, 57 PlacesAfterwards, 209 TransitionsBefore, 209 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, 214 TransitionsBefore, 214 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, 68 PlacesBefore, 68 PlacesAfterwards, 277 TransitionsBefore, 277 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, 106 PlacesBefore, 106 PlacesAfterwards, 409 TransitionsBefore, 409 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.8s, 167 PlacesBefore, 166 PlacesAfterwards, 602 TransitionsBefore, 601 TransitionsAfterwards, 0 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, 196 PlacesBefore, 196 PlacesAfterwards, 643 TransitionsBefore, 643 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, 236 PlacesBefore, 236 PlacesAfterwards, 720 TransitionsBefore, 720 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, 268 PlacesBefore, 268 PlacesAfterwards, 818 TransitionsBefore, 818 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, 283 PlacesBefore, 283 PlacesAfterwards, 841 TransitionsBefore, 841 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, 327 PlacesBefore, 327 PlacesAfterwards, 945 TransitionsBefore, 945 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, 378 PlacesBefore, 378 PlacesAfterwards, 991 TransitionsBefore, 991 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, 382 PlacesBefore, 382 PlacesAfterwards, 1000 TransitionsBefore, 1000 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: 2.6s, 354 PlacesBefore, 353 PlacesAfterwards, 710 TransitionsBefore, 709 TransitionsAfterwards, 0 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, 291 PlacesBefore, 291 PlacesAfterwards, 463 TransitionsBefore, 463 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 - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 18 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-40-14-4-10-7-16-4-16-3-14-2-10-2-8-1 context. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 18 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-40-14-4-10-7-16-4-16-3-14-2-10-2-8-1 context. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 18 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-40-14-4-10-7-16-4-16-3-14-2-10-2-8-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 503 locations, 3 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: 846.0s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 70.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.4s, HoareTripleCheckerStatistics: 68 mSolverCounterUnknown, 2981 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2981 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 308 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 725 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6209 IncrementalHoareTripleChecker+Invalid, 7310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 725 mSolverCounterUnsat, 0 mSDtfsCounter, 6209 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 763 GetRequests, 224 SyntacticMatches, 19 SemanticMatches, 520 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 7616 ImplicationChecksByTransitivity, 63.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36398occurred in iteration=17, InterpolantAutomatonStates: 398, 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.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 20.9s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 594 ConstructedInterpolants, 20 QuantifiedInterpolants, 20301 SizeOfPredicates, 680 NumberOfNonLiveVariables, 2627 ConjunctsInSsa, 512 ConjunctsInUnsatCore, 43 InterpolantComputations, 8 PerfectInterpolantSequences, 34/99 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown