/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_25-struct_nr_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:58:01,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:58:01,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:58:01,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:58:01,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:58:01,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:58:01,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:58:01,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:58:01,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:58:01,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:58:01,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:58:01,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:58:01,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:58:01,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:58:01,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:58:01,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:58:01,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:58:01,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:58:01,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:58:01,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:58:01,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:58:01,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:58:01,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:58:01,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:58:01,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:58:01,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:58:01,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:58:01,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:58:01,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:58:01,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:58:01,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:58:01,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:58:01,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:58:01,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:58:01,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:58:01,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:58:01,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:58:01,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:58:01,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:58:01,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:58:01,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:58:01,576 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:58:01,591 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:58:01,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:58:01,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:58:01,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:58:01,594 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:58:01,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:58:01,595 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:58:01,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:58:01,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:58:01,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:58:01,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:58:01,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:58:01,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:58:01,596 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:58:01,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:58:01,596 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:58:01,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:58:01,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:58:01,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:58:01,597 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:58:01,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:58:01,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:58:01,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:58:01,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:58:01,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:58:01,597 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:58:01,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:58:01,598 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:58:01,598 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-06 04:58:01,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:58:01,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:58:01,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:58:01,886 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:58:01,886 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:58:01,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_25-struct_nr_true.i [2022-12-06 04:58:02,986 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:58:03,189 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:58:03,189 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_25-struct_nr_true.i [2022-12-06 04:58:03,221 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c4498e5b/84fd8a79a2d24d60ab12384de09191b1/FLAG27ec3bb71 [2022-12-06 04:58:03,234 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c4498e5b/84fd8a79a2d24d60ab12384de09191b1 [2022-12-06 04:58:03,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:58:03,236 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:58:03,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:58:03,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:58:03,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:58:03,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:58:03" (1/1) ... [2022-12-06 04:58:03,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe7c752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:58:03, skipping insertion in model container [2022-12-06 04:58:03,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:58:03" (1/1) ... [2022-12-06 04:58:03,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:58:03,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:58:03,420 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_25-struct_nr_true.i[1086,1099] [2022-12-06 04:58:03,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:58:03,556 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:58:03,566 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_25-struct_nr_true.i[1086,1099] [2022-12-06 04:58:03,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:58:03,627 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:58:03,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:58:03 WrapperNode [2022-12-06 04:58:03,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:58:03,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:58:03,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:58:03,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:58:03,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:58:03" (1/1) ... [2022-12-06 04:58:03,658 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:58:03" (1/1) ... [2022-12-06 04:58:03,678 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 76 [2022-12-06 04:58:03,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:58:03,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:58:03,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:58:03,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:58:03,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:58:03" (1/1) ... [2022-12-06 04:58:03,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:58:03" (1/1) ... [2022-12-06 04:58:03,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:58:03" (1/1) ... [2022-12-06 04:58:03,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:58:03" (1/1) ... [2022-12-06 04:58:03,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:58:03" (1/1) ... [2022-12-06 04:58:03,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:58:03" (1/1) ... [2022-12-06 04:58:03,704 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:58:03" (1/1) ... [2022-12-06 04:58:03,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:58:03" (1/1) ... [2022-12-06 04:58:03,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:58:03,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:58:03,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:58:03,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:58:03,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:58:03" (1/1) ... [2022-12-06 04:58:03,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:58:03,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:58:03,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:58:03,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:58:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:58:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:58:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 04:58:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:58:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:58:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-06 04:58:03,787 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-06 04:58:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:58:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:58:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:58:03,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:58:03,788 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:58:03,911 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:58:03,913 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:58:04,027 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:58:04,032 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:58:04,032 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:58:04,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:58:04 BoogieIcfgContainer [2022-12-06 04:58:04,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:58:04,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:58:04,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:58:04,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:58:04,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:58:03" (1/3) ... [2022-12-06 04:58:04,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4fd476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:58:04, skipping insertion in model container [2022-12-06 04:58:04,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:58:03" (2/3) ... [2022-12-06 04:58:04,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4fd476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:58:04, skipping insertion in model container [2022-12-06 04:58:04,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:58:04" (3/3) ... [2022-12-06 04:58:04,039 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_25-struct_nr_true.i [2022-12-06 04:58:04,052 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:58:04,052 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-06 04:58:04,052 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:58:04,083 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-06 04:58:04,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 84 transitions, 176 flow [2022-12-06 04:58:04,137 INFO L130 PetriNetUnfolder]: 4/83 cut-off events. [2022-12-06 04:58:04,137 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:58:04,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 83 events. 4/83 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-06 04:58:04,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 84 transitions, 176 flow [2022-12-06 04:58:04,143 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 76 transitions, 155 flow [2022-12-06 04:58:04,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:58:04,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 76 transitions, 155 flow [2022-12-06 04:58:04,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 76 transitions, 155 flow [2022-12-06 04:58:04,176 INFO L130 PetriNetUnfolder]: 4/76 cut-off events. [2022-12-06 04:58:04,176 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:58:04,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 76 events. 4/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-12-06 04:58:04,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 76 transitions, 155 flow [2022-12-06 04:58:04,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 1040 [2022-12-06 04:58:06,482 INFO L203 LiptonReduction]: Total number of compositions: 64 [2022-12-06 04:58:06,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:58:06,508 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;@1963297d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:58:06,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:58:06,509 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 04:58:06,510 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:58:06,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:58:06,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-06 04:58:06,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:58:06,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:58:06,517 INFO L85 PathProgramCache]: Analyzing trace with hash 329, now seen corresponding path program 1 times [2022-12-06 04:58:06,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:58:06,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597231488] [2022-12-06 04:58:06,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:58:06,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:58:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:58:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:58:06,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:58:06,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597231488] [2022-12-06 04:58:06,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597231488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:58:06,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:58:06,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-06 04:58:06,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492847954] [2022-12-06 04:58:06,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:58:06,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:58:06,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:58:06,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:58:06,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:58:06,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:58:06,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 57 flow. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-06 04:58:06,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:58:06,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:58:06,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:58:06,738 INFO L130 PetriNetUnfolder]: 56/141 cut-off events. [2022-12-06 04:58:06,739 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:58:06,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 141 events. 56/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 547 event pairs, 56 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 266. Up to 130 conditions per place. [2022-12-06 04:58:06,741 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 17 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2022-12-06 04:58:06,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 20 transitions, 77 flow [2022-12-06 04:58:06,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:58:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:58:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2022-12-06 04:58:06,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:58:06,755 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 57 flow. Second operand 2 states and 30 transitions. [2022-12-06 04:58:06,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 20 transitions, 77 flow [2022-12-06 04:58:06,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 20 transitions, 76 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:58:06,761 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 42 flow [2022-12-06 04:58:06,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2022-12-06 04:58:06,767 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -4 predicate places. [2022-12-06 04:58:06,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:58:06,768 INFO L89 Accepts]: Start accepts. Operand has 24 places, 20 transitions, 42 flow [2022-12-06 04:58:06,770 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:58:06,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:58:06,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 20 transitions, 42 flow [2022-12-06 04:58:06,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 20 transitions, 42 flow [2022-12-06 04:58:06,788 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:58:06,789 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:58:06,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 04:58:06,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 20 transitions, 42 flow [2022-12-06 04:58:06,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 04:58:06,823 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:58:06,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 04:58:06,828 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 42 flow [2022-12-06 04:58:06,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-06 04:58:06,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:58:06,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 04:58:06,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:58:06,829 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:58:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:58:06,830 INFO L85 PathProgramCache]: Analyzing trace with hash 10076574, now seen corresponding path program 1 times [2022-12-06 04:58:06,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:58:06,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543004704] [2022-12-06 04:58:06,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:58:06,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:58:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:58:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:58:07,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:58:07,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543004704] [2022-12-06 04:58:07,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543004704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:58:07,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:58:07,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:58:07,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988226255] [2022-12-06 04:58:07,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:58:07,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:58:07,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:58:07,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:58:07,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:58:07,105 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:58:07,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 42 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:58:07,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:58:07,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:58:07,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:58:07,144 INFO L130 PetriNetUnfolder]: 82/185 cut-off events. [2022-12-06 04:58:07,145 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:58:07,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 185 events. 82/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 659 event pairs, 39 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 366. Up to 150 conditions per place. [2022-12-06 04:58:07,146 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 28 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2022-12-06 04:58:07,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 33 transitions, 134 flow [2022-12-06 04:58:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:58:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:58:07,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 04:58:07,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 04:58:07,147 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 42 flow. Second operand 3 states and 34 transitions. [2022-12-06 04:58:07,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 33 transitions, 134 flow [2022-12-06 04:58:07,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:58:07,148 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 80 flow [2022-12-06 04:58:07,148 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2022-12-06 04:58:07,149 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2022-12-06 04:58:07,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:58:07,149 INFO L89 Accepts]: Start accepts. Operand has 27 places, 24 transitions, 80 flow [2022-12-06 04:58:07,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:58:07,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:58:07,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 24 transitions, 80 flow [2022-12-06 04:58:07,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 80 flow [2022-12-06 04:58:07,152 INFO L130 PetriNetUnfolder]: 6/45 cut-off events. [2022-12-06 04:58:07,152 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 04:58:07,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 45 events. 6/45 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 2 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 69. Up to 16 conditions per place. [2022-12-06 04:58:07,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 24 transitions, 80 flow [2022-12-06 04:58:07,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 04:58:07,158 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:58:07,159 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 04:58:07,159 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 80 flow [2022-12-06 04:58:07,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:58:07,159 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:58:07,159 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 04:58:07,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:58:07,159 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:58:07,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:58:07,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1093405429, now seen corresponding path program 1 times [2022-12-06 04:58:07,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:58:07,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177787666] [2022-12-06 04:58:07,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:58:07,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:58:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:58:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:58:07,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:58:07,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177787666] [2022-12-06 04:58:07,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177787666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:58:07,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:58:07,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:58:07,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525630989] [2022-12-06 04:58:07,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:58:07,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:58:07,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:58:07,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:58:07,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:58:07,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:58:07,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 80 flow. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:58:07,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:58:07,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:58:07,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:58:07,424 INFO L130 PetriNetUnfolder]: 86/200 cut-off events. [2022-12-06 04:58:07,424 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 04:58:07,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 200 events. 86/200 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 760 event pairs, 24 based on Foata normal form. 3/166 useless extension candidates. Maximal degree in co-relation 459. Up to 120 conditions per place. [2022-12-06 04:58:07,425 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 32 selfloop transitions, 10 changer transitions 7/49 dead transitions. [2022-12-06 04:58:07,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 49 transitions, 238 flow [2022-12-06 04:58:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:58:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:58:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-06 04:58:07,428 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-06 04:58:07,428 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 80 flow. Second operand 6 states and 51 transitions. [2022-12-06 04:58:07,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 49 transitions, 238 flow [2022-12-06 04:58:07,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 49 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:58:07,429 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 127 flow [2022-12-06 04:58:07,430 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=127, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2022-12-06 04:58:07,430 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 5 predicate places. [2022-12-06 04:58:07,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:58:07,430 INFO L89 Accepts]: Start accepts. Operand has 33 places, 28 transitions, 127 flow [2022-12-06 04:58:07,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:58:07,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:58:07,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 28 transitions, 127 flow [2022-12-06 04:58:07,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 127 flow [2022-12-06 04:58:07,434 INFO L130 PetriNetUnfolder]: 9/57 cut-off events. [2022-12-06 04:58:07,434 INFO L131 PetriNetUnfolder]: For 18/20 co-relation queries the response was YES. [2022-12-06 04:58:07,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 57 events. 9/57 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 215 event pairs, 3 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 116. Up to 20 conditions per place. [2022-12-06 04:58:07,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 28 transitions, 127 flow [2022-12-06 04:58:07,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 04:58:07,446 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [130] L702-->L702-1: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| v_~glob1~0_3) InVars {~glob1~0=v_~glob1~0_3} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ~glob1~0=v_~glob1~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1] and [200] L19-5-->L692: Formula: (= (+ v_~glob1~0_9 10) 0) InVars {} OutVars{~glob1~0=v_~glob1~0_9} AuxVars[] AssignedVars[~glob1~0] [2022-12-06 04:58:07,463 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:58:07,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 04:58:07,464 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 126 flow [2022-12-06 04:58:07,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:58:07,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:58:07,464 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 04:58:07,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:58:07,464 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:58:07,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:58:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1093658541, now seen corresponding path program 1 times [2022-12-06 04:58:07,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:58:07,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364819615] [2022-12-06 04:58:07,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:58:07,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:58:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:58:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:58:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:58:07,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364819615] [2022-12-06 04:58:07,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364819615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:58:07,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:58:07,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:58:07,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713531298] [2022-12-06 04:58:07,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:58:07,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:58:07,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:58:07,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:58:07,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:58:07,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:58:07,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 126 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:58:07,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:58:07,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:58:07,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:58:07,551 INFO L130 PetriNetUnfolder]: 81/190 cut-off events. [2022-12-06 04:58:07,552 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-12-06 04:58:07,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 190 events. 81/190 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 769 event pairs, 35 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 524. Up to 155 conditions per place. [2022-12-06 04:58:07,557 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 26 selfloop transitions, 7 changer transitions 6/39 dead transitions. [2022-12-06 04:58:07,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 248 flow [2022-12-06 04:58:07,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:58:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:58:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 04:58:07,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 04:58:07,563 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 126 flow. Second operand 3 states and 33 transitions. [2022-12-06 04:58:07,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 248 flow [2022-12-06 04:58:07,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 235 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 04:58:07,567 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 146 flow [2022-12-06 04:58:07,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2022-12-06 04:58:07,569 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 5 predicate places. [2022-12-06 04:58:07,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:58:07,583 INFO L89 Accepts]: Start accepts. Operand has 33 places, 27 transitions, 146 flow [2022-12-06 04:58:07,584 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:58:07,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:58:07,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 146 flow [2022-12-06 04:58:07,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 146 flow [2022-12-06 04:58:07,588 INFO L130 PetriNetUnfolder]: 10/56 cut-off events. [2022-12-06 04:58:07,588 INFO L131 PetriNetUnfolder]: For 34/38 co-relation queries the response was YES. [2022-12-06 04:58:07,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 56 events. 10/56 cut-off events. For 34/38 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 219 event pairs, 2 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 137. Up to 21 conditions per place. [2022-12-06 04:58:07,588 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 146 flow [2022-12-06 04:58:07,588 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 04:58:07,608 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] L688-1-->L19-5: Formula: (and (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_77|) (not (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_77| 0)) (= |v_t_funThread1of1ForFork0_~t~0#1_35| v_~glob1~0_118) (= (ite (= |v_t_funThread1of1ForFork0_~t~0#1_35| 5) 1 0) |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|)) InVars {~glob1~0=v_~glob1~0_118} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_43|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_15|, t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_35|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_77|, ~glob1~0=v_~glob1~0_118} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~t~0#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] and [312] L702-->L692: Formula: (and (= (+ 10 v_~glob1~0_479) 0) (= |v_ULTIMATE.start_main_#t~post5#1_175| v_~glob1~0_480)) InVars {~glob1~0=v_~glob1~0_480} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_175|, ~glob1~0=v_~glob1~0_479} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1, ~glob1~0] [2022-12-06 04:58:07,633 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:58:07,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 04:58:07,634 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 146 flow [2022-12-06 04:58:07,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:58:07,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:58:07,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 04:58:07,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:58:07,634 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:58:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:58:07,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1093557225, now seen corresponding path program 1 times [2022-12-06 04:58:07,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:58:07,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824423838] [2022-12-06 04:58:07,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:58:07,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:58:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:58:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:58:07,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:58:07,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824423838] [2022-12-06 04:58:07,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824423838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:58:07,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:58:07,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:58:07,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847899445] [2022-12-06 04:58:07,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:58:07,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:58:07,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:58:07,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:58:07,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:58:07,663 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 04:58:07,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 146 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-06 04:58:07,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:58:07,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 04:58:07,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:58:07,681 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 04:58:07,681 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 04:58:07,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 24 events. 0/24 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 9/33 useless extension candidates. Maximal degree in co-relation 0. Up to 16 conditions per place. [2022-12-06 04:58:07,681 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 11 selfloop transitions, 4 changer transitions 2/19 dead transitions. [2022-12-06 04:58:07,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 19 transitions, 116 flow [2022-12-06 04:58:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:58:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:58:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 04:58:07,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 04:58:07,682 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 146 flow. Second operand 3 states and 27 transitions. [2022-12-06 04:58:07,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 19 transitions, 116 flow [2022-12-06 04:58:07,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 95 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-06 04:58:07,683 INFO L231 Difference]: Finished difference. Result has 27 places, 17 transitions, 63 flow [2022-12-06 04:58:07,683 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=27, PETRI_TRANSITIONS=17} [2022-12-06 04:58:07,684 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2022-12-06 04:58:07,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:58:07,684 INFO L89 Accepts]: Start accepts. Operand has 27 places, 17 transitions, 63 flow [2022-12-06 04:58:07,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:58:07,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:58:07,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 17 transitions, 63 flow [2022-12-06 04:58:07,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 17 transitions, 63 flow [2022-12-06 04:58:07,686 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:58:07,686 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:58:07,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 21 events. 0/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 17 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-06 04:58:07,687 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 17 transitions, 63 flow [2022-12-06 04:58:07,687 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 04:58:08,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [320] $Ultimate##0-->t_funErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#pthreadsMutex_280| |v_~#lock1~0.base_133|))) (and (= |v_t_funThread1of1ForFork0_~arg#1.offset_31| |v_t_funThread1of1ForFork0_#in~arg#1.offset_27|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_289| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_225|) (= |v_t_funThread1of1ForFork0_~t~0#1_187| v_~glob1~0_558) (= (select .cse0 |v_~#lock1~0.offset_133|) 0) (= (store |v_#pthreadsMutex_280| |v_~#lock1~0.base_133| (store .cse0 |v_~#lock1~0.offset_133| 1)) |v_#pthreadsMutex_279|) (= (ite (= 5 |v_t_funThread1of1ForFork0_~t~0#1_187|) 1 0) |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_225|) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_27| |v_t_funThread1of1ForFork0_~arg#1.base_31|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_289| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_280|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_27|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_27|, ~glob1~0=v_~glob1~0_558, ~#lock1~0.offset=|v_~#lock1~0.offset_133|, ~#lock1~0.base=|v_~#lock1~0.base_133|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_225|, #pthreadsMutex=|v_#pthreadsMutex_279|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_113|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_27|, t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_187|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_31|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_31|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_27|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_289|, ~glob1~0=v_~glob1~0_558, ~#lock1~0.offset=|v_~#lock1~0.offset_133|, ~#lock1~0.base=|v_~#lock1~0.base_133|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, #pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_~t~0#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] and [323] L703-->L706-1: Formula: (and (= (store |v_#pthreadsMutex_292| |v_~#lock1~0.base_139| (store (select |v_#pthreadsMutex_292| |v_~#lock1~0.base_139|) |v_~#lock1~0.offset_139| 0)) |v_#pthreadsMutex_291|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_177| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_227|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_177| (ite (= 6 v_~glob1~0_567) 1 0)) (not (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_227| 0)) (= (+ v_~glob1~0_566 1) v_~glob1~0_567) (= (select (select |v_#memory_int_111| |v_ULTIMATE.start_main_~#id~0#1.base_65|) |v_ULTIMATE.start_main_~#id~0#1.offset_65|) |v_ULTIMATE.start_main_#t~mem7#1_54|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_292|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_65|, #memory_int=|v_#memory_int_111|, ~glob1~0=v_~glob1~0_567, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_65|, ~#lock1~0.offset=|v_~#lock1~0.offset_139|, ~#lock1~0.base=|v_~#lock1~0.base_139|} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_223|, #pthreadsMutex=|v_#pthreadsMutex_291|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_54|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_65|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_177|, #memory_int=|v_#memory_int_111|, ~glob1~0=v_~glob1~0_566, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_65|, ~#lock1~0.offset=|v_~#lock1~0.offset_139|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_227|, ~#lock1~0.base=|v_~#lock1~0.base_139|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6#1, #pthreadsMutex, ULTIMATE.start_main_#t~mem7#1, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ~glob1~0, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-06 04:58:08,241 INFO L203 LiptonReduction]: Total number of compositions: 11 [2022-12-06 04:58:08,242 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 558 [2022-12-06 04:58:08,242 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 9 transitions, 60 flow [2022-12-06 04:58:08,242 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-06 04:58:08,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:58:08,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 04:58:08,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:58:08,242 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:58:08,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:58:08,243 INFO L85 PathProgramCache]: Analyzing trace with hash 10077893, now seen corresponding path program 1 times [2022-12-06 04:58:08,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:58:08,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35102280] [2022-12-06 04:58:08,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:58:08,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:58:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:58:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:58:08,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:58:08,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35102280] [2022-12-06 04:58:08,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35102280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:58:08,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:58:08,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:58:08,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223286071] [2022-12-06 04:58:08,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:58:08,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:58:08,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:58:08,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:58:08,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:58:08,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 9 [2022-12-06 04:58:08,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 9 transitions, 60 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:58:08,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:58:08,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 9 [2022-12-06 04:58:08,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:58:08,344 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 04:58:08,344 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 04:58:08,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 7 events. 0/7 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 5 event pairs, 0 based on Foata normal form. 1/7 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-06 04:58:08,345 INFO L137 encePairwiseOnDemand]: 5/9 looper letters, 3 selfloop transitions, 2 changer transitions 2/7 dead transitions. [2022-12-06 04:58:08,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 7 transitions, 58 flow [2022-12-06 04:58:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:58:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:58:08,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-12-06 04:58:08,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2022-12-06 04:58:08,346 INFO L175 Difference]: Start difference. First operand has 17 places, 9 transitions, 60 flow. Second operand 3 states and 8 transitions. [2022-12-06 04:58:08,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 7 transitions, 58 flow [2022-12-06 04:58:08,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 7 transitions, 48 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 04:58:08,350 INFO L231 Difference]: Finished difference. Result has 17 places, 5 transitions, 26 flow [2022-12-06 04:58:08,351 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=9, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=26, PETRI_PLACES=17, PETRI_TRANSITIONS=5} [2022-12-06 04:58:08,353 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -11 predicate places. [2022-12-06 04:58:08,353 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:58:08,353 INFO L89 Accepts]: Start accepts. Operand has 17 places, 5 transitions, 26 flow [2022-12-06 04:58:08,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:58:08,354 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:58:08,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 5 transitions, 26 flow [2022-12-06 04:58:08,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 5 transitions, 26 flow [2022-12-06 04:58:08,357 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-06 04:58:08,357 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:58:08,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19 conditions, 5 events. 0/5 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/5 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:58:08,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 15 places, 5 transitions, 26 flow [2022-12-06 04:58:08,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 04:58:08,387 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:58:08,387 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 04:58:08,387 INFO L495 AbstractCegarLoop]: Abstraction has has 14 places, 4 transitions, 24 flow [2022-12-06 04:58:08,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:58:08,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:58:08,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 04:58:08,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:58:08,388 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:58:08,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:58:08,388 INFO L85 PathProgramCache]: Analyzing trace with hash 10077840, now seen corresponding path program 1 times [2022-12-06 04:58:08,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:58:08,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662508032] [2022-12-06 04:58:08,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:58:08,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:58:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:58:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:58:08,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:58:08,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662508032] [2022-12-06 04:58:08,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662508032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:58:08,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:58:08,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:58:08,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050871812] [2022-12-06 04:58:08,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:58:08,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:58:08,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:58:08,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:58:08,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:58:08,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 4 [2022-12-06 04:58:08,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 4 transitions, 24 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:58:08,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:58:08,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 4 [2022-12-06 04:58:08,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:58:08,433 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-06 04:58:08,433 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 04:58:08,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 conditions, 3 events. 0/3 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 1/4 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:58:08,433 INFO L137 encePairwiseOnDemand]: 2/4 looper letters, 0 selfloop transitions, 0 changer transitions 3/3 dead transitions. [2022-12-06 04:58:08,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 3 transitions, 20 flow [2022-12-06 04:58:08,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:58:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:58:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2022-12-06 04:58:08,434 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 04:58:08,434 INFO L175 Difference]: Start difference. First operand has 14 places, 4 transitions, 24 flow. Second operand 3 states and 4 transitions. [2022-12-06 04:58:08,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 3 transitions, 20 flow [2022-12-06 04:58:08,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 3 transitions, 15 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:58:08,434 INFO L231 Difference]: Finished difference. Result has 11 places, 0 transitions, 0 flow [2022-12-06 04:58:08,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=4, PETRI_DIFFERENCE_MINUEND_FLOW=9, PETRI_DIFFERENCE_MINUEND_PLACES=9, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=11, PETRI_TRANSITIONS=0} [2022-12-06 04:58:08,435 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -17 predicate places. [2022-12-06 04:58:08,435 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:58:08,435 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 11 places, 0 transitions, 0 flow [2022-12-06 04:58:08,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 04:58:08,435 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 04:58:08,436 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:58:08,436 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-06 04:58:08,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 04:58:08,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 04:58:08,436 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:58:08,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 04:58:08,438 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 04:58:08,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:58:08,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:58:08,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:58:08,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:58:08,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-12-06 04:58:08,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-12-06 04:58:08,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-12-06 04:58:08,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:58:08,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:58:08,441 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:58:08,444 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:58:08,444 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:58:08,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:58:08 BasicIcfg [2022-12-06 04:58:08,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:58:08,447 INFO L158 Benchmark]: Toolchain (without parser) took 5210.40ms. Allocated memory was 224.4MB in the beginning and 276.8MB in the end (delta: 52.4MB). Free memory was 186.7MB in the beginning and 121.5MB in the end (delta: 65.1MB). Peak memory consumption was 119.1MB. Max. memory is 8.0GB. [2022-12-06 04:58:08,447 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 224.4MB. Free memory is still 201.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:58:08,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.65ms. Allocated memory is still 224.4MB. Free memory was 186.7MB in the beginning and 167.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-06 04:58:08,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.48ms. Allocated memory is still 224.4MB. Free memory was 167.8MB in the beginning and 165.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:58:08,447 INFO L158 Benchmark]: Boogie Preprocessor took 27.72ms. Allocated memory is still 224.4MB. Free memory was 165.7MB in the beginning and 164.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:58:08,447 INFO L158 Benchmark]: RCFGBuilder took 327.06ms. Allocated memory is still 224.4MB. Free memory was 164.1MB in the beginning and 151.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 04:58:08,448 INFO L158 Benchmark]: TraceAbstraction took 4411.15ms. Allocated memory was 224.4MB in the beginning and 276.8MB in the end (delta: 52.4MB). Free memory was 150.5MB in the beginning and 121.5MB in the end (delta: 29.0MB). Peak memory consumption was 82.4MB. Max. memory is 8.0GB. [2022-12-06 04:58:08,449 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 224.4MB. Free memory is still 201.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 388.65ms. Allocated memory is still 224.4MB. Free memory was 186.7MB in the beginning and 167.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.48ms. Allocated memory is still 224.4MB. Free memory was 167.8MB in the beginning and 165.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.72ms. Allocated memory is still 224.4MB. Free memory was 165.7MB in the beginning and 164.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 327.06ms. Allocated memory is still 224.4MB. Free memory was 164.1MB in the beginning and 151.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4411.15ms. Allocated memory was 224.4MB in the beginning and 276.8MB in the end (delta: 52.4MB). Free memory was 150.5MB in the beginning and 121.5MB in the end (delta: 29.0MB). Peak memory consumption was 82.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 76 PlacesBefore, 28 PlacesAfterwards, 76 TransitionsBefore, 27 TransitionsAfterwards, 1040 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 27 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1256, independent: 1138, independent conditional: 1138, independent unconditional: 0, dependent: 118, dependent conditional: 118, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1256, independent: 1138, independent conditional: 0, independent unconditional: 1138, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1256, independent: 1138, independent conditional: 0, independent unconditional: 1138, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1256, independent: 1138, independent conditional: 0, independent unconditional: 1138, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 845, independent: 811, independent conditional: 0, independent unconditional: 811, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 845, independent: 734, independent conditional: 0, independent unconditional: 734, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 111, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1256, independent: 327, independent conditional: 0, independent unconditional: 327, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 845, unknown conditional: 0, unknown unconditional: 845] , Statistics on independence cache: Total cache size (in pairs): 1582, Positive cache size: 1548, Positive conditional cache size: 0, Positive unconditional cache size: 1548, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, 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, 23 PlacesBefore, 23 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 30, unknown conditional: 0, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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, 27 PlacesBefore, 27 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 21, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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, 32 PlacesBefore, 31 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 52, independent conditional: 10, independent unconditional: 42, dependent: 28, dependent conditional: 12, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 52, independent conditional: 4, independent unconditional: 48, dependent: 28, dependent conditional: 12, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 52, independent conditional: 4, independent unconditional: 48, dependent: 28, dependent conditional: 12, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 49, independent conditional: 2, independent unconditional: 47, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 33, Positive conditional cache size: 2, Positive unconditional cache size: 31, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 92, independent: 54, independent conditional: 6, independent unconditional: 48, dependent: 38, dependent conditional: 18, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 94, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 40, dependent conditional: 20, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 94, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 40, dependent conditional: 20, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 36, dependent conditional: 16, dependent unconditional: 20, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 37, Positive conditional cache size: 2, Positive unconditional cache size: 35, Negative cache size: 29, Negative conditional cache size: 8, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 26 PlacesBefore, 17 PlacesAfterwards, 17 TransitionsBefore, 9 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 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): 68, Positive cache size: 39, Positive conditional cache size: 2, Positive unconditional cache size: 37, Negative cache size: 29, Negative conditional cache size: 8, Negative unconditional cache size: 21, 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, 15 PlacesBefore, 14 PlacesAfterwards, 5 TransitionsBefore, 4 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 39, Positive conditional cache size: 2, Positive unconditional cache size: 37, Negative cache size: 29, Negative conditional cache size: 8, Negative unconditional cache size: 21, 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): 68, Positive cache size: 39, Positive conditional cache size: 2, Positive unconditional cache size: 37, Negative cache size: 29, Negative conditional cache size: 8, Negative unconditional cache size: 21, 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, 107 locations, 7 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: 4.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 249 IncrementalHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 10 mSDtfsCounter, 249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=4, InterpolantAutomatonStates: 23, 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.5s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-06 04:58:08,471 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...