/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/goblint-regression/13-privatized_27-multiple-protecting2_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:40:22,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:40:22,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:40:22,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:40:22,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:40:22,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:40:22,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:40:22,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:40:22,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:40:22,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:40:22,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:40:22,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:40:22,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:40:22,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:40:22,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:40:22,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:40:22,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:40:22,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:40:22,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:40:22,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:40:22,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:40:22,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:40:22,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:40:22,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:40:22,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:40:22,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:40:22,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:40:22,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:40:22,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:40:22,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:40:22,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:40:22,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:40:22,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:40:22,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:40:22,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:40:22,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:40:22,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:40:22,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:40:22,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:40:22,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:40:22,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:40:22,184 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:40:22,207 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:40:22,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:40:22,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:40:22,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:40:22,209 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:40:22,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:40:22,210 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:40:22,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:40:22,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:40:22,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:40:22,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:40:22,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:40:22,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:40:22,236 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:40:22,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:40:22,236 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:40:22,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:40:22,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:40:22,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:40:22,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:40:22,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:40:22,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:40:22,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:40:22,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:40:22,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:40:22,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:40:22,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:40:22,238 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:40:22,238 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:40:22,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:40:22,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:40:22,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:40:22,531 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:40:22,536 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:40:22,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2022-12-13 03:40:23,503 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:40:23,700 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:40:23,701 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2022-12-13 03:40:23,729 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd5b89b5/ed0c3f72304040cea0d5de5a11e2011c/FLAGc207c8e1c [2022-12-13 03:40:23,742 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd5b89b5/ed0c3f72304040cea0d5de5a11e2011c [2022-12-13 03:40:23,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:40:23,744 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:40:23,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:40:23,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:40:23,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:40:23,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:40:23" (1/1) ... [2022-12-13 03:40:23,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3465efcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:23, skipping insertion in model container [2022-12-13 03:40:23,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:40:23" (1/1) ... [2022-12-13 03:40:23,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:40:23,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:40:23,937 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i[1097,1110] [2022-12-13 03:40:24,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:40:24,085 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:40:24,094 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i[1097,1110] [2022-12-13 03:40:24,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:40:24,142 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:40:24,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:24 WrapperNode [2022-12-13 03:40:24,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:40:24,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:40:24,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:40:24,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:40:24,149 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:40:24" (1/1) ... [2022-12-13 03:40:24,171 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:40:24" (1/1) ... [2022-12-13 03:40:24,192 INFO L138 Inliner]: procedures = 163, calls = 52, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 104 [2022-12-13 03:40:24,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:40:24,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:40:24,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:40:24,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:40:24,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:24" (1/1) ... [2022-12-13 03:40:24,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:24" (1/1) ... [2022-12-13 03:40:24,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:24" (1/1) ... [2022-12-13 03:40:24,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:24" (1/1) ... [2022-12-13 03:40:24,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:24" (1/1) ... [2022-12-13 03:40:24,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:24" (1/1) ... [2022-12-13 03:40:24,218 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:24" (1/1) ... [2022-12-13 03:40:24,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:24" (1/1) ... [2022-12-13 03:40:24,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:40:24,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:40:24,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:40:24,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:40:24,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:24" (1/1) ... [2022-12-13 03:40:24,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:40:24,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:40:24,250 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:40:24,268 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:40:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 03:40:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2022-12-13 03:40:24,282 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2022-12-13 03:40:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:40:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 03:40:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:40:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:40:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 03:40:24,282 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 03:40:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:40:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:40:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:40:24,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:40:24,284 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:40:24,449 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:40:24,451 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:40:24,697 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:40:24,714 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:40:24,714 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:40:24,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:40:24 BoogieIcfgContainer [2022-12-13 03:40:24,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:40:24,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:40:24,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:40:24,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:40:24,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:40:23" (1/3) ... [2022-12-13 03:40:24,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2eb5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:40:24, skipping insertion in model container [2022-12-13 03:40:24,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:40:24" (2/3) ... [2022-12-13 03:40:24,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2eb5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:40:24, skipping insertion in model container [2022-12-13 03:40:24,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:40:24" (3/3) ... [2022-12-13 03:40:24,722 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_27-multiple-protecting2_true.i [2022-12-13 03:40:24,735 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:40:24,736 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-13 03:40:24,736 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:40:24,806 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 03:40:24,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 147 transitions, 310 flow [2022-12-13 03:40:24,890 INFO L130 PetriNetUnfolder]: 4/145 cut-off events. [2022-12-13 03:40:24,890 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 03:40:24,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 145 events. 4/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 136 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 03:40:24,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 147 transitions, 310 flow [2022-12-13 03:40:24,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 127 transitions, 260 flow [2022-12-13 03:40:24,903 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:24,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 127 transitions, 260 flow [2022-12-13 03:40:24,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 127 transitions, 260 flow [2022-12-13 03:40:24,964 INFO L130 PetriNetUnfolder]: 3/127 cut-off events. [2022-12-13 03:40:24,964 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:40:24,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 127 events. 3/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-13 03:40:24,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 127 transitions, 260 flow [2022-12-13 03:40:24,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 4248 [2022-12-13 03:40:28,951 INFO L241 LiptonReduction]: Total number of compositions: 104 [2022-12-13 03:40:28,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:40:28,967 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;@23e64205, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:40:28,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 03:40:28,971 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-13 03:40:28,971 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:40:28,971 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:28,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:28,971 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 03:40:28,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:28,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2000737828, now seen corresponding path program 1 times [2022-12-13 03:40:28,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:28,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598513600] [2022-12-13 03:40:28,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:28,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:29,098 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:40:29,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:29,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598513600] [2022-12-13 03:40:29,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598513600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:29,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:29,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:40:29,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306379036] [2022-12-13 03:40:29,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:29,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 03:40:29,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:29,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 03:40:29,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 03:40:29,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2022-12-13 03:40:29,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 126 flow. Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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:40:29,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:29,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2022-12-13 03:40:29,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:29,699 INFO L130 PetriNetUnfolder]: 5260/8936 cut-off events. [2022-12-13 03:40:29,699 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-13 03:40:29,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17180 conditions, 8936 events. 5260/8936 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 60723 event pairs, 5260 based on Foata normal form. 0/5985 useless extension candidates. Maximal degree in co-relation 17170. Up to 8213 conditions per place. [2022-12-13 03:40:29,745 INFO L137 encePairwiseOnDemand]: 57/60 looper letters, 44 selfloop transitions, 0 changer transitions 0/57 dead transitions. [2022-12-13 03:40:29,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 208 flow [2022-12-13 03:40:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 03:40:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 03:40:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2022-12-13 03:40:29,754 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-13 03:40:29,758 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2022-12-13 03:40:29,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 57 transitions, 208 flow [2022-12-13 03:40:29,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 57 transitions, 208 flow [2022-12-13 03:40:29,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:29,818 INFO L89 Accepts]: Start accepts. Operand has 65 places, 57 transitions, 208 flow [2022-12-13 03:40:29,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:29,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:29,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 57 transitions, 208 flow [2022-12-13 03:40:29,826 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 57 transitions, 208 flow [2022-12-13 03:40:29,826 INFO L226 LiptonReduction]: Number of co-enabled transitions 832 [2022-12-13 03:40:30,041 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:40:30,042 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-13 03:40:30,042 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 208 flow [2022-12-13 03:40:30,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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:40:30,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:30,043 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:30,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:40:30,043 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 03:40:30,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:30,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2000748298, now seen corresponding path program 1 times [2022-12-13 03:40:30,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:30,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235418117] [2022-12-13 03:40:30,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:30,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:30,175 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:40:30,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:30,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235418117] [2022-12-13 03:40:30,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235418117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:30,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:30,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:40:30,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815001997] [2022-12-13 03:40:30,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:30,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:40:30,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:30,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:40:30,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:40:30,178 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 57 [2022-12-13 03:40:30,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:30,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:30,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 57 [2022-12-13 03:40:30,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:30,694 INFO L130 PetriNetUnfolder]: 5202/8963 cut-off events. [2022-12-13 03:40:30,694 INFO L131 PetriNetUnfolder]: For 749/946 co-relation queries the response was YES. [2022-12-13 03:40:30,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25128 conditions, 8963 events. 5202/8963 cut-off events. For 749/946 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 65022 event pairs, 1809 based on Foata normal form. 75/6278 useless extension candidates. Maximal degree in co-relation 25115. Up to 7975 conditions per place. [2022-12-13 03:40:30,732 INFO L137 encePairwiseOnDemand]: 51/57 looper letters, 69 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2022-12-13 03:40:30,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 463 flow [2022-12-13 03:40:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:40:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:40:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-12-13 03:40:30,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2022-12-13 03:40:30,736 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2022-12-13 03:40:30,736 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 84 transitions, 463 flow [2022-12-13 03:40:30,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 84 transitions, 463 flow [2022-12-13 03:40:30,788 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:30,788 INFO L89 Accepts]: Start accepts. Operand has 67 places, 84 transitions, 463 flow [2022-12-13 03:40:30,788 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:30,788 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:30,789 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 84 transitions, 463 flow [2022-12-13 03:40:30,793 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 84 transitions, 463 flow [2022-12-13 03:40:30,793 INFO L226 LiptonReduction]: Number of co-enabled transitions 932 [2022-12-13 03:40:31,120 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:40:31,122 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 334 [2022-12-13 03:40:31,122 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 84 transitions, 463 flow [2022-12-13 03:40:31,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:40:31,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:31,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:31,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:40:31,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 03:40:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash 96676387, now seen corresponding path program 1 times [2022-12-13 03:40:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:31,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527631703] [2022-12-13 03:40:31,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:31,300 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:40:31,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:31,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527631703] [2022-12-13 03:40:31,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527631703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:31,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:31,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:40:31,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720527634] [2022-12-13 03:40:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:31,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:40:31,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:31,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:40:31,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:40:31,302 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 58 [2022-12-13 03:40:31,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 84 transitions, 463 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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:40:31,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:31,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 58 [2022-12-13 03:40:31,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:31,797 INFO L130 PetriNetUnfolder]: 3374/6438 cut-off events. [2022-12-13 03:40:31,797 INFO L131 PetriNetUnfolder]: For 2536/2536 co-relation queries the response was YES. [2022-12-13 03:40:31,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23194 conditions, 6438 events. 3374/6438 cut-off events. For 2536/2536 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 46794 event pairs, 504 based on Foata normal form. 468/5303 useless extension candidates. Maximal degree in co-relation 23178. Up to 5139 conditions per place. [2022-12-13 03:40:31,818 INFO L137 encePairwiseOnDemand]: 47/58 looper letters, 142 selfloop transitions, 14 changer transitions 0/159 dead transitions. [2022-12-13 03:40:31,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 159 transitions, 1191 flow [2022-12-13 03:40:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:40:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:40:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-12-13 03:40:31,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2022-12-13 03:40:31,821 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 6 predicate places. [2022-12-13 03:40:31,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 159 transitions, 1191 flow [2022-12-13 03:40:31,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 159 transitions, 1191 flow [2022-12-13 03:40:31,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:31,855 INFO L89 Accepts]: Start accepts. Operand has 70 places, 159 transitions, 1191 flow [2022-12-13 03:40:31,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:31,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:31,857 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 159 transitions, 1191 flow [2022-12-13 03:40:31,860 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 159 transitions, 1191 flow [2022-12-13 03:40:31,860 INFO L226 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-13 03:40:31,862 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:40:31,863 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 03:40:31,863 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 159 transitions, 1191 flow [2022-12-13 03:40:31,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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:40:31,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:31,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:31,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:40:31,864 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 03:40:31,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1992084588, now seen corresponding path program 1 times [2022-12-13 03:40:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:31,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331969034] [2022-12-13 03:40:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:31,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:31,932 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:40:31,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:31,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331969034] [2022-12-13 03:40:31,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331969034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:31,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:31,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:40:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862043744] [2022-12-13 03:40:31,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:31,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:40:31,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:31,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:40:31,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:40:31,934 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 58 [2022-12-13 03:40:31,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 159 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:40:31,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:31,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 58 [2022-12-13 03:40:31,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:32,447 INFO L130 PetriNetUnfolder]: 3346/6382 cut-off events. [2022-12-13 03:40:32,448 INFO L131 PetriNetUnfolder]: For 3998/3998 co-relation queries the response was YES. [2022-12-13 03:40:32,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28077 conditions, 6382 events. 3346/6382 cut-off events. For 3998/3998 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 45119 event pairs, 486 based on Foata normal form. 0/4815 useless extension candidates. Maximal degree in co-relation 28058. Up to 5091 conditions per place. [2022-12-13 03:40:32,465 INFO L137 encePairwiseOnDemand]: 54/58 looper letters, 165 selfloop transitions, 9 changer transitions 0/197 dead transitions. [2022-12-13 03:40:32,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 197 transitions, 1843 flow [2022-12-13 03:40:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:40:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:40:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-12-13 03:40:32,468 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2022-12-13 03:40:32,469 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 8 predicate places. [2022-12-13 03:40:32,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 197 transitions, 1843 flow [2022-12-13 03:40:32,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 197 transitions, 1843 flow [2022-12-13 03:40:32,501 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:32,502 INFO L89 Accepts]: Start accepts. Operand has 72 places, 197 transitions, 1843 flow [2022-12-13 03:40:32,503 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:32,504 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:32,504 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 197 transitions, 1843 flow [2022-12-13 03:40:32,508 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 197 transitions, 1843 flow [2022-12-13 03:40:32,509 INFO L226 LiptonReduction]: Number of co-enabled transitions 250 [2022-12-13 03:40:32,510 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:40:32,517 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 03:40:32,517 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 197 transitions, 1843 flow [2022-12-13 03:40:32,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:40:32,520 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:32,522 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:32,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:40:32,522 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 03:40:32,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:32,522 INFO L85 PathProgramCache]: Analyzing trace with hash 879042060, now seen corresponding path program 1 times [2022-12-13 03:40:32,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:32,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047026898] [2022-12-13 03:40:32,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:32,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:32,637 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:40:32,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:32,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047026898] [2022-12-13 03:40:32,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047026898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:32,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:32,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:40:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030317526] [2022-12-13 03:40:32,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:32,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:40:32,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:32,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:40:32,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:40:32,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 58 [2022-12-13 03:40:32,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 197 transitions, 1843 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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:40:32,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:32,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 58 [2022-12-13 03:40:32,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:33,197 INFO L130 PetriNetUnfolder]: 2977/5912 cut-off events. [2022-12-13 03:40:33,198 INFO L131 PetriNetUnfolder]: For 6444/6464 co-relation queries the response was YES. [2022-12-13 03:40:33,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30473 conditions, 5912 events. 2977/5912 cut-off events. For 6444/6464 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 42734 event pairs, 441 based on Foata normal form. 254/4779 useless extension candidates. Maximal degree in co-relation 30451. Up to 4630 conditions per place. [2022-12-13 03:40:33,219 INFO L137 encePairwiseOnDemand]: 48/58 looper letters, 238 selfloop transitions, 14 changer transitions 6/280 dead transitions. [2022-12-13 03:40:33,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 280 transitions, 3198 flow [2022-12-13 03:40:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:40:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:40:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2022-12-13 03:40:33,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5890804597701149 [2022-12-13 03:40:33,223 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2022-12-13 03:40:33,223 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 280 transitions, 3198 flow [2022-12-13 03:40:33,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 274 transitions, 3126 flow [2022-12-13 03:40:33,320 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:33,320 INFO L89 Accepts]: Start accepts. Operand has 77 places, 274 transitions, 3126 flow [2022-12-13 03:40:33,322 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:33,322 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:33,322 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 274 transitions, 3126 flow [2022-12-13 03:40:33,328 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 274 transitions, 3126 flow [2022-12-13 03:40:33,328 INFO L226 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-13 03:40:33,330 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:40:33,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 03:40:33,332 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 274 transitions, 3126 flow [2022-12-13 03:40:33,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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:40:33,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:33,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:33,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:40:33,333 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 03:40:33,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash 388949754, now seen corresponding path program 1 times [2022-12-13 03:40:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:33,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067480875] [2022-12-13 03:40:33,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:33,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:33,464 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:40:33,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:33,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067480875] [2022-12-13 03:40:33,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067480875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:33,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:33,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:40:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339215442] [2022-12-13 03:40:33,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:33,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:40:33,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:33,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:40:33,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:40:33,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 58 [2022-12-13 03:40:33,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 274 transitions, 3126 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:40:33,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:33,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 58 [2022-12-13 03:40:33,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:34,017 INFO L130 PetriNetUnfolder]: 1835/4582 cut-off events. [2022-12-13 03:40:34,018 INFO L131 PetriNetUnfolder]: For 6345/6345 co-relation queries the response was YES. [2022-12-13 03:40:34,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27841 conditions, 4582 events. 1835/4582 cut-off events. For 6345/6345 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 37817 event pairs, 20 based on Foata normal form. 902/4422 useless extension candidates. Maximal degree in co-relation 27816. Up to 3514 conditions per place. [2022-12-13 03:40:34,030 INFO L137 encePairwiseOnDemand]: 29/58 looper letters, 220 selfloop transitions, 119 changer transitions 46/388 dead transitions. [2022-12-13 03:40:34,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 388 transitions, 5217 flow [2022-12-13 03:40:34,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:40:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:40:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-12-13 03:40:34,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2022-12-13 03:40:34,032 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 16 predicate places. [2022-12-13 03:40:34,032 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 388 transitions, 5217 flow [2022-12-13 03:40:34,042 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 342 transitions, 4575 flow [2022-12-13 03:40:34,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:34,060 INFO L89 Accepts]: Start accepts. Operand has 80 places, 342 transitions, 4575 flow [2022-12-13 03:40:34,061 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:34,061 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:34,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 342 transitions, 4575 flow [2022-12-13 03:40:34,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 342 transitions, 4575 flow [2022-12-13 03:40:34,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-13 03:40:34,071 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:40:34,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 03:40:34,071 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 342 transitions, 4575 flow [2022-12-13 03:40:34,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:40:34,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:34,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:34,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:40:34,072 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 03:40:34,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:34,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1712217262, now seen corresponding path program 1 times [2022-12-13 03:40:34,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:34,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592386415] [2022-12-13 03:40:34,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:34,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:34,229 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:40:34,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:34,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592386415] [2022-12-13 03:40:34,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592386415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:34,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:34,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:40:34,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070396612] [2022-12-13 03:40:34,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:34,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:40:34,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:34,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:40:34,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:40:34,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 58 [2022-12-13 03:40:34,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 342 transitions, 4575 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:40:34,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:34,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 58 [2022-12-13 03:40:34,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:34,449 INFO L130 PetriNetUnfolder]: 399/1401 cut-off events. [2022-12-13 03:40:34,450 INFO L131 PetriNetUnfolder]: For 2358/2358 co-relation queries the response was YES. [2022-12-13 03:40:34,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9903 conditions, 1401 events. 399/1401 cut-off events. For 2358/2358 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10385 event pairs, 2 based on Foata normal form. 165/1342 useless extension candidates. Maximal degree in co-relation 9875. Up to 1264 conditions per place. [2022-12-13 03:40:34,454 INFO L137 encePairwiseOnDemand]: 51/58 looper letters, 147 selfloop transitions, 26 changer transitions 73/247 dead transitions. [2022-12-13 03:40:34,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 247 transitions, 3717 flow [2022-12-13 03:40:34,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:40:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:40:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-13 03:40:34,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35344827586206895 [2022-12-13 03:40:34,456 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 16 predicate places. [2022-12-13 03:40:34,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 247 transitions, 3717 flow [2022-12-13 03:40:34,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 174 transitions, 2653 flow [2022-12-13 03:40:34,468 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:34,468 INFO L89 Accepts]: Start accepts. Operand has 60 places, 174 transitions, 2653 flow [2022-12-13 03:40:34,469 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:34,469 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:34,470 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 174 transitions, 2653 flow [2022-12-13 03:40:34,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 174 transitions, 2653 flow [2022-12-13 03:40:34,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-13 03:40:34,474 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:40:34,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 03:40:34,474 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 174 transitions, 2653 flow [2022-12-13 03:40:34,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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:40:34,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:34,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:34,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:40:34,475 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 03:40:34,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:34,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2040045793, now seen corresponding path program 1 times [2022-12-13 03:40:34,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:34,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533276425] [2022-12-13 03:40:34,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:34,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:34,586 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:40:34,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:34,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533276425] [2022-12-13 03:40:34,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533276425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:34,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:34,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:40:34,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810894744] [2022-12-13 03:40:34,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:34,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:40:34,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:34,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:40:34,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:40:34,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 03:40:34,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 174 transitions, 2653 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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:40:34,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:34,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 03:40:34,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:34,737 INFO L130 PetriNetUnfolder]: 178/720 cut-off events. [2022-12-13 03:40:34,737 INFO L131 PetriNetUnfolder]: For 1020/1020 co-relation queries the response was YES. [2022-12-13 03:40:34,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5931 conditions, 720 events. 178/720 cut-off events. For 1020/1020 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4572 event pairs, 0 based on Foata normal form. 48/725 useless extension candidates. Maximal degree in co-relation 5900. Up to 621 conditions per place. [2022-12-13 03:40:34,741 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 161 selfloop transitions, 33 changer transitions 6/201 dead transitions. [2022-12-13 03:40:34,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 201 transitions, 3477 flow [2022-12-13 03:40:34,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:40:34,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:40:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-13 03:40:34,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2022-12-13 03:40:34,743 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -1 predicate places. [2022-12-13 03:40:34,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 201 transitions, 3477 flow [2022-12-13 03:40:34,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 195 transitions, 3369 flow [2022-12-13 03:40:34,754 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:40:34,754 INFO L89 Accepts]: Start accepts. Operand has 63 places, 195 transitions, 3369 flow [2022-12-13 03:40:34,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:40:34,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:34,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 195 transitions, 3369 flow [2022-12-13 03:40:34,761 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 195 transitions, 3369 flow [2022-12-13 03:40:34,761 INFO L226 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-13 03:40:34,762 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:40:34,763 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 03:40:34,763 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 195 transitions, 3369 flow [2022-12-13 03:40:34,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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:40:34,763 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:40:34,763 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:40:34,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:40:34,763 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-12-13 03:40:34,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:40:34,764 INFO L85 PathProgramCache]: Analyzing trace with hash -832186859, now seen corresponding path program 1 times [2022-12-13 03:40:34,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:40:34,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211581534] [2022-12-13 03:40:34,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:40:34,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:40:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:40:34,855 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:40:34,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:40:34,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211581534] [2022-12-13 03:40:34,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211581534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:40:34,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:40:34,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:40:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476410588] [2022-12-13 03:40:34,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:40:34,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:40:34,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:40:34,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:40:34,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:40:34,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 03:40:34,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 195 transitions, 3369 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:40:34,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:40:34,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 03:40:34,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:40:35,018 INFO L130 PetriNetUnfolder]: 178/680 cut-off events. [2022-12-13 03:40:35,018 INFO L131 PetriNetUnfolder]: For 1445/1445 co-relation queries the response was YES. [2022-12-13 03:40:35,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6127 conditions, 680 events. 178/680 cut-off events. For 1445/1445 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4186 event pairs, 0 based on Foata normal form. 24/661 useless extension candidates. Maximal degree in co-relation 6093. Up to 581 conditions per place. [2022-12-13 03:40:35,020 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 0 selfloop transitions, 0 changer transitions 212/212 dead transitions. [2022-12-13 03:40:35,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 212 transitions, 4059 flow [2022-12-13 03:40:35,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:40:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:40:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 03:40:35,021 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2022-12-13 03:40:35,022 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2022-12-13 03:40:35,022 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 212 transitions, 4059 flow [2022-12-13 03:40:35,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 03:40:35,026 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:40:35,026 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:40:35,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:40:35,026 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:40:35,027 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:40:35,027 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 03:40:35,027 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 03:40:35,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:40:35,029 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 03:40:35,030 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 03:40:35,030 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-12-13 03:40:35,030 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-13 03:40:35,030 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 03:40:35,030 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2022-12-13 03:40:35,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:40:35,031 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:40:35,033 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:40:35,033 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:40:35,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:40:35 BasicIcfg [2022-12-13 03:40:35,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:40:35,036 INFO L158 Benchmark]: Toolchain (without parser) took 11291.83ms. Allocated memory was 216.0MB in the beginning and 911.2MB in the end (delta: 695.2MB). Free memory was 190.0MB in the beginning and 679.3MB in the end (delta: -489.3MB). Peak memory consumption was 206.5MB. Max. memory is 8.0GB. [2022-12-13 03:40:35,036 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 216.0MB. Free memory is still 192.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:40:35,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.12ms. Allocated memory is still 216.0MB. Free memory was 189.5MB in the beginning and 170.1MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-13 03:40:35,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.52ms. Allocated memory is still 216.0MB. Free memory was 169.6MB in the beginning and 167.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:40:35,037 INFO L158 Benchmark]: Boogie Preprocessor took 27.01ms. Allocated memory is still 216.0MB. Free memory was 167.5MB in the beginning and 165.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:40:35,037 INFO L158 Benchmark]: RCFGBuilder took 494.77ms. Allocated memory is still 216.0MB. Free memory was 165.9MB in the beginning and 148.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 03:40:35,037 INFO L158 Benchmark]: TraceAbstraction took 10318.51ms. Allocated memory was 216.0MB in the beginning and 911.2MB in the end (delta: 695.2MB). Free memory was 147.5MB in the beginning and 679.3MB in the end (delta: -531.7MB). Peak memory consumption was 164.5MB. Max. memory is 8.0GB. [2022-12-13 03:40:35,038 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.17ms. Allocated memory is still 216.0MB. Free memory is still 192.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 397.12ms. Allocated memory is still 216.0MB. Free memory was 189.5MB in the beginning and 170.1MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.52ms. Allocated memory is still 216.0MB. Free memory was 169.6MB in the beginning and 167.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.01ms. Allocated memory is still 216.0MB. Free memory was 167.5MB in the beginning and 165.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 494.77ms. Allocated memory is still 216.0MB. Free memory was 165.9MB in the beginning and 148.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 10318.51ms. Allocated memory was 216.0MB in the beginning and 911.2MB in the end (delta: 695.2MB). Free memory was 147.5MB in the beginning and 679.3MB in the end (delta: -531.7MB). Peak memory consumption was 164.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 131 PlacesBefore, 64 PlacesAfterwards, 127 TransitionsBefore, 60 TransitionsAfterwards, 4248 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 51 ConcurrentYvCompositions, 0 ChoiceCompositions, 104 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4856, independent: 4575, independent conditional: 4575, independent unconditional: 0, dependent: 281, dependent conditional: 281, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4856, independent: 4575, independent conditional: 0, independent unconditional: 4575, dependent: 281, dependent conditional: 0, dependent unconditional: 281, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4856, independent: 4575, independent conditional: 0, independent unconditional: 4575, dependent: 281, dependent conditional: 0, dependent unconditional: 281, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4856, independent: 4575, independent conditional: 0, independent unconditional: 4575, dependent: 281, dependent conditional: 0, dependent unconditional: 281, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3453, independent: 3341, independent conditional: 0, independent unconditional: 3341, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3453, independent: 3030, independent conditional: 0, independent unconditional: 3030, dependent: 423, dependent conditional: 0, dependent unconditional: 423, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 423, independent: 311, independent conditional: 0, independent unconditional: 311, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4856, independent: 1234, independent conditional: 0, independent unconditional: 1234, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 3453, unknown conditional: 0, unknown unconditional: 3453] , Statistics on independence cache: Total cache size (in pairs): 5789, Positive cache size: 5677, Positive conditional cache size: 0, Positive unconditional cache size: 5677, Negative cache size: 112, Negative conditional cache size: 0, Negative unconditional cache size: 112, 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.2s, 65 PlacesBefore, 65 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 832 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 117, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 117, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 117, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 78, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 78, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 117, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 78, unknown conditional: 0, unknown unconditional: 78] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, 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, 67 PlacesBefore, 67 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 932 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 290, independent: 243, independent conditional: 243, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 290, independent: 243, independent conditional: 160, independent unconditional: 83, dependent: 47, dependent conditional: 22, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 290, independent: 243, independent conditional: 16, independent unconditional: 227, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 290, independent: 243, independent conditional: 16, independent unconditional: 227, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, independent: 43, independent conditional: 2, independent unconditional: 41, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 50, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 27, independent conditional: 2, independent unconditional: 25, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 27, independent conditional: 2, independent unconditional: 25, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 290, independent: 200, independent conditional: 14, independent unconditional: 186, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 50, unknown conditional: 2, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 113, Positive conditional cache size: 2, Positive unconditional cache size: 111, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 166, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 159 TransitionsBefore, 159 TransitionsAfterwards, 234 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): 128, Positive cache size: 113, Positive conditional cache size: 2, Positive unconditional cache size: 111, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 72 PlacesBefore, 72 PlacesAfterwards, 197 TransitionsBefore, 197 TransitionsAfterwards, 250 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): 128, Positive cache size: 113, Positive conditional cache size: 2, Positive unconditional cache size: 111, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 77 PlacesBefore, 77 PlacesAfterwards, 274 TransitionsBefore, 274 TransitionsAfterwards, 244 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): 128, Positive cache size: 113, Positive conditional cache size: 2, Positive unconditional cache size: 111, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 342 TransitionsBefore, 342 TransitionsAfterwards, 278 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): 128, Positive cache size: 113, Positive conditional cache size: 2, Positive unconditional cache size: 111, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 174 TransitionsBefore, 174 TransitionsAfterwards, 120 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): 128, Positive cache size: 113, Positive conditional cache size: 2, Positive unconditional cache size: 111, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 195 TransitionsBefore, 195 TransitionsAfterwards, 122 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): 128, Positive cache size: 113, Positive conditional cache size: 2, Positive unconditional cache size: 111, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 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): 128, Positive cache size: 113, Positive conditional cache size: 2, Positive unconditional cache size: 111, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 184 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 496 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 987 IncrementalHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 5 mSDtfsCounter, 987 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4575occurred in iteration=6, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 03:40:35,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...