/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/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:41:57,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:41:57,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:41:57,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:41:57,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:41:57,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:41:57,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:41:57,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:41:57,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:41:57,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:41:57,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:41:57,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:41:57,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:41:57,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:41:57,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:41:57,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:41:57,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:41:57,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:41:57,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:41:57,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:41:57,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:41:57,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:41:57,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:41:57,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:41:57,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:41:57,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:41:57,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:41:57,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:41:57,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:41:57,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:41:57,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:41:57,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:41:57,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:41:57,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:41:57,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:41:57,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:41:57,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:41:57,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:41:57,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:41:57,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:41:57,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:41:57,161 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-13 03:41:57,195 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:41:57,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:41:57,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:41:57,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:41:57,197 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:41:57,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:41:57,198 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:41:57,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:41:57,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:41:57,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:41:57,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:41:57,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:41:57,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:41:57,199 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:41:57,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:41:57,200 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:41:57,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:41:57,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:41:57,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:41:57,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:41:57,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:41:57,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:41:57,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:41:57,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:41:57,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:41:57,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:41:57,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:41:57,201 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:41:57,201 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-13 03:41:57,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:41:57,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:41:57,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:41:57,477 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:41:57,478 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:41:57,479 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2022-12-13 03:41:58,392 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:41:58,612 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:41:58,613 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2022-12-13 03:41:58,618 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/959b0d1d6/736914c0ac5545478a8d435d7cc26a50/FLAG93dcb390e [2022-12-13 03:41:58,632 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/959b0d1d6/736914c0ac5545478a8d435d7cc26a50 [2022-12-13 03:41:58,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:41:58,637 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:41:58,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:41:58,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:41:58,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:41:58,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:41:58" (1/1) ... [2022-12-13 03:41:58,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa637cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:58, skipping insertion in model container [2022-12-13 03:41:58,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:41:58" (1/1) ... [2022-12-13 03:41:58,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:41:58,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:41:58,788 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/bench-exp2x3.wvr.c[2237,2250] [2022-12-13 03:41:58,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:41:58,802 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:41:58,836 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/bench-exp2x3.wvr.c[2237,2250] [2022-12-13 03:41:58,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:41:58,850 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:41:58,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:58 WrapperNode [2022-12-13 03:41:58,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:41:58,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:41:58,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:41:58,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:41:58,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:58" (1/1) ... [2022-12-13 03:41:58,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:58" (1/1) ... [2022-12-13 03:41:58,891 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-13 03:41:58,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:41:58,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:41:58,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:41:58,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:41:58,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:58" (1/1) ... [2022-12-13 03:41:58,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:58" (1/1) ... [2022-12-13 03:41:58,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:58" (1/1) ... [2022-12-13 03:41:58,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:58" (1/1) ... [2022-12-13 03:41:58,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:58" (1/1) ... [2022-12-13 03:41:58,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:58" (1/1) ... [2022-12-13 03:41:58,923 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:58" (1/1) ... [2022-12-13 03:41:58,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:58" (1/1) ... [2022-12-13 03:41:58,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:41:58,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:41:58,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:41:58,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:41:58,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:58" (1/1) ... [2022-12-13 03:41:58,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:41:58,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:41:58,952 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-13 03:41:58,959 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-13 03:41:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:41:58,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 03:41:58,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 03:41:58,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 03:41:58,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 03:41:58,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 03:41:58,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 03:41:58,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 03:41:58,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 03:41:58,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:41:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:41:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:41:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:41:58,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:41:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 03:41:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:41:58,987 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:41:59,074 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:41:59,076 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:41:59,239 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:41:59,244 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:41:59,244 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 03:41:59,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:41:59 BoogieIcfgContainer [2022-12-13 03:41:59,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:41:59,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:41:59,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:41:59,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:41:59,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:41:58" (1/3) ... [2022-12-13 03:41:59,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b430cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:41:59, skipping insertion in model container [2022-12-13 03:41:59,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:58" (2/3) ... [2022-12-13 03:41:59,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b430cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:41:59, skipping insertion in model container [2022-12-13 03:41:59,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:41:59" (3/3) ... [2022-12-13 03:41:59,250 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2022-12-13 03:41:59,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:41:59,262 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 03:41:59,262 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:41:59,319 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 03:41:59,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 118 transitions, 268 flow [2022-12-13 03:41:59,402 INFO L130 PetriNetUnfolder]: 10/114 cut-off events. [2022-12-13 03:41:59,402 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 03:41:59,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 114 events. 10/114 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-13 03:41:59,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 118 transitions, 268 flow [2022-12-13 03:41:59,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 102 transitions, 228 flow [2022-12-13 03:41:59,411 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:41:59,433 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 102 transitions, 228 flow [2022-12-13 03:41:59,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 102 transitions, 228 flow [2022-12-13 03:41:59,468 INFO L130 PetriNetUnfolder]: 10/102 cut-off events. [2022-12-13 03:41:59,468 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 03:41:59,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 102 events. 10/102 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-13 03:41:59,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 102 transitions, 228 flow [2022-12-13 03:41:59,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-13 03:42:02,588 INFO L241 LiptonReduction]: Total number of compositions: 77 [2022-12-13 03:42:02,598 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:42:02,602 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;@1edc3237, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:42:02,602 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 03:42:02,608 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-13 03:42:02,608 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 03:42:02,608 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:42:02,608 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:42:02,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:42:02,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:42:02,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2001352824, now seen corresponding path program 1 times [2022-12-13 03:42:02,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:42:02,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511345822] [2022-12-13 03:42:02,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:42:02,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:42:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:42:03,189 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-13 03:42:03,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:42:03,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511345822] [2022-12-13 03:42:03,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511345822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:42:03,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:42:03,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:42:03,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129135013] [2022-12-13 03:42:03,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:42:03,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:42:03,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:42:03,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:42:03,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:42:03,219 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:42:03,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:42:03,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:42:03,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:42:03,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:42:03,351 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2022-12-13 03:42:03,351 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-13 03:42:03,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1775 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2022-12-13 03:42:03,357 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2022-12-13 03:42:03,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2022-12-13 03:42:03,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:42:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:42:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-13 03:42:03,367 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-13 03:42:03,369 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-13 03:42:03,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 47 transitions, 233 flow [2022-12-13 03:42:03,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 46 transitions, 226 flow [2022-12-13 03:42:03,375 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:42:03,376 INFO L89 Accepts]: Start accepts. Operand has 36 places, 46 transitions, 226 flow [2022-12-13 03:42:03,379 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:42:03,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:42:03,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 46 transitions, 226 flow [2022-12-13 03:42:03,387 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 46 transitions, 226 flow [2022-12-13 03:42:03,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:42:03,389 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:42:03,390 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 03:42:03,391 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 46 transitions, 226 flow [2022-12-13 03:42:03,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:42:03,391 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:42:03,391 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:42:03,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:42:03,391 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:42:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:42:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1404355402, now seen corresponding path program 1 times [2022-12-13 03:42:03,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:42:03,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628748517] [2022-12-13 03:42:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:42:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:42:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:42:03,555 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-13 03:42:03,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:42:03,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628748517] [2022-12-13 03:42:03,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628748517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:42:03,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:42:03,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:42:03,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870820301] [2022-12-13 03:42:03,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:42:03,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:42:03,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:42:03,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:42:03,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:42:03,566 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:42:03,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 46 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:42:03,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:42:03,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:42:03,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:42:03,736 INFO L130 PetriNetUnfolder]: 461/640 cut-off events. [2022-12-13 03:42:03,736 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-13 03:42:03,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2014 conditions, 640 events. 461/640 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1787 event pairs, 37 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 1736. Up to 435 conditions per place. [2022-12-13 03:42:03,739 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-13 03:42:03,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 59 transitions, 405 flow [2022-12-13 03:42:03,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:42:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:42:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-13 03:42:03,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-13 03:42:03,741 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-13 03:42:03,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 59 transitions, 405 flow [2022-12-13 03:42:03,743 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 59 transitions, 405 flow [2022-12-13 03:42:03,745 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:42:03,745 INFO L89 Accepts]: Start accepts. Operand has 39 places, 59 transitions, 405 flow [2022-12-13 03:42:03,745 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:42:03,746 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:42:03,746 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 59 transitions, 405 flow [2022-12-13 03:42:03,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 59 transitions, 405 flow [2022-12-13 03:42:03,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:42:03,747 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:42:03,748 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 03:42:03,748 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 59 transitions, 405 flow [2022-12-13 03:42:03,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:42:03,748 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:42:03,748 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:42:03,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:42:03,748 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:42:03,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:42:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1417631276, now seen corresponding path program 2 times [2022-12-13 03:42:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:42:03,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26942315] [2022-12-13 03:42:03,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:42:03,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:42:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:42:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:42:03,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:42:03,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26942315] [2022-12-13 03:42:03,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26942315] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:42:03,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833201316] [2022-12-13 03:42:03,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 03:42:03,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:42:03,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:42:03,874 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-13 03:42:03,910 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-13 03:42:03,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 03:42:03,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:42:03,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 03:42:03,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:42:04,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:42:04,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:42:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:42:04,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833201316] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:42:04,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:42:04,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 03:42:04,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722653039] [2022-12-13 03:42:04,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:42:04,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:42:04,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:42:04,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:42:04,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:42:04,185 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:42:04,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 59 transitions, 405 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 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-13 03:42:04,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:42:04,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:42:04,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:42:04,471 INFO L130 PetriNetUnfolder]: 893/1232 cut-off events. [2022-12-13 03:42:04,471 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-13 03:42:04,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5089 conditions, 1232 events. 893/1232 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4114 event pairs, 37 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 4592. Up to 1027 conditions per place. [2022-12-13 03:42:04,479 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 98 selfloop transitions, 12 changer transitions 0/110 dead transitions. [2022-12-13 03:42:04,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 110 transitions, 973 flow [2022-12-13 03:42:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:42:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:42:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-13 03:42:04,481 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.66 [2022-12-13 03:42:04,481 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-12-13 03:42:04,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 110 transitions, 973 flow [2022-12-13 03:42:04,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 110 transitions, 973 flow [2022-12-13 03:42:04,494 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:42:04,494 INFO L89 Accepts]: Start accepts. Operand has 44 places, 110 transitions, 973 flow [2022-12-13 03:42:04,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:42:04,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:42:04,495 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 110 transitions, 973 flow [2022-12-13 03:42:04,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 110 transitions, 973 flow [2022-12-13 03:42:04,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:42:04,498 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:42:04,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 03:42:04,499 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 110 transitions, 973 flow [2022-12-13 03:42:04,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 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-13 03:42:04,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:42:04,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:42:04,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 03:42:04,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:42:04,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:42:04,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:42:04,704 INFO L85 PathProgramCache]: Analyzing trace with hash 618130395, now seen corresponding path program 1 times [2022-12-13 03:42:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:42:04,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111325444] [2022-12-13 03:42:04,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:42:04,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:42:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:42:04,882 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-13 03:42:04,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:42:04,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111325444] [2022-12-13 03:42:04,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111325444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:42:04,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:42:04,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:42:04,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789841011] [2022-12-13 03:42:04,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:42:04,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:42:04,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:42:04,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:42:04,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:42:04,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:42:04,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 110 transitions, 973 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:42:04,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:42:04,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:42:04,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:42:05,044 INFO L130 PetriNetUnfolder]: 863/1202 cut-off events. [2022-12-13 03:42:05,044 INFO L131 PetriNetUnfolder]: For 164/164 co-relation queries the response was YES. [2022-12-13 03:42:05,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6172 conditions, 1202 events. 863/1202 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3916 event pairs, 104 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 5572. Up to 997 conditions per place. [2022-12-13 03:42:05,051 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 102 selfloop transitions, 11 changer transitions 17/130 dead transitions. [2022-12-13 03:42:05,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 130 transitions, 1405 flow [2022-12-13 03:42:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:42:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:42:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-13 03:42:05,053 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-13 03:42:05,053 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-13 03:42:05,054 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 130 transitions, 1405 flow [2022-12-13 03:42:05,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 113 transitions, 1223 flow [2022-12-13 03:42:05,064 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:42:05,064 INFO L89 Accepts]: Start accepts. Operand has 47 places, 113 transitions, 1223 flow [2022-12-13 03:42:05,065 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:42:05,065 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:42:05,065 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 113 transitions, 1223 flow [2022-12-13 03:42:05,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 113 transitions, 1223 flow [2022-12-13 03:42:05,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:42:05,067 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:42:05,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 03:42:05,068 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 113 transitions, 1223 flow [2022-12-13 03:42:05,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:42:05,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:42:05,068 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:42:05,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:42:05,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:42:05,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:42:05,069 INFO L85 PathProgramCache]: Analyzing trace with hash -501456879, now seen corresponding path program 1 times [2022-12-13 03:42:05,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:42:05,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750091622] [2022-12-13 03:42:05,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:42:05,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:42:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:42:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:42:05,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:42:05,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750091622] [2022-12-13 03:42:05,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750091622] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:42:05,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639047952] [2022-12-13 03:42:05,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:42:05,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:42:05,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:42:05,195 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-13 03:42:05,195 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-13 03:42:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:42:05,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 03:42:05,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:42:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:42:05,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:42:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:42:05,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639047952] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:42:05,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:42:05,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 03:42:05,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905087468] [2022-12-13 03:42:05,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:42:05,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:42:05,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:42:05,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:42:05,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:42:05,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:42:05,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 113 transitions, 1223 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 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-13 03:42:05,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:42:05,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:42:05,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:42:05,749 INFO L130 PetriNetUnfolder]: 1456/1993 cut-off events. [2022-12-13 03:42:05,749 INFO L131 PetriNetUnfolder]: For 256/256 co-relation queries the response was YES. [2022-12-13 03:42:05,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12178 conditions, 1993 events. 1456/1993 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6999 event pairs, 100 based on Foata normal form. 0/1331 useless extension candidates. Maximal degree in co-relation 11341. Up to 1919 conditions per place. [2022-12-13 03:42:05,787 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 213 selfloop transitions, 27 changer transitions 0/240 dead transitions. [2022-12-13 03:42:05,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 240 transitions, 3057 flow [2022-12-13 03:42:05,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:42:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:42:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-13 03:42:05,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-13 03:42:05,789 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2022-12-13 03:42:05,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 240 transitions, 3057 flow [2022-12-13 03:42:05,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 240 transitions, 3057 flow [2022-12-13 03:42:05,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:42:05,809 INFO L89 Accepts]: Start accepts. Operand has 52 places, 240 transitions, 3057 flow [2022-12-13 03:42:05,810 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:42:05,810 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:42:05,810 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 240 transitions, 3057 flow [2022-12-13 03:42:05,813 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 240 transitions, 3057 flow [2022-12-13 03:42:05,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:42:05,814 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:42:05,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 03:42:05,814 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 240 transitions, 3057 flow [2022-12-13 03:42:05,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 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-13 03:42:05,814 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:42:05,815 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:42:05,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 03:42:06,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:42:06,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:42:06,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:42:06,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1246409451, now seen corresponding path program 2 times [2022-12-13 03:42:06,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:42:06,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475743161] [2022-12-13 03:42:06,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:42:06,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:42:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:42:06,122 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-13 03:42:06,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:42:06,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475743161] [2022-12-13 03:42:06,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475743161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:42:06,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:42:06,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:42:06,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972495679] [2022-12-13 03:42:06,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:42:06,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:42:06,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:42:06,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:42:06,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:42:06,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:42:06,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 240 transitions, 3057 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:42:06,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:42:06,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:42:06,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:42:06,378 INFO L130 PetriNetUnfolder]: 1708/2329 cut-off events. [2022-12-13 03:42:06,379 INFO L131 PetriNetUnfolder]: For 332/332 co-relation queries the response was YES. [2022-12-13 03:42:06,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16542 conditions, 2329 events. 1708/2329 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8432 event pairs, 84 based on Foata normal form. 0/1577 useless extension candidates. Maximal degree in co-relation 15574. Up to 2255 conditions per place. [2022-12-13 03:42:06,390 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 267 selfloop transitions, 13 changer transitions 0/280 dead transitions. [2022-12-13 03:42:06,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 280 transitions, 4115 flow [2022-12-13 03:42:06,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:42:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:42:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 03:42:06,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.57 [2022-12-13 03:42:06,392 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2022-12-13 03:42:06,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 280 transitions, 4115 flow [2022-12-13 03:42:06,402 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 280 transitions, 4115 flow [2022-12-13 03:42:06,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:42:06,411 INFO L89 Accepts]: Start accepts. Operand has 55 places, 280 transitions, 4115 flow [2022-12-13 03:42:06,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:42:06,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:42:06,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 280 transitions, 4115 flow [2022-12-13 03:42:06,416 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 280 transitions, 4115 flow [2022-12-13 03:42:06,416 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:42:06,417 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:42:06,417 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 03:42:06,417 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 280 transitions, 4115 flow [2022-12-13 03:42:06,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:42:06,417 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:42:06,418 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:42:06,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:42:06,418 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:42:06,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:42:06,418 INFO L85 PathProgramCache]: Analyzing trace with hash 850639269, now seen corresponding path program 1 times [2022-12-13 03:42:06,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:42:06,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849600891] [2022-12-13 03:42:06,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:42:06,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:42:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:42:06,509 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-13 03:42:06,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:42:06,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849600891] [2022-12-13 03:42:06,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849600891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:42:06,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:42:06,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:42:06,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181746842] [2022-12-13 03:42:06,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:42:06,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:42:06,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:42:06,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:42:06,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:42:06,510 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:42:06,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 280 transitions, 4115 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:42:06,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:42:06,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:42:06,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:42:06,806 INFO L130 PetriNetUnfolder]: 1924/2613 cut-off events. [2022-12-13 03:42:06,806 INFO L131 PetriNetUnfolder]: For 334/334 co-relation queries the response was YES. [2022-12-13 03:42:06,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21164 conditions, 2613 events. 1924/2613 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9673 event pairs, 22 based on Foata normal form. 0/1779 useless extension candidates. Maximal degree in co-relation 19965. Up to 2539 conditions per place. [2022-12-13 03:42:06,829 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 303 selfloop transitions, 13 changer transitions 0/316 dead transitions. [2022-12-13 03:42:06,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 316 transitions, 5263 flow [2022-12-13 03:42:06,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:42:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:42:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 03:42:06,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.57 [2022-12-13 03:42:06,831 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2022-12-13 03:42:06,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 316 transitions, 5263 flow [2022-12-13 03:42:06,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 316 transitions, 5263 flow [2022-12-13 03:42:06,873 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:42:06,873 INFO L89 Accepts]: Start accepts. Operand has 58 places, 316 transitions, 5263 flow [2022-12-13 03:42:06,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:42:06,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:42:06,876 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 316 transitions, 5263 flow [2022-12-13 03:42:06,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 316 transitions, 5263 flow [2022-12-13 03:42:06,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:42:06,883 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:42:06,884 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 03:42:06,884 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 316 transitions, 5263 flow [2022-12-13 03:42:06,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:42:06,884 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:42:06,884 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:42:06,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:42:06,885 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:42:06,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:42:06,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1770583295, now seen corresponding path program 1 times [2022-12-13 03:42:06,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:42:06,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330312724] [2022-12-13 03:42:06,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:42:06,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:42:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:42:07,290 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-13 03:42:07,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:42:07,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330312724] [2022-12-13 03:42:07,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330312724] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:42:07,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133609502] [2022-12-13 03:42:07,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:42:07,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:42:07,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:42:07,292 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-13 03:42:07,294 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-13 03:42:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:42:07,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 03:42:07,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:42:14,590 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-13 03:42:14,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:42:18,523 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-13 03:42:18,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133609502] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:42:18,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:42:18,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-12-13 03:42:18,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941873507] [2022-12-13 03:42:18,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:42:18,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:42:18,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:42:18,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:42:18,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=147, Unknown=2, NotChecked=0, Total=210 [2022-12-13 03:42:18,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:42:18,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 316 transitions, 5263 flow. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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-13 03:42:18,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:42:18,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:42:18,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:42:20,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:42:30,858 WARN L233 SmtUtils]: Spent 7.23s on a formula simplification. DAG size of input: 51 DAG size of output: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 03:42:38,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:42:40,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:42:42,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:42:44,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:42:46,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:42:48,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:42:50,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:42:52,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:43:05,337 WARN L233 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 78 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 03:43:07,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:43:08,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:43:10,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:43:13,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:43:20,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:43:22,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:43:26,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:43:27,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:43:32,931 INFO L130 PetriNetUnfolder]: 3408/4744 cut-off events. [2022-12-13 03:43:32,931 INFO L131 PetriNetUnfolder]: For 619/619 co-relation queries the response was YES. [2022-12-13 03:43:32,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43224 conditions, 4744 events. 3408/4744 cut-off events. For 619/619 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20595 event pairs, 36 based on Foata normal form. 3/3265 useless extension candidates. Maximal degree in co-relation 40392. Up to 4670 conditions per place. [2022-12-13 03:43:32,959 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 570 selfloop transitions, 110 changer transitions 3/683 dead transitions. [2022-12-13 03:43:32,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 683 transitions, 12777 flow [2022-12-13 03:43:32,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 03:43:32,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 03:43:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 230 transitions. [2022-12-13 03:43:32,962 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2022-12-13 03:43:32,965 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places. [2022-12-13 03:43:32,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 683 transitions, 12777 flow [2022-12-13 03:43:32,989 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 680 transitions, 12714 flow [2022-12-13 03:43:33,009 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:43:33,009 INFO L89 Accepts]: Start accepts. Operand has 72 places, 680 transitions, 12714 flow [2022-12-13 03:43:33,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:43:33,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:43:33,013 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 680 transitions, 12714 flow [2022-12-13 03:43:33,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 680 transitions, 12714 flow [2022-12-13 03:43:33,024 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:43:33,027 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:43:33,029 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 03:43:33,029 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 680 transitions, 12714 flow [2022-12-13 03:43:33,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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-13 03:43:33,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:43:33,029 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:43:33,040 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-13 03:43:33,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:43:33,235 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:43:33,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:43:33,235 INFO L85 PathProgramCache]: Analyzing trace with hash -937633870, now seen corresponding path program 1 times [2022-12-13 03:43:33,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:43:33,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973338685] [2022-12-13 03:43:33,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:43:33,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:43:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:43:33,717 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-13 03:43:33,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:43:33,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973338685] [2022-12-13 03:43:33,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973338685] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:43:33,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399118578] [2022-12-13 03:43:33,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:43:33,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:43:33,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:43:33,719 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-13 03:43:33,722 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-13 03:43:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:43:33,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 03:43:33,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:43:55,581 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-13 03:43:55,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:44:00,133 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-13 03:44:00,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399118578] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:44:00,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:44:00,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 03:44:00,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179978178] [2022-12-13 03:44:00,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:44:00,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:44:00,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:44:00,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:44:00,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=168, Unknown=5, NotChecked=0, Total=240 [2022-12-13 03:44:00,134 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:44:00,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 680 transitions, 12714 flow. Second operand has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 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-13 03:44:00,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:44:00,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:44:00,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:44:14,329 WARN L233 SmtUtils]: Spent 7.81s on a formula simplification. DAG size of input: 55 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 03:44:16,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:44:18,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:44:20,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:44:22,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:44:24,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:44:26,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:44:29,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:44:39,979 WARN L233 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 70 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 03:44:52,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:44:54,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:44:56,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:44:58,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:01,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:03,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:05,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:07,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:10,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:12,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:14,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:16,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:18,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:20,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:22,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:42,462 WARN L233 SmtUtils]: Spent 12.76s on a formula simplification. DAG size of input: 61 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 03:45:45,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:47,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:49,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:54,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:56,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:45:58,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:46:00,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:46:11,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:46:13,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:46:14,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:46:16,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:46:28,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:46:32,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:46:34,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:46:40,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:46:45,677 INFO L130 PetriNetUnfolder]: 4836/6799 cut-off events. [2022-12-13 03:46:45,677 INFO L131 PetriNetUnfolder]: For 990/990 co-relation queries the response was YES. [2022-12-13 03:46:45,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68736 conditions, 6799 events. 4836/6799 cut-off events. For 990/990 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 32043 event pairs, 30 based on Foata normal form. 4/4650 useless extension candidates. Maximal degree in co-relation 64540. Up to 6725 conditions per place. [2022-12-13 03:46:45,712 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 916 selfloop transitions, 114 changer transitions 10/1040 dead transitions. [2022-12-13 03:46:45,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 1040 transitions, 21550 flow [2022-12-13 03:46:45,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 03:46:45,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 03:46:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 246 transitions. [2022-12-13 03:46:45,714 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5788235294117647 [2022-12-13 03:46:45,714 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places. [2022-12-13 03:46:45,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 1040 transitions, 21550 flow [2022-12-13 03:46:45,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 1030 transitions, 21329 flow [2022-12-13 03:46:45,804 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:46:45,804 INFO L89 Accepts]: Start accepts. Operand has 88 places, 1030 transitions, 21329 flow [2022-12-13 03:46:45,809 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:46:45,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:46:45,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 1030 transitions, 21329 flow [2022-12-13 03:46:45,824 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 1030 transitions, 21329 flow [2022-12-13 03:46:45,824 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:46:45,913 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [385] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_44 4294967296) (mod v_~n~0_55 4294967296)) (= (* v_~x4~0_44 2) v_~x4~0_43)) InVars {~x4~0=v_~x4~0_44, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_43, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] and [382] L85-4-->L86-1: Formula: (= (select (select |v_#memory_int_93| |v_ULTIMATE.start_main_~#t1~0#1.base_33|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) |v_ULTIMATE.start_main_#t~mem14#1_24|) InVars {#memory_int=|v_#memory_int_93|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_33|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_33|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_24|, #memory_int=|v_#memory_int_93|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_33|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] [2022-12-13 03:46:45,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [385] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_44 4294967296) (mod v_~n~0_55 4294967296)) (= (* v_~x4~0_44 2) v_~x4~0_43)) InVars {~x4~0=v_~x4~0_44, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_43, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] and [336] L86-2-->L87-1: Formula: (= (select (select |v_#memory_int_49| |v_ULTIMATE.start_main_~#t2~0#1.base_17|) |v_ULTIMATE.start_main_~#t2~0#1.offset_17|) |v_ULTIMATE.start_main_#t~mem15#1_12|) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_17|, #memory_int=|v_#memory_int_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_10|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_12|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_17|, #memory_int=|v_#memory_int_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~mem15#1] [2022-12-13 03:46:45,950 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [385] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_44 4294967296) (mod v_~n~0_55 4294967296)) (= (* v_~x4~0_44 2) v_~x4~0_43)) InVars {~x4~0=v_~x4~0_44, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_43, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] and [319] L46-1-->L46-1: Formula: (and (= (* v_~x2~0_12 2) v_~x2~0_11) (< (mod v_~x2~0_12 4294967296) (mod v_~n~0_11 4294967296))) InVars {~x2~0=v_~x2~0_12, ~n~0=v_~n~0_11} OutVars{~x2~0=v_~x2~0_11, ~n~0=v_~n~0_11} AuxVars[] AssignedVars[~x2~0] [2022-12-13 03:46:45,974 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [385] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_44 4294967296) (mod v_~n~0_55 4294967296)) (= (* v_~x4~0_44 2) v_~x4~0_43)) InVars {~x4~0=v_~x4~0_44, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_43, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] and [395] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res.base_Out_2| 0) (not (< (mod v_~x2~0_In_3 4294967296) (mod v_~n~0_In_7 4294967296))) (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_2|)) InVars {~n~0=v_~n~0_In_7, ~x2~0=v_~x2~0_In_3} OutVars{~x2~0=v_~x2~0_In_3, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_2|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] [2022-12-13 03:46:46,019 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [385] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_44 4294967296) (mod v_~n~0_55 4294967296)) (= (* v_~x4~0_44 2) v_~x4~0_43)) InVars {~x4~0=v_~x4~0_44, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_43, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] and [330] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_14 4294967296) (mod v_~n~0_19 4294967296)) (= v_~x1~0_13 (* v_~x1~0_14 2))) InVars {~n~0=v_~n~0_19, ~x1~0=v_~x1~0_14} OutVars{~n~0=v_~n~0_19, ~x1~0=v_~x1~0_13} AuxVars[] AssignedVars[~x1~0] [2022-12-13 03:46:46,054 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [385] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_44 4294967296) (mod v_~n~0_55 4294967296)) (= (* v_~x4~0_44 2) v_~x4~0_43)) InVars {~x4~0=v_~x4~0_44, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_43, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] and [390] L38-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_Out_2| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_2| 0) (not (< (mod v_~x1~0_In_1 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x1~0=v_~x1~0_In_1} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_2|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_2|, ~n~0=v_~n~0_In_1, ~x1~0=v_~x1~0_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-13 03:46:46,099 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [385] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_44 4294967296) (mod v_~n~0_55 4294967296)) (= (* v_~x4~0_44 2) v_~x4~0_43)) InVars {~x4~0=v_~x4~0_44, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_43, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] and [306] L88-2-->L89-1: Formula: (= (select (select |v_#memory_int_15| |v_ULTIMATE.start_main_~#t4~0#1.base_7|) |v_ULTIMATE.start_main_~#t4~0#1.offset_7|) |v_ULTIMATE.start_main_#t~mem17#1_6|) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_7|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_7|} OutVars{ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_6|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_6|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_7|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~mem16#1] [2022-12-13 03:46:46,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [385] L62-1-->L62-1: Formula: (and (< (mod v_~x4~0_44 4294967296) (mod v_~n~0_55 4294967296)) (= (* v_~x4~0_44 2) v_~x4~0_43)) InVars {~x4~0=v_~x4~0_44, ~n~0=v_~n~0_55} OutVars{~x4~0=v_~x4~0_43, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[~x4~0] and [321] L87-2-->L88-1: Formula: (= (select (select |v_#memory_int_25| |v_ULTIMATE.start_main_~#t3~0#1.base_11|) |v_ULTIMATE.start_main_~#t3~0#1.offset_11|) |v_ULTIMATE.start_main_#t~mem16#1_10|) InVars {ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_11|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_11|} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_11|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_10|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~mem16#1] [2022-12-13 03:46:46,138 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:46:46,139 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 335 [2022-12-13 03:46:46,139 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 1030 transitions, 21345 flow [2022-12-13 03:46:46,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 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-13 03:46:46,139 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:46:46,139 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:46:46,148 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-13 03:46:46,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:46:46,344 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:46:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:46:46,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1500050034, now seen corresponding path program 2 times [2022-12-13 03:46:46,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:46:46,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150888746] [2022-12-13 03:46:46,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:46:46,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:46:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:46:46,826 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-13 03:46:46,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:46:46,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150888746] [2022-12-13 03:46:46,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150888746] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:46:46,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582394460] [2022-12-13 03:46:46,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 03:46:46,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:46:46,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:46:46,828 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-13 03:46:46,830 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-13 03:46:46,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 03:46:46,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:46:46,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 03:46:46,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:47:02,285 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-13 03:47:02,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:47:10,836 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-13 03:47:10,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582394460] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:47:10,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:47:10,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 03:47:10,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879274535] [2022-12-13 03:47:10,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:47:10,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:47:10,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:47:10,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:47:10,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=167, Unknown=7, NotChecked=0, Total=240 [2022-12-13 03:47:10,838 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 03:47:10,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 1030 transitions, 21345 flow. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 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-13 03:47:10,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:47:10,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 03:47:10,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:47:17,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:47:30,837 WARN L233 SmtUtils]: Spent 12.66s on a formula simplification. DAG size of input: 66 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 03:47:32,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:47:34,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:47:36,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:47:40,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:47:45,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:47:48,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:47:50,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:47:53,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:47:55,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:47:57,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:47:59,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:01,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:03,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:05,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:07,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:09,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:11,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:13,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:15,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:17,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:19,939 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse3 (mod (div (- c_~x3~0) (- 2)) 4294967296)) (.cse2 (mod c_~n~0 4294967296))) (and (< 0 .cse0) (= .cse0 (mod c_~x2~0 4294967296)) (or (and (let ((.cse1 (* c_~x3~0 2))) (= (+ (* (div .cse1 4294967296) 4294967296) c_~x4~0) (+ .cse1 (* (div c_~x4~0 4294967296) 4294967296)))) (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0))) (not (< (mod c_~x3~0 4294967296) .cse2)) (< (* 2 (mod c_~x3~0 2147483648)) .cse2)) (= .cse3 (mod (div (- c_~x4~0) (- 2)) 4294967296)) (not (< (mod c_~x4~0 4294967296) .cse2)) (< .cse3 .cse2) (= (mod c_~x4~0 2) 0) (= (mod c_~x3~0 2) 0))) is different from false [2022-12-13 03:48:25,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:27,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:29,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:31,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:33,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:35,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:38,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:40,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:42,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:45,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:48,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:50,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:48:51,179 INFO L130 PetriNetUnfolder]: 7814/11171 cut-off events. [2022-12-13 03:48:51,179 INFO L131 PetriNetUnfolder]: For 1754/1754 co-relation queries the response was YES. [2022-12-13 03:48:51,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124048 conditions, 11171 events. 7814/11171 cut-off events. For 1754/1754 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 59191 event pairs, 90 based on Foata normal form. 5/7521 useless extension candidates. Maximal degree in co-relation 116676. Up to 11097 conditions per place. [2022-12-13 03:48:51,295 INFO L137 encePairwiseOnDemand]: 9/35 looper letters, 1533 selfloop transitions, 338 changer transitions 27/1898 dead transitions. [2022-12-13 03:48:51,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 1898 transitions, 43071 flow [2022-12-13 03:48:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 03:48:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 03:48:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 286 transitions. [2022-12-13 03:48:51,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4085714285714286 [2022-12-13 03:48:51,310 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 73 predicate places. [2022-12-13 03:48:51,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 1898 transitions, 43071 flow [2022-12-13 03:48:51,402 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 1871 transitions, 42438 flow [2022-12-13 03:48:51,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:48:51,464 INFO L89 Accepts]: Start accepts. Operand has 106 places, 1871 transitions, 42438 flow [2022-12-13 03:48:51,478 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:48:51,479 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:48:51,479 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 1871 transitions, 42438 flow [2022-12-13 03:48:51,554 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 1871 transitions, 42438 flow [2022-12-13 03:48:51,555 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:48:51,561 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L54-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_3 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~x3~0=v_~x3~0_In_3, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [319] L46-1-->L46-1: Formula: (and (= (* v_~x2~0_12 2) v_~x2~0_11) (< (mod v_~x2~0_12 4294967296) (mod v_~n~0_11 4294967296))) InVars {~x2~0=v_~x2~0_12, ~n~0=v_~n~0_11} OutVars{~x2~0=v_~x2~0_11, ~n~0=v_~n~0_11} AuxVars[] AssignedVars[~x2~0] [2022-12-13 03:48:51,614 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L54-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_3 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~x3~0=v_~x3~0_In_3, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [395] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res.base_Out_2| 0) (not (< (mod v_~x2~0_In_3 4294967296) (mod v_~n~0_In_7 4294967296))) (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_2|)) InVars {~n~0=v_~n~0_In_7, ~x2~0=v_~x2~0_In_3} OutVars{~x2~0=v_~x2~0_In_3, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_2|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] [2022-12-13 03:48:51,681 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L54-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_3 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~x3~0=v_~x3~0_In_3, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [382] L85-4-->L86-1: Formula: (= (select (select |v_#memory_int_93| |v_ULTIMATE.start_main_~#t1~0#1.base_33|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) |v_ULTIMATE.start_main_#t~mem14#1_24|) InVars {#memory_int=|v_#memory_int_93|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_33|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_33|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_24|, #memory_int=|v_#memory_int_93|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_33|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] [2022-12-13 03:48:51,721 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L54-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_3 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~x3~0=v_~x3~0_In_3, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [390] L38-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_Out_2| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_2| 0) (not (< (mod v_~x1~0_In_1 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x1~0=v_~x1~0_In_1} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_2|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_2|, ~n~0=v_~n~0_In_1, ~x1~0=v_~x1~0_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-13 03:48:51,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L54-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_3 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~x3~0=v_~x3~0_In_3, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [321] L87-2-->L88-1: Formula: (= (select (select |v_#memory_int_25| |v_ULTIMATE.start_main_~#t3~0#1.base_11|) |v_ULTIMATE.start_main_~#t3~0#1.offset_11|) |v_ULTIMATE.start_main_#t~mem16#1_10|) InVars {ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_11|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_11|} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_8|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_11|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_10|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~mem16#1] [2022-12-13 03:48:51,866 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L54-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_3 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~x3~0=v_~x3~0_In_3, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [330] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_14 4294967296) (mod v_~n~0_19 4294967296)) (= v_~x1~0_13 (* v_~x1~0_14 2))) InVars {~n~0=v_~n~0_19, ~x1~0=v_~x1~0_14} OutVars{~n~0=v_~n~0_19, ~x1~0=v_~x1~0_13} AuxVars[] AssignedVars[~x1~0] [2022-12-13 03:48:51,920 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L54-1-->thread3EXIT: Formula: (and (not (< (mod v_~x3~0_In_3 4294967296) (mod v_~n~0_In_3 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~x3~0=v_~x3~0_In_3, ~n~0=v_~n~0_In_3} OutVars{~x3~0=v_~x3~0_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~n~0=v_~n~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [336] L86-2-->L87-1: Formula: (= (select (select |v_#memory_int_49| |v_ULTIMATE.start_main_~#t2~0#1.base_17|) |v_ULTIMATE.start_main_~#t2~0#1.offset_17|) |v_ULTIMATE.start_main_#t~mem15#1_12|) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_17|, #memory_int=|v_#memory_int_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_10|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_12|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_17|, #memory_int=|v_#memory_int_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~mem15#1] [2022-12-13 03:48:52,001 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:48:52,006 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 543 [2022-12-13 03:48:52,007 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 1871 transitions, 42452 flow [2022-12-13 03:48:52,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 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-13 03:48:52,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:48:52,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:48:52,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 03:48:52,207 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,SelfDestructingSolverStorable9 [2022-12-13 03:48:52,208 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:48:52,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:48:52,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2016723801, now seen corresponding path program 1 times [2022-12-13 03:48:52,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:48:52,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098284770] [2022-12-13 03:48:52,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:48:52,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:48:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:48:52,835 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-13 03:48:52,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:48:52,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098284770] [2022-12-13 03:48:52,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098284770] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:48:52,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645997472] [2022-12-13 03:48:52,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:48:52,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:48:52,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:48:52,856 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-13 03:48:52,904 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-13 03:48:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:48:53,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 03:48:53,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:49:04,118 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-13 03:49:04,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:49:07,472 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-13 03:49:07,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645997472] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:49:07,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:49:07,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 03:49:07,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664552189] [2022-12-13 03:49:07,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:49:07,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 03:49:07,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:49:07,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 03:49:07,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=193, Unknown=1, NotChecked=0, Total=272 [2022-12-13 03:49:07,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:49:07,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 1871 transitions, 42452 flow. Second operand has 17 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 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-13 03:49:07,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:49:07,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:49:07,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:49:10,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:15,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:17,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:19,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:21,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:23,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:30,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:32,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:35,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:38,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:42,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:46,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:48,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:50,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:52,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:49:56,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:50:05,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:50:07,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:50:09,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:50:12,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:50:15,779 INFO L130 PetriNetUnfolder]: 8358/12024 cut-off events. [2022-12-13 03:50:15,780 INFO L131 PetriNetUnfolder]: For 1958/1958 co-relation queries the response was YES. [2022-12-13 03:50:15,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145552 conditions, 12024 events. 8358/12024 cut-off events. For 1958/1958 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 65263 event pairs, 94 based on Foata normal form. 2/8101 useless extension candidates. Maximal degree in co-relation 136953. Up to 11950 conditions per place. [2022-12-13 03:50:15,920 INFO L137 encePairwiseOnDemand]: 32/42 looper letters, 1977 selfloop transitions, 132 changer transitions 22/2131 dead transitions. [2022-12-13 03:50:15,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 2131 transitions, 52623 flow [2022-12-13 03:50:15,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 03:50:15,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 03:50:15,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 240 transitions. [2022-12-13 03:50:15,923 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-13 03:50:15,923 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 87 predicate places. [2022-12-13 03:50:15,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 2131 transitions, 52623 flow [2022-12-13 03:50:16,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 2109 transitions, 52054 flow [2022-12-13 03:50:16,098 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:50:16,099 INFO L89 Accepts]: Start accepts. Operand has 121 places, 2109 transitions, 52054 flow [2022-12-13 03:50:16,107 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:50:16,107 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:50:16,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 2109 transitions, 52054 flow [2022-12-13 03:50:16,228 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 2109 transitions, 52054 flow [2022-12-13 03:50:16,228 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:50:16,252 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:50:16,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-13 03:50:16,253 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 2109 transitions, 52054 flow [2022-12-13 03:50:16,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 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-13 03:50:16,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:50:16,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:50:16,264 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-13 03:50:16,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:50:16,465 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:50:16,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:50:16,466 INFO L85 PathProgramCache]: Analyzing trace with hash 11493816, now seen corresponding path program 1 times [2022-12-13 03:50:16,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:50:16,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763296047] [2022-12-13 03:50:16,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:50:16,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:50:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:50:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 03:50:16,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:50:16,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763296047] [2022-12-13 03:50:16,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763296047] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:50:16,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126074733] [2022-12-13 03:50:16,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:50:16,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:50:16,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:50:16,587 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-13 03:50:16,589 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-13 03:50:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:50:16,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 03:50:16,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:50:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 03:50:16,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 03:50:16,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126074733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:50:16,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 03:50:16,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-13 03:50:16,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314524747] [2022-12-13 03:50:16,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:50:16,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:50:16,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:50:16,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:50:16,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:50:16,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 03:50:16,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 2109 transitions, 52054 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:50:16,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:50:16,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 03:50:16,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:50:20,048 INFO L130 PetriNetUnfolder]: 7358/10670 cut-off events. [2022-12-13 03:50:20,049 INFO L131 PetriNetUnfolder]: For 1692/1692 co-relation queries the response was YES. [2022-12-13 03:50:20,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139833 conditions, 10670 events. 7358/10670 cut-off events. For 1692/1692 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 57967 event pairs, 170 based on Foata normal form. 2/7467 useless extension candidates. Maximal degree in co-relation 131924. Up to 10596 conditions per place. [2022-12-13 03:50:20,123 INFO L137 encePairwiseOnDemand]: 28/41 looper letters, 2002 selfloop transitions, 195 changer transitions 92/2289 dead transitions. [2022-12-13 03:50:20,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 2289 transitions, 60853 flow [2022-12-13 03:50:20,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:50:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:50:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-13 03:50:20,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5548780487804879 [2022-12-13 03:50:20,125 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 90 predicate places. [2022-12-13 03:50:20,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 2289 transitions, 60853 flow [2022-12-13 03:50:20,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 2197 transitions, 58419 flow [2022-12-13 03:50:20,284 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:50:20,284 INFO L89 Accepts]: Start accepts. Operand has 123 places, 2197 transitions, 58419 flow [2022-12-13 03:50:20,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:50:20,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:50:20,293 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 2197 transitions, 58419 flow [2022-12-13 03:50:20,321 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 2197 transitions, 58419 flow [2022-12-13 03:50:20,321 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:50:20,339 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.base_Out_2| 0) (not (< (mod v_~x4~0_In_3 4294967296) (mod v_~n~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_3} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_2|, ~x4~0=v_~x4~0_In_3, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [330] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_14 4294967296) (mod v_~n~0_19 4294967296)) (= v_~x1~0_13 (* v_~x1~0_14 2))) InVars {~n~0=v_~n~0_19, ~x1~0=v_~x1~0_14} OutVars{~n~0=v_~n~0_19, ~x1~0=v_~x1~0_13} AuxVars[] AssignedVars[~x1~0] [2022-12-13 03:50:20,391 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L62-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.base_Out_2| 0) (not (< (mod v_~x4~0_In_3 4294967296) (mod v_~n~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_3} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_2|, ~x4~0=v_~x4~0_In_3, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [319] L46-1-->L46-1: Formula: (and (= (* v_~x2~0_12 2) v_~x2~0_11) (< (mod v_~x2~0_12 4294967296) (mod v_~n~0_11 4294967296))) InVars {~x2~0=v_~x2~0_12, ~n~0=v_~n~0_11} OutVars{~x2~0=v_~x2~0_11, ~n~0=v_~n~0_11} AuxVars[] AssignedVars[~x2~0] [2022-12-13 03:50:20,442 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:50:20,442 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-13 03:50:20,442 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 2197 transitions, 58423 flow [2022-12-13 03:50:20,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:50:20,442 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:50:20,442 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:50:20,451 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-13 03:50:20,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:50:20,647 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:50:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:50:20,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1287299241, now seen corresponding path program 2 times [2022-12-13 03:50:20,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:50:20,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688708366] [2022-12-13 03:50:20,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:50:20,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:50:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:50:20,943 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-13 03:50:20,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:50:20,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688708366] [2022-12-13 03:50:20,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688708366] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:50:20,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142827585] [2022-12-13 03:50:20,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 03:50:20,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:50:20,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:50:20,952 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-13 03:50:20,954 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-13 03:50:22,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 03:50:22,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:50:22,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 03:50:22,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:50:38,007 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-13 03:50:38,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:51:17,979 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-13 03:51:17,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142827585] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:51:17,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:51:17,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 03:51:17,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959881737] [2022-12-13 03:51:17,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:51:17,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:51:17,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:51:17,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:51:17,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=159, Unknown=7, NotChecked=0, Total=240 [2022-12-13 03:51:17,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 03:51:17,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 2197 transitions, 58423 flow. Second operand has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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-13 03:51:17,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:51:17,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 03:51:17,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:51:20,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:22,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:25,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:27,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:29,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:32,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:35,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:37,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:39,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:41,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:43,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:45,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:47,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:49,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:54,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:56,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:51:58,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:52:00,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:52:02,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:52:04,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:52:21,516 WARN L233 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 57 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 03:52:23,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:52:25,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:52:31,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:52:33,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:52:35,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:52:37,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:52:39,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:52:41,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:52:43,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:52:58,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:00,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:02,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:04,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:06,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:08,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:10,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:16,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:18,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:21,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:23,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:25,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:27,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:29,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:30,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:32,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:34,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:37,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:39,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:53:41,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:04,892 WARN L233 SmtUtils]: Spent 21.03s on a formula simplification. DAG size of input: 71 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 03:54:06,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:07,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:09,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:10,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:13,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:15,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:17,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:19,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:21,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:23,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:25,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:27,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:29,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:31,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:37,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:40,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:42,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:44,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:46,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:48,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:50,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:52,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:54,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:55,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:54:59,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:55:02,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:55:04,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:55:06,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:55:10,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:55:13,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:55:15,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:55:18,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:55:21,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:55:23,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 03:55:26,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 03:55:27,329 INFO L130 PetriNetUnfolder]: 11035/16159 cut-off events. [2022-12-13 03:55:27,329 INFO L131 PetriNetUnfolder]: For 2364/2364 co-relation queries the response was YES. [2022-12-13 03:55:27,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228024 conditions, 16159 events. 11035/16159 cut-off events. For 2364/2364 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 95645 event pairs, 52 based on Foata normal form. 8/11488 useless extension candidates. Maximal degree in co-relation 212910. Up to 16085 conditions per place. [2022-12-13 03:55:27,439 INFO L137 encePairwiseOnDemand]: 17/40 looper letters, 2832 selfloop transitions, 636 changer transitions 14/3482 dead transitions. [2022-12-13 03:55:27,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 3482 transitions, 99692 flow [2022-12-13 03:55:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 03:55:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 03:55:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 296 transitions. [2022-12-13 03:55:27,442 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37 [2022-12-13 03:55:27,443 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 108 predicate places. [2022-12-13 03:55:27,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 3482 transitions, 99692 flow [2022-12-13 03:55:27,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 3468 transitions, 99276 flow [2022-12-13 03:55:27,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:55:27,753 INFO L89 Accepts]: Start accepts. Operand has 141 places, 3468 transitions, 99276 flow [2022-12-13 03:55:27,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:55:27,774 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:55:27,774 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 3468 transitions, 99276 flow [2022-12-13 03:55:27,848 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 3468 transitions, 99276 flow [2022-12-13 03:55:27,848 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:55:27,855 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:55:27,856 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 03:55:27,856 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 3468 transitions, 99276 flow [2022-12-13 03:55:27,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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-13 03:55:27,856 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:55:27,856 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:55:27,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 03:55:28,067 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,SelfDestructingSolverStorable12 [2022-12-13 03:55:28,068 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:55:28,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:55:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1075865852, now seen corresponding path program 1 times [2022-12-13 03:55:28,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:55:28,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570388537] [2022-12-13 03:55:28,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:55:28,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:55:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:55:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 03:55:28,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:55:28,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570388537] [2022-12-13 03:55:28,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570388537] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:55:28,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184766573] [2022-12-13 03:55:28,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:55:28,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:55:28,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:55:28,177 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-13 03:55:28,179 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-13 03:55:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:55:28,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 03:55:28,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:55:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 03:55:28,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 03:55:28,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184766573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:55:28,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 03:55:28,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-13 03:55:28,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616661994] [2022-12-13 03:55:28,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:55:28,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:55:28,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:55:28,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:55:28,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:55:28,326 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 03:55:28,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 3468 transitions, 99276 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:55:28,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:55:28,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 03:55:28,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:55:36,483 INFO L130 PetriNetUnfolder]: 10467/15290 cut-off events. [2022-12-13 03:55:36,483 INFO L131 PetriNetUnfolder]: For 2193/2193 co-relation queries the response was YES. [2022-12-13 03:55:36,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231025 conditions, 15290 events. 10467/15290 cut-off events. For 2193/2193 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 89277 event pairs, 40 based on Foata normal form. 0/10962 useless extension candidates. Maximal degree in co-relation 216238. Up to 15216 conditions per place. [2022-12-13 03:55:36,685 INFO L137 encePairwiseOnDemand]: 30/40 looper letters, 3129 selfloop transitions, 174 changer transitions 0/3303 dead transitions. [2022-12-13 03:55:36,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 3303 transitions, 101079 flow [2022-12-13 03:55:36,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:55:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:55:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 03:55:36,686 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-13 03:55:36,686 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 110 predicate places. [2022-12-13 03:55:36,687 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 3303 transitions, 101079 flow [2022-12-13 03:55:36,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 3303 transitions, 101079 flow [2022-12-13 03:55:36,926 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:55:36,926 INFO L89 Accepts]: Start accepts. Operand has 144 places, 3303 transitions, 101079 flow [2022-12-13 03:55:36,949 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:55:36,949 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:55:36,949 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 3303 transitions, 101079 flow [2022-12-13 03:55:37,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 3303 transitions, 101079 flow [2022-12-13 03:55:37,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:55:37,020 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:55:37,021 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 03:55:37,021 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 3303 transitions, 101079 flow [2022-12-13 03:55:37,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:55:37,021 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:55:37,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:55:37,027 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-13 03:55:37,228 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,SelfDestructingSolverStorable13 [2022-12-13 03:55:37,228 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:55:37,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:55:37,229 INFO L85 PathProgramCache]: Analyzing trace with hash 468863912, now seen corresponding path program 1 times [2022-12-13 03:55:37,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:55:37,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542329650] [2022-12-13 03:55:37,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:55:37,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:55:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:55:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 03:55:37,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:55:37,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542329650] [2022-12-13 03:55:37,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542329650] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:55:37,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389159305] [2022-12-13 03:55:37,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:55:37,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:55:37,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:55:37,376 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-13 03:55:37,394 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-13 03:55:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:55:37,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 03:55:37,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:55:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 03:55:37,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 03:55:37,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389159305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:55:37,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 03:55:37,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-13 03:55:37,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575461652] [2022-12-13 03:55:37,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:55:37,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:55:37,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:55:37,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:55:37,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:55:37,551 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 03:55:37,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 3303 transitions, 101079 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-13 03:55:37,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:55:37,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 03:55:37,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:55:45,605 INFO L130 PetriNetUnfolder]: 9461/13920 cut-off events. [2022-12-13 03:55:45,605 INFO L131 PetriNetUnfolder]: For 2066/2066 co-relation queries the response was YES. [2022-12-13 03:55:45,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224312 conditions, 13920 events. 9461/13920 cut-off events. For 2066/2066 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 81070 event pairs, 51 based on Foata normal form. 40/10310 useless extension candidates. Maximal degree in co-relation 209958. Up to 13846 conditions per place. [2022-12-13 03:55:45,707 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 3165 selfloop transitions, 121 changer transitions 128/3414 dead transitions. [2022-12-13 03:55:45,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 3414 transitions, 111342 flow [2022-12-13 03:55:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:55:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:55:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-13 03:55:45,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.435 [2022-12-13 03:55:45,708 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 114 predicate places. [2022-12-13 03:55:45,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 3414 transitions, 111342 flow [2022-12-13 03:55:45,823 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 3286 transitions, 107126 flow [2022-12-13 03:55:45,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:55:45,900 INFO L89 Accepts]: Start accepts. Operand has 148 places, 3286 transitions, 107126 flow [2022-12-13 03:55:45,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:55:45,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:55:45,921 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 3286 transitions, 107126 flow [2022-12-13 03:55:45,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 3286 transitions, 107126 flow [2022-12-13 03:55:45,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:55:45,988 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:55:45,989 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-13 03:55:45,989 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 3286 transitions, 107126 flow [2022-12-13 03:55:45,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-13 03:55:45,989 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:55:45,989 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:55:45,994 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-13 03:55:46,194 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,SelfDestructingSolverStorable14 [2022-12-13 03:55:46,194 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:55:46,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:55:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash 87150158, now seen corresponding path program 1 times [2022-12-13 03:55:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:55:46,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425972336] [2022-12-13 03:55:46,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:55:46,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:55:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:55:46,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 03:55:46,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:55:46,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425972336] [2022-12-13 03:55:46,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425972336] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:55:46,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760877368] [2022-12-13 03:55:46,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:55:46,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:55:46,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:55:46,286 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-13 03:55:46,289 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-13 03:55:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:55:46,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 03:55:46,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:55:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 03:55:46,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:55:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 03:55:46,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760877368] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:55:46,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:55:46,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-12-13 03:55:46,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553219767] [2022-12-13 03:55:46,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:55:46,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:55:46,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:55:46,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:55:46,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:55:46,520 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 03:55:46,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 3286 transitions, 107126 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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-13 03:55:46,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:55:46,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 03:55:46,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:55:54,893 INFO L130 PetriNetUnfolder]: 9040/13192 cut-off events. [2022-12-13 03:55:54,893 INFO L131 PetriNetUnfolder]: For 1871/1871 co-relation queries the response was YES. [2022-12-13 03:55:54,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225731 conditions, 13192 events. 9040/13192 cut-off events. For 1871/1871 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 74805 event pairs, 26 based on Foata normal form. 0/9857 useless extension candidates. Maximal degree in co-relation 212421. Up to 13118 conditions per place. [2022-12-13 03:55:55,076 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 3236 selfloop transitions, 178 changer transitions 0/3414 dead transitions. [2022-12-13 03:55:55,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 3414 transitions, 118098 flow [2022-12-13 03:55:55,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:55:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:55:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-13 03:55:55,080 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-13 03:55:55,082 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 119 predicate places. [2022-12-13 03:55:55,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 3414 transitions, 118098 flow [2022-12-13 03:55:55,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 3414 transitions, 118098 flow [2022-12-13 03:55:55,410 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:55:55,410 INFO L89 Accepts]: Start accepts. Operand has 153 places, 3414 transitions, 118098 flow [2022-12-13 03:55:55,445 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:55:55,446 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:55:55,446 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 3414 transitions, 118098 flow [2022-12-13 03:55:55,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 3414 transitions, 118098 flow [2022-12-13 03:55:55,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:55:55,551 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:55:55,554 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 03:55:55,554 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 3414 transitions, 118098 flow [2022-12-13 03:55:55,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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-13 03:55:55,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:55:55,555 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:55:55,560 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-13 03:55:55,760 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,SelfDestructingSolverStorable15 [2022-12-13 03:55:55,761 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:55:55,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:55:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1936317630, now seen corresponding path program 3 times [2022-12-13 03:55:55,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:55:55,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386542300] [2022-12-13 03:55:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:55:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:55:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:55:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:55:55,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:55:55,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386542300] [2022-12-13 03:55:55,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386542300] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:55:55,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517279535] [2022-12-13 03:55:55,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 03:55:55,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:55:55,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:55:55,905 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-13 03:55:55,937 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-13 03:55:56,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 03:55:56,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 03:55:56,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 03:55:56,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:56:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:56:09,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-12-13 03:56:30,686 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 03:56:30,687 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-13 03:56:31,565 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 03:56:31,579 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-13 03:56:31,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2022-12-13 03:56:31,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 03:56:31,766 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. [2022-12-13 03:56:31,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 03:56:31,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 03:56:31,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 03:56:31,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 03:56:31,768 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:56:31,770 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:56:31,770 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:56:31,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:56:31 BasicIcfg [2022-12-13 03:56:31,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:56:31,772 INFO L158 Benchmark]: Toolchain (without parser) took 873134.83ms. Allocated memory was 200.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 176.1MB in the beginning and 676.6MB in the end (delta: -500.5MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-12-13 03:56:31,772 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 200.3MB. Free memory was 177.6MB in the beginning and 177.5MB in the end (delta: 145.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:56:31,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.97ms. Allocated memory is still 200.3MB. Free memory was 175.7MB in the beginning and 164.6MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 03:56:31,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.87ms. Allocated memory is still 200.3MB. Free memory was 164.6MB in the beginning and 163.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 03:56:31,772 INFO L158 Benchmark]: Boogie Preprocessor took 35.66ms. Allocated memory is still 200.3MB. Free memory was 163.1MB in the beginning and 161.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:56:31,773 INFO L158 Benchmark]: RCFGBuilder took 317.13ms. Allocated memory is still 200.3MB. Free memory was 161.5MB in the beginning and 147.4MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 03:56:31,773 INFO L158 Benchmark]: TraceAbstraction took 872524.80ms. Allocated memory was 200.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 145.8MB in the beginning and 676.6MB in the end (delta: -530.9MB). Peak memory consumption was 994.7MB. Max. memory is 8.0GB. [2022-12-13 03:56:31,774 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.12ms. Allocated memory is still 200.3MB. Free memory was 177.6MB in the beginning and 177.5MB in the end (delta: 145.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.97ms. Allocated memory is still 200.3MB. Free memory was 175.7MB in the beginning and 164.6MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.87ms. Allocated memory is still 200.3MB. Free memory was 164.6MB in the beginning and 163.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.66ms. Allocated memory is still 200.3MB. Free memory was 163.1MB in the beginning and 161.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 317.13ms. Allocated memory is still 200.3MB. Free memory was 161.5MB in the beginning and 147.4MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 872524.80ms. Allocated memory was 200.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 145.8MB in the beginning and 676.6MB in the end (delta: -530.9MB). Peak memory consumption was 994.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 105 PlacesBefore, 34 PlacesAfterwards, 102 TransitionsBefore, 25 TransitionsAfterwards, 1224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 29 ConcurrentYvCompositions, 6 ChoiceCompositions, 77 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 615, independent: 615, independent conditional: 615, 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: 615, independent: 615, independent conditional: 0, independent unconditional: 615, 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: 615, independent: 615, independent conditional: 0, independent unconditional: 615, 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: 615, independent: 615, independent conditional: 0, independent unconditional: 615, 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: 615, independent: 615, independent conditional: 0, independent unconditional: 615, 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: 615, independent: 615, independent conditional: 0, independent unconditional: 615, 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: 615, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 615, unknown conditional: 0, unknown unconditional: 615] , Statistics on independence cache: Total cache size (in pairs): 1005, Positive cache size: 1005, Positive conditional cache size: 0, Positive unconditional cache size: 1005, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 113 TransitionsBefore, 113 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, 52 PlacesBefore, 52 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, 55 PlacesBefore, 55 PlacesAfterwards, 280 TransitionsBefore, 280 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, 58 PlacesBefore, 58 PlacesAfterwards, 316 TransitionsBefore, 316 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, 72 PlacesBefore, 72 PlacesAfterwards, 680 TransitionsBefore, 680 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.3s, 88 PlacesBefore, 88 PlacesAfterwards, 1030 TransitionsBefore, 1030 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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.4s, 106 PlacesBefore, 106 PlacesAfterwards, 1871 TransitionsBefore, 1871 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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, 121 PlacesBefore, 121 PlacesAfterwards, 2109 TransitionsBefore, 2109 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.1s, 123 PlacesBefore, 123 PlacesAfterwards, 2197 TransitionsBefore, 2197 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, 141 PlacesBefore, 141 PlacesAfterwards, 3468 TransitionsBefore, 3468 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, 144 PlacesBefore, 144 PlacesAfterwards, 3303 TransitionsBefore, 3303 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, 148 PlacesBefore, 148 PlacesAfterwards, 3286 TransitionsBefore, 3286 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, 153 PlacesBefore, 153 PlacesAfterwards, 3414 TransitionsBefore, 3414 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: 92]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 85]: 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 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 82]: 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 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 84]: 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 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 83]: 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 25 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 133 locations, 5 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: 872.4s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 688.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 152 mSolverCounterUnknown, 1378 SdHoareTripleChecker+Valid, 452.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1378 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 449.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 72 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5581 IncrementalHoareTripleChecker+Invalid, 6002 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 197 mSolverCounterUnsat, 0 mSDtfsCounter, 5581 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 528 GetRequests, 359 SyntacticMatches, 11 SemanticMatches, 158 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 288.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118098occurred in iteration=16, InterpolantAutomatonStates: 138, 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.1s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 135.0s InterpolantComputationTime, 613 NumberOfCodeBlocks, 613 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 27431 SizeOfPredicates, 53 NumberOfNonLiveVariables, 2242 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 35 InterpolantComputations, 8 PerfectInterpolantSequences, 24/67 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