/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:14:47,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:14:47,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:14:47,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:14:47,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:14:47,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:14:47,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:14:47,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:14:47,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:14:47,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:14:47,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:14:47,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:14:47,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:14:47,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:14:47,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:14:47,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:14:47,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:14:47,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:14:47,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:14:47,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:14:47,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:14:47,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:14:47,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:14:47,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:14:47,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:14:47,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:14:47,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:14:47,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:14:47,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:14:47,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:14:47,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:14:47,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:14:47,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:14:47,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:14:47,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:14:47,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:14:47,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:14:47,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:14:47,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:14:47,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:14:47,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:14:47,621 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 01:14:47,647 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:14:47,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:14:47,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:14:47,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:14:47,649 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:14:47,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:14:47,649 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:14:47,650 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:14:47,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:14:47,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:14:47,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:14:47,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:14:47,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:14:47,651 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:14:47,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:14:47,651 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:14:47,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:14:47,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:14:47,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:14:47,651 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:14:47,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:14:47,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:14:47,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:14:47,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:14:47,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:14:47,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:14:47,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:14:47,652 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:14:47,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 01:14:47,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:14:47,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:14:47,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:14:47,971 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:14:47,974 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:14:47,975 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i [2022-12-13 01:14:48,989 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:14:49,261 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:14:49,262 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i [2022-12-13 01:14:49,271 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293b6159c/e7a4a89303ca48b783f10d8316092ae1/FLAG38c3a7c32 [2022-12-13 01:14:49,281 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293b6159c/e7a4a89303ca48b783f10d8316092ae1 [2022-12-13 01:14:49,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:14:49,283 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:14:49,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:14:49,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:14:49,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:14:49,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:14:49" (1/1) ... [2022-12-13 01:14:49,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d284cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:49, skipping insertion in model container [2022-12-13 01:14:49,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:14:49" (1/1) ... [2022-12-13 01:14:49,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:14:49,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:14:49,442 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_24-multiple-protecting_true.i[1096,1109] [2022-12-13 01:14:49,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:14:49,600 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:14:49,610 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_24-multiple-protecting_true.i[1096,1109] [2022-12-13 01:14:49,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:14:49,678 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:14:49,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:49 WrapperNode [2022-12-13 01:14:49,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:14:49,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:14:49,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:14:49,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:14:49,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:49" (1/1) ... [2022-12-13 01:14:49,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:49" (1/1) ... [2022-12-13 01:14:49,734 INFO L138 Inliner]: procedures = 162, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 90 [2022-12-13 01:14:49,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:14:49,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:14:49,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:14:49,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:14:49,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:49" (1/1) ... [2022-12-13 01:14:49,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:49" (1/1) ... [2022-12-13 01:14:49,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:49" (1/1) ... [2022-12-13 01:14:49,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:49" (1/1) ... [2022-12-13 01:14:49,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:49" (1/1) ... [2022-12-13 01:14:49,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:49" (1/1) ... [2022-12-13 01:14:49,758 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:49" (1/1) ... [2022-12-13 01:14:49,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:49" (1/1) ... [2022-12-13 01:14:49,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:14:49,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:14:49,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:14:49,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:14:49,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:49" (1/1) ... [2022-12-13 01:14:49,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:14:49,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:14:49,786 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 01:14:49,832 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 01:14:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:14:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:14:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 01:14:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:14:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:14:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 01:14:49,854 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 01:14:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:14:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:14:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:14:49,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:14:49,855 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 01:14:50,003 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:14:50,005 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:14:50,198 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:14:50,204 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:14:50,204 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 01:14:50,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:14:50 BoogieIcfgContainer [2022-12-13 01:14:50,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:14:50,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:14:50,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:14:50,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:14:50,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:14:49" (1/3) ... [2022-12-13 01:14:50,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5417028b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:14:50, skipping insertion in model container [2022-12-13 01:14:50,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:14:49" (2/3) ... [2022-12-13 01:14:50,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5417028b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:14:50, skipping insertion in model container [2022-12-13 01:14:50,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:14:50" (3/3) ... [2022-12-13 01:14:50,214 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_24-multiple-protecting_true.i [2022-12-13 01:14:50,246 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:14:50,246 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-13 01:14:50,246 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:14:50,314 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-13 01:14:50,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 131 transitions, 270 flow [2022-12-13 01:14:50,408 INFO L130 PetriNetUnfolder]: 4/130 cut-off events. [2022-12-13 01:14:50,408 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 01:14:50,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 130 events. 4/130 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 01:14:50,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 131 transitions, 270 flow [2022-12-13 01:14:50,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 117 transitions, 237 flow [2022-12-13 01:14:50,420 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:14:50,443 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 117 transitions, 237 flow [2022-12-13 01:14:50,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 117 transitions, 237 flow [2022-12-13 01:14:50,463 INFO L130 PetriNetUnfolder]: 3/117 cut-off events. [2022-12-13 01:14:50,467 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:14:50,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-12-13 01:14:50,470 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 117 transitions, 237 flow [2022-12-13 01:14:50,471 INFO L226 LiptonReduction]: Number of co-enabled transitions 3102 [2022-12-13 01:14:54,057 INFO L241 LiptonReduction]: Total number of compositions: 97 [2022-12-13 01:14:54,068 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:14:54,073 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;@39dd6672, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:14:54,073 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 01:14:54,076 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-13 01:14:54,076 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:14:54,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:14:54,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 01:14:54,077 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 01:14:54,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:14:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash 431882463, now seen corresponding path program 1 times [2022-12-13 01:14:54,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:14:54,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527420895] [2022-12-13 01:14:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:14:54,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:14:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:14:54,235 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 01:14:54,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:14:54,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527420895] [2022-12-13 01:14:54,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527420895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:14:54,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:14:54,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:14:54,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730270789] [2022-12-13 01:14:54,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:14:54,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 01:14:54,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:14:54,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 01:14:54,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 01:14:54,264 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2022-12-13 01:14:54,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 113 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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 01:14:54,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:14:54,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2022-12-13 01:14:54,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:14:54,430 INFO L130 PetriNetUnfolder]: 336/830 cut-off events. [2022-12-13 01:14:54,430 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:14:54,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 830 events. 336/830 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4562 event pairs, 336 based on Foata normal form. 25/609 useless extension candidates. Maximal degree in co-relation 1538. Up to 713 conditions per place. [2022-12-13 01:14:54,439 INFO L137 encePairwiseOnDemand]: 52/55 looper letters, 40 selfloop transitions, 0 changer transitions 0/52 dead transitions. [2022-12-13 01:14:54,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 187 flow [2022-12-13 01:14:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 01:14:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 01:14:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2022-12-13 01:14:54,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6090909090909091 [2022-12-13 01:14:54,449 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 113 flow. Second operand 2 states and 67 transitions. [2022-12-13 01:14:54,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 187 flow [2022-12-13 01:14:54,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:14:54,453 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 106 flow [2022-12-13 01:14:54,454 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-12-13 01:14:54,457 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2022-12-13 01:14:54,457 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:14:54,458 INFO L89 Accepts]: Start accepts. Operand has 56 places, 52 transitions, 106 flow [2022-12-13 01:14:54,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:14:54,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:14:54,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 52 transitions, 106 flow [2022-12-13 01:14:54,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 52 transitions, 106 flow [2022-12-13 01:14:54,467 INFO L130 PetriNetUnfolder]: 0/52 cut-off events. [2022-12-13 01:14:54,467 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:14:54,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 52 events. 0/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 105 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 01:14:54,469 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 52 transitions, 106 flow [2022-12-13 01:14:54,470 INFO L226 LiptonReduction]: Number of co-enabled transitions 1122 [2022-12-13 01:14:54,630 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:14:54,632 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-13 01:14:54,635 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 106 flow [2022-12-13 01:14:54,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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 01:14:54,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:14:54,635 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 01:14:54,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:14:54,636 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 01:14:54,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:14:54,637 INFO L85 PathProgramCache]: Analyzing trace with hash 431881581, now seen corresponding path program 1 times [2022-12-13 01:14:54,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:14:54,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985539271] [2022-12-13 01:14:54,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:14:54,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:14:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:14:54,740 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 01:14:54,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:14:54,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985539271] [2022-12-13 01:14:54,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985539271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:14:54,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:14:54,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 01:14:54,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967727147] [2022-12-13 01:14:54,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:14:54,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:14:54,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:14:54,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:14:54,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:14:54,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2022-12-13 01:14:54,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:14:54,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:14:54,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2022-12-13 01:14:54,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:14:54,833 INFO L130 PetriNetUnfolder]: 329/813 cut-off events. [2022-12-13 01:14:54,833 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:14:54,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519 conditions, 813 events. 329/813 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4454 event pairs, 109 based on Foata normal form. 6/582 useless extension candidates. Maximal degree in co-relation 1511. Up to 575 conditions per place. [2022-12-13 01:14:54,836 INFO L137 encePairwiseOnDemand]: 46/52 looper letters, 49 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2022-12-13 01:14:54,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 63 transitions, 232 flow [2022-12-13 01:14:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:14:54,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:14:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-12-13 01:14:54,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-13 01:14:54,837 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 106 flow. Second operand 3 states and 88 transitions. [2022-12-13 01:14:54,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 63 transitions, 232 flow [2022-12-13 01:14:54,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 232 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 01:14:54,839 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 121 flow [2022-12-13 01:14:54,839 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2022-12-13 01:14:54,840 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2022-12-13 01:14:54,840 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:14:54,840 INFO L89 Accepts]: Start accepts. Operand has 58 places, 52 transitions, 121 flow [2022-12-13 01:14:54,840 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:14:54,840 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:14:54,840 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 52 transitions, 121 flow [2022-12-13 01:14:54,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 121 flow [2022-12-13 01:14:54,844 INFO L130 PetriNetUnfolder]: 0/55 cut-off events. [2022-12-13 01:14:54,844 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:14:54,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 55 events. 0/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 162 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2022-12-13 01:14:54,845 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 52 transitions, 121 flow [2022-12-13 01:14:54,845 INFO L226 LiptonReduction]: Number of co-enabled transitions 1074 [2022-12-13 01:14:54,895 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:14:54,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 01:14:54,896 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 121 flow [2022-12-13 01:14:54,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:14:54,896 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:14:54,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:14:54,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:14:54,897 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 01:14:54,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:14:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1615793925, now seen corresponding path program 1 times [2022-12-13 01:14:54,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:14:54,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801313442] [2022-12-13 01:14:54,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:14:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:14:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:14:54,947 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 01:14:54,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:14:54,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801313442] [2022-12-13 01:14:54,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801313442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:14:54,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:14:54,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:14:54,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779309091] [2022-12-13 01:14:54,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:14:54,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:14:54,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:14:54,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:14:54,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:14:54,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 52 [2022-12-13 01:14:54,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:14:54,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:14:54,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 52 [2022-12-13 01:14:54,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:14:55,127 INFO L130 PetriNetUnfolder]: 583/1258 cut-off events. [2022-12-13 01:14:55,128 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-13 01:14:55,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2672 conditions, 1258 events. 583/1258 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6885 event pairs, 299 based on Foata normal form. 9/927 useless extension candidates. Maximal degree in co-relation 2661. Up to 957 conditions per place. [2022-12-13 01:14:55,133 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 80 selfloop transitions, 15 changer transitions 0/97 dead transitions. [2022-12-13 01:14:55,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 410 flow [2022-12-13 01:14:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:14:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:14:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2022-12-13 01:14:55,134 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 01:14:55,134 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 121 flow. Second operand 3 states and 104 transitions. [2022-12-13 01:14:55,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 410 flow [2022-12-13 01:14:55,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 97 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 01:14:55,138 INFO L231 Difference]: Finished difference. Result has 59 places, 64 transitions, 208 flow [2022-12-13 01:14:55,138 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=59, PETRI_TRANSITIONS=64} [2022-12-13 01:14:55,138 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2022-12-13 01:14:55,138 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:14:55,138 INFO L89 Accepts]: Start accepts. Operand has 59 places, 64 transitions, 208 flow [2022-12-13 01:14:55,139 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:14:55,139 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:14:55,139 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 64 transitions, 208 flow [2022-12-13 01:14:55,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 64 transitions, 208 flow [2022-12-13 01:14:55,154 INFO L130 PetriNetUnfolder]: 52/293 cut-off events. [2022-12-13 01:14:55,155 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 01:14:55,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 293 events. 52/293 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1686 event pairs, 32 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 475. Up to 110 conditions per place. [2022-12-13 01:14:55,156 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 64 transitions, 208 flow [2022-12-13 01:14:55,156 INFO L226 LiptonReduction]: Number of co-enabled transitions 1010 [2022-12-13 01:14:55,188 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:14:55,189 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 01:14:55,189 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 64 transitions, 208 flow [2022-12-13 01:14:55,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:14:55,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:14:55,189 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:14:55,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:14:55,189 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 01:14:55,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:14:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash -882444170, now seen corresponding path program 1 times [2022-12-13 01:14:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:14:55,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159221217] [2022-12-13 01:14:55,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:14:55,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:14:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:14:55,291 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 01:14:55,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:14:55,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159221217] [2022-12-13 01:14:55,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159221217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:14:55,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:14:55,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:14:55,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983119818] [2022-12-13 01:14:55,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:14:55,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:14:55,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:14:55,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:14:55,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:14:55,293 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 52 [2022-12-13 01:14:55,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 64 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:14:55,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:14:55,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 52 [2022-12-13 01:14:55,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:14:55,451 INFO L130 PetriNetUnfolder]: 348/810 cut-off events. [2022-12-13 01:14:55,452 INFO L131 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2022-12-13 01:14:55,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1986 conditions, 810 events. 348/810 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4430 event pairs, 64 based on Foata normal form. 16/601 useless extension candidates. Maximal degree in co-relation 1975. Up to 580 conditions per place. [2022-12-13 01:14:55,455 INFO L137 encePairwiseOnDemand]: 43/52 looper letters, 75 selfloop transitions, 11 changer transitions 3/91 dead transitions. [2022-12-13 01:14:55,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 91 transitions, 447 flow [2022-12-13 01:14:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:14:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:14:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-13 01:14:55,456 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4519230769230769 [2022-12-13 01:14:55,456 INFO L175 Difference]: Start difference. First operand has 59 places, 64 transitions, 208 flow. Second operand 4 states and 94 transitions. [2022-12-13 01:14:55,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 91 transitions, 447 flow [2022-12-13 01:14:55,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 91 transitions, 433 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 01:14:55,459 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 213 flow [2022-12-13 01:14:55,460 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2022-12-13 01:14:55,460 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2022-12-13 01:14:55,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:14:55,460 INFO L89 Accepts]: Start accepts. Operand has 62 places, 59 transitions, 213 flow [2022-12-13 01:14:55,461 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:14:55,461 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:14:55,461 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 59 transitions, 213 flow [2022-12-13 01:14:55,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 59 transitions, 213 flow [2022-12-13 01:14:55,471 INFO L130 PetriNetUnfolder]: 30/204 cut-off events. [2022-12-13 01:14:55,471 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 01:14:55,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 204 events. 30/204 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 955 event pairs, 18 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 376. Up to 79 conditions per place. [2022-12-13 01:14:55,472 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 59 transitions, 213 flow [2022-12-13 01:14:55,472 INFO L226 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-13 01:14:55,825 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 01:14:55,826 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 366 [2022-12-13 01:14:55,826 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 214 flow [2022-12-13 01:14:55,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:14:55,826 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:14:55,826 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:14:55,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:14:55,826 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 01:14:55,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:14:55,827 INFO L85 PathProgramCache]: Analyzing trace with hash 911526690, now seen corresponding path program 1 times [2022-12-13 01:14:55,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:14:55,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422584453] [2022-12-13 01:14:55,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:14:55,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:14:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:14:55,867 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 01:14:55,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:14:55,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422584453] [2022-12-13 01:14:55,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422584453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:14:55,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:14:55,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 01:14:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072932243] [2022-12-13 01:14:55,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:14:55,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:14:55,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:14:55,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:14:55,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:14:55,868 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2022-12-13 01:14:55,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 01:14:55,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:14:55,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2022-12-13 01:14:55,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:14:55,940 INFO L130 PetriNetUnfolder]: 195/519 cut-off events. [2022-12-13 01:14:55,940 INFO L131 PetriNetUnfolder]: For 185/191 co-relation queries the response was YES. [2022-12-13 01:14:55,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 519 events. 195/519 cut-off events. For 185/191 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2943 event pairs, 75 based on Foata normal form. 1/403 useless extension candidates. Maximal degree in co-relation 1362. Up to 310 conditions per place. [2022-12-13 01:14:55,942 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 48 selfloop transitions, 3 changer transitions 1/64 dead transitions. [2022-12-13 01:14:55,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 355 flow [2022-12-13 01:14:55,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:14:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:14:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-12-13 01:14:55,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2022-12-13 01:14:55,943 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 214 flow. Second operand 3 states and 74 transitions. [2022-12-13 01:14:55,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 355 flow [2022-12-13 01:14:55,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:14:55,945 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 222 flow [2022-12-13 01:14:55,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2022-12-13 01:14:55,946 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2022-12-13 01:14:55,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:14:55,946 INFO L89 Accepts]: Start accepts. Operand has 55 places, 52 transitions, 222 flow [2022-12-13 01:14:55,946 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:14:55,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:14:55,946 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 52 transitions, 222 flow [2022-12-13 01:14:55,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 222 flow [2022-12-13 01:14:55,956 INFO L130 PetriNetUnfolder]: 30/187 cut-off events. [2022-12-13 01:14:55,956 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 01:14:55,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 187 events. 30/187 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 955 event pairs, 18 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 383. Up to 87 conditions per place. [2022-12-13 01:14:55,957 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 222 flow [2022-12-13 01:14:55,957 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 01:14:56,028 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:14:56,029 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 01:14:56,029 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 222 flow [2022-12-13 01:14:56,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 01:14:56,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:14:56,029 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:14:56,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:14:56,030 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 01:14:56,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:14:56,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1557796787, now seen corresponding path program 1 times [2022-12-13 01:14:56,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:14:56,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412189494] [2022-12-13 01:14:56,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:14:56,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:14:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:14:56,113 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 01:14:56,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:14:56,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412189494] [2022-12-13 01:14:56,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412189494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:14:56,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:14:56,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:14:56,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007942738] [2022-12-13 01:14:56,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:14:56,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:14:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:14:56,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:14:56,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:14:56,114 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2022-12-13 01:14:56,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 01:14:56,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:14:56,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2022-12-13 01:14:56,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:14:56,172 INFO L130 PetriNetUnfolder]: 149/423 cut-off events. [2022-12-13 01:14:56,172 INFO L131 PetriNetUnfolder]: For 183/190 co-relation queries the response was YES. [2022-12-13 01:14:56,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 423 events. 149/423 cut-off events. For 183/190 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2238 event pairs, 129 based on Foata normal form. 58/390 useless extension candidates. Maximal degree in co-relation 1154. Up to 349 conditions per place. [2022-12-13 01:14:56,173 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 33 selfloop transitions, 5 changer transitions 1/50 dead transitions. [2022-12-13 01:14:56,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 290 flow [2022-12-13 01:14:56,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:14:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:14:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-13 01:14:56,174 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3953488372093023 [2022-12-13 01:14:56,174 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 222 flow. Second operand 4 states and 68 transitions. [2022-12-13 01:14:56,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 290 flow [2022-12-13 01:14:56,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 50 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 01:14:56,176 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 219 flow [2022-12-13 01:14:56,176 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2022-12-13 01:14:56,177 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2022-12-13 01:14:56,177 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:14:56,177 INFO L89 Accepts]: Start accepts. Operand has 54 places, 49 transitions, 219 flow [2022-12-13 01:14:56,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:14:56,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:14:56,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 49 transitions, 219 flow [2022-12-13 01:14:56,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 49 transitions, 219 flow [2022-12-13 01:14:56,188 INFO L130 PetriNetUnfolder]: 27/192 cut-off events. [2022-12-13 01:14:56,188 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-12-13 01:14:56,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 192 events. 27/192 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 973 event pairs, 18 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 396. Up to 91 conditions per place. [2022-12-13 01:14:56,189 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 49 transitions, 219 flow [2022-12-13 01:14:56,189 INFO L226 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-13 01:14:56,225 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:14:56,226 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 01:14:56,226 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 217 flow [2022-12-13 01:14:56,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 01:14:56,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:14:56,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:14:56,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 01:14:56,226 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 01:14:56,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:14:56,226 INFO L85 PathProgramCache]: Analyzing trace with hash 695641095, now seen corresponding path program 1 times [2022-12-13 01:14:56,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:14:56,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695322845] [2022-12-13 01:14:56,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:14:56,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:14:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:14:56,273 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 01:14:56,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:14:56,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695322845] [2022-12-13 01:14:56,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695322845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:14:56,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:14:56,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:14:56,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647994879] [2022-12-13 01:14:56,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:14:56,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:14:56,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:14:56,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:14:56,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:14:56,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 01:14:56,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:14:56,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:14:56,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 01:14:56,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:14:56,356 INFO L130 PetriNetUnfolder]: 108/385 cut-off events. [2022-12-13 01:14:56,356 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-13 01:14:56,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 385 events. 108/385 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2034 event pairs, 42 based on Foata normal form. 63/347 useless extension candidates. Maximal degree in co-relation 1128. Up to 201 conditions per place. [2022-12-13 01:14:56,357 INFO L137 encePairwiseOnDemand]: 16/40 looper letters, 26 selfloop transitions, 23 changer transitions 24/73 dead transitions. [2022-12-13 01:14:56,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 479 flow [2022-12-13 01:14:56,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:14:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:14:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-13 01:14:56,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2022-12-13 01:14:56,358 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 217 flow. Second operand 3 states and 71 transitions. [2022-12-13 01:14:56,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 479 flow [2022-12-13 01:14:56,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 464 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-13 01:14:56,360 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 309 flow [2022-12-13 01:14:56,360 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=309, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2022-12-13 01:14:56,361 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2022-12-13 01:14:56,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:14:56,361 INFO L89 Accepts]: Start accepts. Operand has 52 places, 45 transitions, 309 flow [2022-12-13 01:14:56,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:14:56,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:14:56,362 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 45 transitions, 309 flow [2022-12-13 01:14:56,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 45 transitions, 309 flow [2022-12-13 01:14:56,372 INFO L130 PetriNetUnfolder]: 36/195 cut-off events. [2022-12-13 01:14:56,372 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2022-12-13 01:14:56,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 195 events. 36/195 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 934 event pairs, 18 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 609. Up to 96 conditions per place. [2022-12-13 01:14:56,373 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 45 transitions, 309 flow [2022-12-13 01:14:56,373 INFO L226 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-13 01:14:56,804 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [422] L706-3-->L707-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1468| |v_~#mutex1~0.base_99|))) (and (= 0 (select .cse0 |v_~#mutex1~0.offset_99|)) (= (store |v_#pthreadsMutex_1468| |v_~#mutex1~0.base_99| (store .cse0 |v_~#mutex1~0.offset_99| 1)) |v_#pthreadsMutex_1467|) (= |v_ULTIMATE.start_main_#t~nondet13#1_52| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_1468|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1467|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_52|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet12#1] and [404] L701-->t_funFINAL: Formula: (and (= |v_t_funThread1of1ForFork0_#res.offset_7| 0) (= |v_t_funThread1of1ForFork0_#res.base_7| 0) (= (store |v_#pthreadsMutex_983| |v_~#mutex2~0.base_93| (store (select |v_#pthreadsMutex_983| |v_~#mutex2~0.base_93|) |v_~#mutex2~0.offset_93| 0)) |v_#pthreadsMutex_982|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_983|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_93|, ~#mutex2~0.base=|v_~#mutex2~0.base_93|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_982|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_7|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_93|, ~#mutex2~0.base=|v_~#mutex2~0.base_93|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-13 01:14:56,831 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [422] L706-3-->L707-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1468| |v_~#mutex1~0.base_99|))) (and (= 0 (select .cse0 |v_~#mutex1~0.offset_99|)) (= (store |v_#pthreadsMutex_1468| |v_~#mutex1~0.base_99| (store .cse0 |v_~#mutex1~0.offset_99| 1)) |v_#pthreadsMutex_1467|) (= |v_ULTIMATE.start_main_#t~nondet13#1_52| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_1468|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1467|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_52|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet12#1] and [405] L701-->t_funEXIT: Formula: (and (= (store |v_#pthreadsMutex_987| |v_~#mutex2~0.base_95| (store (select |v_#pthreadsMutex_987| |v_~#mutex2~0.base_95|) |v_~#mutex2~0.offset_95| 0)) |v_#pthreadsMutex_986|) (= |v_t_funThread1of1ForFork0_#res.offset_9| 0) (= |v_t_funThread1of1ForFork0_#res.base_9| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_987|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_95|, ~#mutex2~0.base=|v_~#mutex2~0.base_95|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_986|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_9|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_95|, ~#mutex2~0.base=|v_~#mutex2~0.base_95|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-13 01:14:56,860 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [422] L706-3-->L707-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1468| |v_~#mutex1~0.base_99|))) (and (= 0 (select .cse0 |v_~#mutex1~0.offset_99|)) (= (store |v_#pthreadsMutex_1468| |v_~#mutex1~0.base_99| (store .cse0 |v_~#mutex1~0.offset_99| 1)) |v_#pthreadsMutex_1467|) (= |v_ULTIMATE.start_main_#t~nondet13#1_52| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_1468|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1467|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_52|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet12#1] and [312] L701-->L702: Formula: (= |v_#pthreadsMutex_41| (store |v_#pthreadsMutex_42| |v_~#mutex2~0.base_10| (store (select |v_#pthreadsMutex_42| |v_~#mutex2~0.base_10|) |v_~#mutex2~0.offset_10| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_42|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_10|, ~#mutex2~0.base=|v_~#mutex2~0.base_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_41|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_10|, ~#mutex2~0.base=|v_~#mutex2~0.base_10|} AuxVars[] AssignedVars[#pthreadsMutex] [2022-12-13 01:14:56,881 INFO L241 LiptonReduction]: Total number of compositions: 11 [2022-12-13 01:14:56,882 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 521 [2022-12-13 01:14:56,882 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 38 transitions, 304 flow [2022-12-13 01:14:56,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:14:56,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:14:56,882 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:14:56,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 01:14:56,882 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 01:14:56,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:14:56,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1417909347, now seen corresponding path program 1 times [2022-12-13 01:14:56,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:14:56,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271553158] [2022-12-13 01:14:56,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:14:56,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:14:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:14:56,924 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 01:14:56,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:14:56,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271553158] [2022-12-13 01:14:56,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271553158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:14:56,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:14:56,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:14:56,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931408428] [2022-12-13 01:14:56,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:14:56,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:14:56,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:14:56,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:14:56,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:14:56,925 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 01:14:56,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 38 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:14:56,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:14:56,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 01:14:56,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:14:56,970 INFO L130 PetriNetUnfolder]: 24/130 cut-off events. [2022-12-13 01:14:56,970 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-13 01:14:56,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 130 events. 24/130 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 626 event pairs, 4 based on Foata normal form. 8/122 useless extension candidates. Maximal degree in co-relation 560. Up to 73 conditions per place. [2022-12-13 01:14:56,971 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 21 selfloop transitions, 18 changer transitions 2/41 dead transitions. [2022-12-13 01:14:56,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 408 flow [2022-12-13 01:14:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:14:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:14:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 01:14:56,971 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 01:14:56,971 INFO L175 Difference]: Start difference. First operand has 34 places, 38 transitions, 304 flow. Second operand 3 states and 34 transitions. [2022-12-13 01:14:56,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 408 flow [2022-12-13 01:14:56,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 361 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-13 01:14:56,973 INFO L231 Difference]: Finished difference. Result has 35 places, 36 transitions, 288 flow [2022-12-13 01:14:56,973 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=35, PETRI_TRANSITIONS=36} [2022-12-13 01:14:56,973 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -21 predicate places. [2022-12-13 01:14:56,973 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:14:56,974 INFO L89 Accepts]: Start accepts. Operand has 35 places, 36 transitions, 288 flow [2022-12-13 01:14:56,974 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:14:56,974 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:14:56,974 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 36 transitions, 288 flow [2022-12-13 01:14:56,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 36 transitions, 288 flow [2022-12-13 01:14:56,981 INFO L130 PetriNetUnfolder]: 21/116 cut-off events. [2022-12-13 01:14:56,981 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-13 01:14:56,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 116 events. 21/116 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 546 event pairs, 6 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 351. Up to 50 conditions per place. [2022-12-13 01:14:56,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 36 transitions, 288 flow [2022-12-13 01:14:56,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 01:14:57,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [422] L706-3-->L707-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1468| |v_~#mutex1~0.base_99|))) (and (= 0 (select .cse0 |v_~#mutex1~0.offset_99|)) (= (store |v_#pthreadsMutex_1468| |v_~#mutex1~0.base_99| (store .cse0 |v_~#mutex1~0.offset_99| 1)) |v_#pthreadsMutex_1467|) (= |v_ULTIMATE.start_main_#t~nondet13#1_52| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_1468|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1467|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_52|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet12#1] and [453] L698-->L701: Formula: (let ((.cse0 (select |v_#pthreadsMutex_3609| |v_~#__global_lock~0.base_1134|))) (and (= |v_#pthreadsMutex_3607| (store |v_#pthreadsMutex_3609| |v_~#__global_lock~0.base_1134| (store .cse0 |v_~#__global_lock~0.offset_1126| 0))) (= (+ v_~g2~0_268 1) v_~g2~0_269) (= (select .cse0 |v_~#__global_lock~0.offset_1126|) 0))) InVars {~g2~0=v_~g2~0_269, #pthreadsMutex=|v_#pthreadsMutex_3609|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_1126|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_1134|} OutVars{~g2~0=v_~g2~0_268, t_funThread1of1ForFork0_#t~nondet9=|v_t_funThread1of1ForFork0_#t~nondet9_122|, #pthreadsMutex=|v_#pthreadsMutex_3607|, t_funThread1of1ForFork0_#t~post10=|v_t_funThread1of1ForFork0_#t~post10_133|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_1126|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_1134|} AuxVars[] AssignedVars[~g2~0, t_funThread1of1ForFork0_#t~nondet9, #pthreadsMutex, t_funThread1of1ForFork0_#t~post10] [2022-12-13 01:14:57,397 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 01:14:57,397 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 424 [2022-12-13 01:14:57,398 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 33 transitions, 298 flow [2022-12-13 01:14:57,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:14:57,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:14:57,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:14:57,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 01:14:57,398 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 01:14:57,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:14:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1529275046, now seen corresponding path program 1 times [2022-12-13 01:14:57,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:14:57,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522585789] [2022-12-13 01:14:57,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:14:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:14:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:14:57,545 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 01:14:57,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:14:57,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522585789] [2022-12-13 01:14:57,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522585789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:14:57,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:14:57,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:14:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006747335] [2022-12-13 01:14:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:14:57,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:14:57,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:14:57,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:14:57,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:14:57,547 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 01:14:57,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 01:14:57,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:14:57,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 01:14:57,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:14:57,595 INFO L130 PetriNetUnfolder]: 21/93 cut-off events. [2022-12-13 01:14:57,596 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-13 01:14:57,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 93 events. 21/93 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 455 event pairs, 0 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 431. Up to 84 conditions per place. [2022-12-13 01:14:57,596 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 24 selfloop transitions, 7 changer transitions 7/38 dead transitions. [2022-12-13 01:14:57,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 417 flow [2022-12-13 01:14:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:14:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:14:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-13 01:14:57,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3229166666666667 [2022-12-13 01:14:57,597 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 298 flow. Second operand 4 states and 31 transitions. [2022-12-13 01:14:57,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 417 flow [2022-12-13 01:14:57,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 01:14:57,598 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 272 flow [2022-12-13 01:14:57,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=272, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2022-12-13 01:14:57,599 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -24 predicate places. [2022-12-13 01:14:57,599 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:14:57,599 INFO L89 Accepts]: Start accepts. Operand has 32 places, 29 transitions, 272 flow [2022-12-13 01:14:57,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:14:57,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:14:57,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 29 transitions, 272 flow [2022-12-13 01:14:57,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 272 flow [2022-12-13 01:14:57,607 INFO L130 PetriNetUnfolder]: 15/74 cut-off events. [2022-12-13 01:14:57,607 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-13 01:14:57,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 74 events. 15/74 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 316 event pairs, 2 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 275. Up to 40 conditions per place. [2022-12-13 01:14:57,607 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 29 transitions, 272 flow [2022-12-13 01:14:57,607 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 01:14:57,608 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [422] L706-3-->L707-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1468| |v_~#mutex1~0.base_99|))) (and (= 0 (select .cse0 |v_~#mutex1~0.offset_99|)) (= (store |v_#pthreadsMutex_1468| |v_~#mutex1~0.base_99| (store .cse0 |v_~#mutex1~0.offset_99| 1)) |v_#pthreadsMutex_1467|) (= |v_ULTIMATE.start_main_#t~nondet13#1_52| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_1468|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1467|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_99|, ~#mutex1~0.base=|v_~#mutex1~0.base_99|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_52|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet12#1] and [465] L694-->L698: Formula: (let ((.cse0 (select |v_#pthreadsMutex_3733| |v_~#mutex2~0.base_347|))) (let ((.cse1 (store |v_#pthreadsMutex_3733| |v_~#mutex2~0.base_347| (store .cse0 |v_~#mutex2~0.offset_347| 1)))) (let ((.cse2 (select .cse1 |v_~#__global_lock~0.base_1169|))) (and (= (select .cse0 |v_~#mutex2~0.offset_347|) 0) (= |v_#pthreadsMutex_3731| (store .cse1 |v_~#__global_lock~0.base_1169| (store .cse2 |v_~#__global_lock~0.offset_1159| 0))) (= (select .cse2 |v_~#__global_lock~0.offset_1159|) 0) (= (+ v_~g2~0_297 1) v_~g2~0_296))))) InVars {~g2~0=v_~g2~0_297, #pthreadsMutex=|v_#pthreadsMutex_3733|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_1159|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_347|, ~#mutex2~0.base=|v_~#mutex2~0.base_347|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_1169|} OutVars{~g2~0=v_~g2~0_296, #pthreadsMutex=|v_#pthreadsMutex_3731|, t_funThread1of1ForFork0_#t~nondet6=|v_t_funThread1of1ForFork0_#t~nondet6_244|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_1159|, t_funThread1of1ForFork0_#t~nondet7=|v_t_funThread1of1ForFork0_#t~nondet7_210|, t_funThread1of1ForFork0_#t~post8=|v_t_funThread1of1ForFork0_#t~post8_114|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_347|, ~#mutex2~0.base=|v_~#mutex2~0.base_347|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_1169|} AuxVars[] AssignedVars[~g2~0, #pthreadsMutex, t_funThread1of1ForFork0_#t~nondet6, t_funThread1of1ForFork0_#t~nondet7, t_funThread1of1ForFork0_#t~post8] [2022-12-13 01:14:57,946 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:14:57,947 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 348 [2022-12-13 01:14:57,947 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 282 flow [2022-12-13 01:14:57,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 01:14:57,947 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:14:57,947 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:14:57,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 01:14:57,947 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-13 01:14:57,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:14:57,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1537655682, now seen corresponding path program 1 times [2022-12-13 01:14:57,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:14:57,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089893182] [2022-12-13 01:14:57,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:14:57,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:14:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:14:58,079 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 01:14:58,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:14:58,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089893182] [2022-12-13 01:14:58,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089893182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:14:58,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:14:58,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:14:58,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683650342] [2022-12-13 01:14:58,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:14:58,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:14:58,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:14:58,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:14:58,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:14:58,080 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-13 01:14:58,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 01:14:58,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:14:58,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-13 01:14:58,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:14:58,115 INFO L130 PetriNetUnfolder]: 9/54 cut-off events. [2022-12-13 01:14:58,115 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2022-12-13 01:14:58,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 54 events. 9/54 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 226 event pairs, 1 based on Foata normal form. 12/59 useless extension candidates. Maximal degree in co-relation 281. Up to 42 conditions per place. [2022-12-13 01:14:58,115 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 0 selfloop transitions, 0 changer transitions 28/28 dead transitions. [2022-12-13 01:14:58,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 331 flow [2022-12-13 01:14:58,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:14:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:14:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-12-13 01:14:58,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32894736842105265 [2022-12-13 01:14:58,116 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 282 flow. Second operand 4 states and 25 transitions. [2022-12-13 01:14:58,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 331 flow [2022-12-13 01:14:58,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 28 transitions, 300 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 01:14:58,117 INFO L231 Difference]: Finished difference. Result has 26 places, 0 transitions, 0 flow [2022-12-13 01:14:58,117 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=26, PETRI_TRANSITIONS=0} [2022-12-13 01:14:58,118 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -30 predicate places. [2022-12-13 01:14:58,119 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:14:58,119 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 0 transitions, 0 flow [2022-12-13 01:14:58,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 01:14:58,119 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 01:14:58,119 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:14:58,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 01:14:58,119 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 01:14:58,119 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 01:14:58,119 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:14:58,120 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 01:14:58,120 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 01:14:58,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 01:14:58,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 01:14:58,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 01:14:58,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-12-13 01:14:58,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-12-13 01:14:58,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 01:14:58,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 01:14:58,127 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:14:58,129 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 01:14:58,129 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 01:14:58,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:14:58 BasicIcfg [2022-12-13 01:14:58,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 01:14:58,132 INFO L158 Benchmark]: Toolchain (without parser) took 8848.35ms. Allocated memory was 168.8MB in the beginning and 306.2MB in the end (delta: 137.4MB). Free memory was 142.7MB in the beginning and 164.5MB in the end (delta: -21.8MB). Peak memory consumption was 116.0MB. Max. memory is 8.0GB. [2022-12-13 01:14:58,132 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 168.8MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 01:14:58,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.90ms. Allocated memory is still 168.8MB. Free memory was 142.3MB in the beginning and 122.8MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-13 01:14:58,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.24ms. Allocated memory is still 168.8MB. Free memory was 122.8MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:14:58,133 INFO L158 Benchmark]: Boogie Preprocessor took 25.40ms. Allocated memory is still 168.8MB. Free memory was 120.8MB in the beginning and 119.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 01:14:58,133 INFO L158 Benchmark]: RCFGBuilder took 444.39ms. Allocated memory is still 168.8MB. Free memory was 119.3MB in the beginning and 103.3MB in the end (delta: 16.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-13 01:14:58,133 INFO L158 Benchmark]: TraceAbstraction took 7924.40ms. Allocated memory was 168.8MB in the beginning and 306.2MB in the end (delta: 137.4MB). Free memory was 102.3MB in the beginning and 164.5MB in the end (delta: -62.2MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. [2022-12-13 01:14:58,134 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.13ms. Allocated memory is still 168.8MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 394.90ms. Allocated memory is still 168.8MB. Free memory was 142.3MB in the beginning and 122.8MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.24ms. Allocated memory is still 168.8MB. Free memory was 122.8MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.40ms. Allocated memory is still 168.8MB. Free memory was 120.8MB in the beginning and 119.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 444.39ms. Allocated memory is still 168.8MB. Free memory was 119.3MB in the beginning and 103.3MB in the end (delta: 16.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7924.40ms. Allocated memory was 168.8MB in the beginning and 306.2MB in the end (delta: 137.4MB). Free memory was 102.3MB in the beginning and 164.5MB in the end (delta: -62.2MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 118 PlacesBefore, 56 PlacesAfterwards, 117 TransitionsBefore, 55 TransitionsAfterwards, 3102 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 44 ConcurrentYvCompositions, 0 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3518, independent: 3227, independent conditional: 3227, independent unconditional: 0, dependent: 291, dependent conditional: 291, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3518, independent: 3227, independent conditional: 0, independent unconditional: 3227, dependent: 291, dependent conditional: 0, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3518, independent: 3227, independent conditional: 0, independent unconditional: 3227, dependent: 291, dependent conditional: 0, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3518, independent: 3227, independent conditional: 0, independent unconditional: 3227, dependent: 291, dependent conditional: 0, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2506, independent: 2409, independent conditional: 0, independent unconditional: 2409, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2506, independent: 2128, independent conditional: 0, independent unconditional: 2128, dependent: 378, dependent conditional: 0, dependent unconditional: 378, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 378, independent: 281, independent conditional: 0, independent unconditional: 281, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 341, independent: 188, independent conditional: 0, independent unconditional: 188, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3518, independent: 818, independent conditional: 0, independent unconditional: 818, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 2506, unknown conditional: 0, unknown unconditional: 2506] , Statistics on independence cache: Total cache size (in pairs): 4110, Positive cache size: 4013, Positive conditional cache size: 0, Positive unconditional cache size: 4013, Negative cache size: 97, Negative conditional cache size: 0, Negative unconditional cache size: 97, 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, 55 PlacesBefore, 55 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 1122 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 429, independent: 337, independent conditional: 337, independent unconditional: 0, dependent: 92, dependent conditional: 92, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 429, independent: 337, independent conditional: 0, independent unconditional: 337, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 429, independent: 337, independent conditional: 0, independent unconditional: 337, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429, independent: 337, independent conditional: 0, independent unconditional: 337, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 341, independent: 269, independent conditional: 0, independent unconditional: 269, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 341, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 144, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 150, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 429, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 341, unknown conditional: 0, unknown unconditional: 341] , Statistics on independence cache: Total cache size (in pairs): 341, Positive cache size: 269, Positive conditional cache size: 0, Positive unconditional cache size: 269, Negative cache size: 72, Negative conditional cache size: 0, Negative unconditional cache size: 72, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 58 PlacesBefore, 58 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 1074 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 401, independent: 313, independent conditional: 313, independent unconditional: 0, dependent: 88, dependent conditional: 88, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 401, independent: 313, independent conditional: 46, independent unconditional: 267, dependent: 88, dependent conditional: 6, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 401, independent: 313, independent conditional: 0, independent unconditional: 313, dependent: 88, dependent conditional: 6, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 401, independent: 313, independent conditional: 0, independent unconditional: 313, dependent: 88, dependent conditional: 6, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 47, dependent conditional: 40, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 401, independent: 302, independent conditional: 0, independent unconditional: 302, dependent: 75, dependent conditional: 1, dependent unconditional: 74, unknown: 24, unknown conditional: 5, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 365, Positive cache size: 280, Positive conditional cache size: 0, Positive unconditional cache size: 280, Negative cache size: 85, Negative conditional cache size: 5, Negative unconditional cache size: 80, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 1010 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 451, independent: 395, independent conditional: 395, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 451, independent: 395, independent conditional: 4, independent unconditional: 391, dependent: 56, dependent conditional: 20, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 451, independent: 395, independent conditional: 4, independent unconditional: 391, dependent: 56, dependent conditional: 20, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 451, independent: 395, independent conditional: 4, independent unconditional: 391, dependent: 56, dependent conditional: 20, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 78, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 18, dependent conditional: 14, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 78, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 18, dependent conditional: 14, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 17, dependent conditional: 14, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 451, independent: 335, independent conditional: 4, independent unconditional: 331, dependent: 38, dependent conditional: 6, dependent unconditional: 32, unknown: 78, unknown conditional: 14, unknown unconditional: 64] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 340, Positive conditional cache size: 0, Positive unconditional cache size: 340, Negative cache size: 103, Negative conditional cache size: 19, Negative unconditional cache size: 84, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 59 PlacesBefore, 53 PlacesAfterwards, 59 TransitionsBefore, 53 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 465, independent: 375, independent conditional: 375, independent unconditional: 0, dependent: 90, dependent conditional: 90, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 465, independent: 375, independent conditional: 93, independent unconditional: 282, dependent: 90, dependent conditional: 47, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 465, independent: 375, independent conditional: 93, independent unconditional: 282, dependent: 90, dependent conditional: 47, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 465, independent: 375, independent conditional: 93, independent unconditional: 282, dependent: 90, dependent conditional: 47, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 147, independent: 123, independent conditional: 34, independent unconditional: 89, dependent: 24, dependent conditional: 16, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 147, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 24, dependent conditional: 16, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 28, dependent conditional: 21, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 465, independent: 252, independent conditional: 59, independent unconditional: 193, dependent: 66, dependent conditional: 31, dependent unconditional: 35, unknown: 147, unknown conditional: 50, unknown unconditional: 97] , Statistics on independence cache: Total cache size (in pairs): 683, Positive cache size: 556, Positive conditional cache size: 34, Positive unconditional cache size: 522, Negative cache size: 127, Negative conditional cache size: 35, Negative unconditional cache size: 92, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 54 PlacesBefore, 54 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 337, independent: 255, independent conditional: 255, independent unconditional: 0, dependent: 82, dependent conditional: 82, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 337, independent: 255, independent conditional: 128, independent unconditional: 127, dependent: 82, dependent conditional: 26, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 337, independent: 255, independent conditional: 128, independent unconditional: 127, dependent: 82, dependent conditional: 26, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 337, independent: 255, independent conditional: 128, independent unconditional: 127, dependent: 82, dependent conditional: 26, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55, independent: 41, independent conditional: 18, independent unconditional: 23, dependent: 14, dependent conditional: 5, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 5, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 7, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 337, independent: 214, independent conditional: 110, independent unconditional: 104, dependent: 68, dependent conditional: 21, dependent unconditional: 47, unknown: 55, unknown conditional: 23, unknown unconditional: 32] , Statistics on independence cache: Total cache size (in pairs): 763, Positive cache size: 622, Positive conditional cache size: 52, Positive unconditional cache size: 570, Negative cache size: 141, Negative conditional cache size: 40, Negative unconditional cache size: 101, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 53 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 223, independent: 157, independent conditional: 157, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 223, independent: 157, independent conditional: 61, independent unconditional: 96, dependent: 66, dependent conditional: 26, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 223, independent: 157, independent conditional: 61, independent unconditional: 96, dependent: 66, dependent conditional: 26, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 223, independent: 157, independent conditional: 61, independent unconditional: 96, dependent: 66, dependent conditional: 26, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 223, independent: 152, independent conditional: 61, independent unconditional: 91, dependent: 59, dependent conditional: 21, dependent unconditional: 38, unknown: 12, unknown conditional: 5, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 779, Positive cache size: 631, Positive conditional cache size: 52, Positive unconditional cache size: 579, Negative cache size: 148, Negative conditional cache size: 45, Negative unconditional cache size: 103, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 41 PlacesBefore, 34 PlacesAfterwards, 45 TransitionsBefore, 38 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 64, independent conditional: 25, independent unconditional: 39, dependent: 16, dependent conditional: 10, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, independent: 64, independent conditional: 25, independent unconditional: 39, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, independent: 64, independent conditional: 25, independent unconditional: 39, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 3, independent unconditional: 9, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 3, independent unconditional: 9, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 16, independent conditional: 5, independent unconditional: 11, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, independent: 52, independent conditional: 22, independent unconditional: 30, dependent: 15, dependent conditional: 10, dependent unconditional: 5, unknown: 14, unknown conditional: 4, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 875, Positive cache size: 725, Positive conditional cache size: 57, Positive unconditional cache size: 668, Negative cache size: 150, Negative conditional cache size: 46, Negative unconditional cache size: 104, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 34 PlacesBefore, 31 PlacesAfterwards, 36 TransitionsBefore, 33 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 6, independent unconditional: 2, 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: 8, independent: 8, independent conditional: 6, independent unconditional: 2, 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: 8, independent: 8, independent conditional: 6, independent unconditional: 2, 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: 8, independent: 8, independent conditional: 6, independent unconditional: 2, 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): 937, Positive cache size: 787, Positive conditional cache size: 57, Positive unconditional cache size: 730, Negative cache size: 150, Negative conditional cache size: 46, Negative unconditional cache size: 104, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 29 PlacesBefore, 28 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 941, Positive cache size: 791, Positive conditional cache size: 57, Positive unconditional cache size: 734, Negative cache size: 150, Negative conditional cache size: 46, Negative unconditional cache size: 104, 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): 941, Positive cache size: 791, Positive conditional cache size: 57, Positive unconditional cache size: 734, Negative cache size: 150, Negative conditional cache size: 46, Negative unconditional cache size: 104, 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 3 procedures, 163 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 164 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 672 IncrementalHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 19 mSDtfsCounter, 672 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=7, InterpolantAutomatonStates: 33, 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.7s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 01:14:58,162 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...