/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 14:36:00,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 14:36:00,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 14:36:00,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 14:36:00,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 14:36:00,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 14:36:00,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 14:36:00,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 14:36:00,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 14:36:00,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 14:36:00,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 14:36:00,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 14:36:00,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 14:36:00,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 14:36:00,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 14:36:00,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 14:36:00,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 14:36:00,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 14:36:00,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 14:36:00,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 14:36:00,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 14:36:00,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 14:36:00,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 14:36:00,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 14:36:00,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 14:36:00,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 14:36:00,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 14:36:00,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 14:36:00,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 14:36:00,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 14:36:00,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 14:36:00,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 14:36:00,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 14:36:00,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 14:36:00,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 14:36:00,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 14:36:00,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 14:36:00,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 14:36:00,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 14:36:00,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 14:36:00,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 14:36:00,595 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 14:36:00,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 14:36:00,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 14:36:00,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 14:36:00,618 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 14:36:00,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 14:36:00,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 14:36:00,619 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 14:36:00,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 14:36:00,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 14:36:00,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 14:36:00,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 14:36:00,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 14:36:00,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 14:36:00,620 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 14:36:00,620 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 14:36:00,620 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 14:36:00,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 14:36:00,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 14:36:00,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 14:36:00,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 14:36:00,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 14:36:00,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:36:00,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 14:36:00,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 14:36:00,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 14:36:00,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 14:36:00,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 14:36:00,621 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 14:36:00,622 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 14:36:00,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 14:36:00,622 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 14:36:00,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 14:36:00,623 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 14:36:00,623 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 14:36:00,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 14:36:00,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 14:36:00,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 14:36:00,819 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 14:36:00,819 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 14:36:00,820 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2022-01-10 14:36:00,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0b7dbe34/e7aa06b02fe8447399a386ce767ff747/FLAG69daf4f2a [2022-01-10 14:36:01,293 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 14:36:01,294 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2022-01-10 14:36:01,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0b7dbe34/e7aa06b02fe8447399a386ce767ff747/FLAG69daf4f2a [2022-01-10 14:36:01,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0b7dbe34/e7aa06b02fe8447399a386ce767ff747 [2022-01-10 14:36:01,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 14:36:01,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 14:36:01,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 14:36:01,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 14:36:01,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 14:36:01,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132cc5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01, skipping insertion in model container [2022-01-10 14:36:01,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 14:36:01,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 14:36:01,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c[586,599] [2022-01-10 14:36:01,526 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 14:36:01,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:36:01,547 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-10 14:36:01,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 14:36:01,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c[586,599] [2022-01-10 14:36:01,560 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 14:36:01,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:36:01,581 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 14:36:01,590 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c[586,599] [2022-01-10 14:36:01,596 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 14:36:01,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:36:01,616 INFO L208 MainTranslator]: Completed translation [2022-01-10 14:36:01,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01 WrapperNode [2022-01-10 14:36:01,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 14:36:01,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 14:36:01,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 14:36:01,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 14:36:01,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,657 INFO L137 Inliner]: procedures = 31, calls = 64, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 136 [2022-01-10 14:36:01,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 14:36:01,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 14:36:01,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 14:36:01,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 14:36:01,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 14:36:01,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 14:36:01,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 14:36:01,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 14:36:01,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:36:01,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:36:01,737 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-01-10 14:36:01,741 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-01-10 14:36:01,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 14:36:01,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 14:36:01,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 14:36:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 14:36:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-01-10 14:36:01,766 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-01-10 14:36:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 14:36:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 14:36:01,766 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-01-10 14:36:01,766 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-01-10 14:36:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 14:36:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-01-10 14:36:01,767 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-01-10 14:36:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 14:36:01,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 14:36:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-01-10 14:36:01,767 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-01-10 14:36:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 14:36:01,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 14:36:01,851 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 14:36:01,852 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 14:36:02,277 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 14:36:02,283 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 14:36:02,284 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 14:36:02,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:02 BoogieIcfgContainer [2022-01-10 14:36:02,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 14:36:02,286 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 14:36:02,286 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 14:36:02,287 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 14:36:02,290 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:02" (1/1) ... [2022-01-10 14:36:02,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:36:02 BasicIcfg [2022-01-10 14:36:02,436 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 14:36:02,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 14:36:02,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 14:36:02,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 14:36:02,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:36:01" (1/4) ... [2022-01-10 14:36:02,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7876a687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:36:02, skipping insertion in model container [2022-01-10 14:36:02,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (2/4) ... [2022-01-10 14:36:02,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7876a687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:36:02, skipping insertion in model container [2022-01-10 14:36:02,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:02" (3/4) ... [2022-01-10 14:36:02,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7876a687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:36:02, skipping insertion in model container [2022-01-10 14:36:02,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:36:02" (4/4) ... [2022-01-10 14:36:02,447 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.cTransformedIcfg [2022-01-10 14:36:02,451 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 14:36:02,451 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-10 14:36:02,486 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 14:36:02,490 INFO L339 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=true, mAutomataTypeConcurrency=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 14:36:02,491 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-10 14:36:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 63 states have internal predecessors, (83), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-10 14:36:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 14:36:02,509 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:02,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:02,510 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:36:02,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1632809138, now seen corresponding path program 1 times [2022-01-10 14:36:02,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:02,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218991201] [2022-01-10 14:36:02,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:02,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:02,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:02,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 14:36:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:02,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 14:36:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:02,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 14:36:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:36:02,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:02,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218991201] [2022-01-10 14:36:02,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218991201] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:36:02,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:36:02,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 14:36:02,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560153847] [2022-01-10 14:36:02,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:36:02,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:36:02,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:03,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:36:03,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:36:03,008 INFO L87 Difference]: Start difference. First operand has 82 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 63 states have internal predecessors, (83), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 14:36:05,331 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 14:36:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:05,394 INFO L93 Difference]: Finished difference Result 146 states and 201 transitions. [2022-01-10 14:36:05,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:36:05,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-01-10 14:36:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:05,405 INFO L225 Difference]: With dead ends: 146 [2022-01-10 14:36:05,405 INFO L226 Difference]: Without dead ends: 83 [2022-01-10 14:36:05,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 14:36:05,410 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 48 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 36 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:05,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 312 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 157 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-10 14:36:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-10 14:36:05,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2022-01-10 14:36:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 59 states have internal predecessors, (69), 14 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-01-10 14:36:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2022-01-10 14:36:05,456 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 31 [2022-01-10 14:36:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:05,456 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2022-01-10 14:36:05,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 14:36:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-01-10 14:36:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 14:36:05,460 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:05,460 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:05,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 14:36:05,461 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:36:05,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1827105273, now seen corresponding path program 1 times [2022-01-10 14:36:05,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:05,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707012576] [2022-01-10 14:36:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:05,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:05,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:05,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 14:36:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:05,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 14:36:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:05,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:05,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 14:36:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:05,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-10 14:36:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 14:36:05,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:05,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707012576] [2022-01-10 14:36:05,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707012576] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:36:05,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048574555] [2022-01-10 14:36:05,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:05,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:05,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:36:05,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 14:36:05,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 14:36:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:06,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-10 14:36:06,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:36:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 14:36:06,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 14:36:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 14:36:06,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048574555] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 14:36:06,821 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 14:36:06,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 22 [2022-01-10 14:36:06,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142859716] [2022-01-10 14:36:06,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 14:36:06,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-10 14:36:06,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:06,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-10 14:36:06,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-01-10 14:36:06,824 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (15), 4 states have call predecessors, (15), 8 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) [2022-01-10 14:36:09,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 14:36:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:09,618 INFO L93 Difference]: Finished difference Result 151 states and 202 transitions. [2022-01-10 14:36:09,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 14:36:09,618 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (15), 4 states have call predecessors, (15), 8 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) Word has length 43 [2022-01-10 14:36:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:09,620 INFO L225 Difference]: With dead ends: 151 [2022-01-10 14:36:09,621 INFO L226 Difference]: Without dead ends: 85 [2022-01-10 14:36:09,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2022-01-10 14:36:09,622 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 78 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:09,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 912 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 673 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-01-10 14:36:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-10 14:36:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2022-01-10 14:36:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.25) internal successors, (70), 61 states have internal predecessors, (70), 14 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (19), 14 states have call predecessors, (19), 14 states have call successors, (19) [2022-01-10 14:36:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2022-01-10 14:36:09,645 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 103 transitions. Word has length 43 [2022-01-10 14:36:09,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:09,646 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 103 transitions. [2022-01-10 14:36:09,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (15), 4 states have call predecessors, (15), 8 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) [2022-01-10 14:36:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2022-01-10 14:36:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-10 14:36:09,650 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:09,651 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:09,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 14:36:09,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:09,851 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:36:09,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:09,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2021616443, now seen corresponding path program 1 times [2022-01-10 14:36:09,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:09,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809275790] [2022-01-10 14:36:09,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:09,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:09,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 14:36:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:09,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 14:36:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:09,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 14:36:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:10,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 14:36:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:10,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:10,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 14:36:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:10,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-10 14:36:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-10 14:36:10,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:10,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809275790] [2022-01-10 14:36:10,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809275790] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:36:10,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:36:10,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 14:36:10,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504824438] [2022-01-10 14:36:10,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:36:10,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 14:36:10,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:10,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 14:36:10,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:36:10,052 INFO L87 Difference]: Start difference. First operand 80 states and 103 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 14:36:12,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 14:36:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:12,415 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2022-01-10 14:36:12,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 14:36:12,416 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-01-10 14:36:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:12,418 INFO L225 Difference]: With dead ends: 141 [2022-01-10 14:36:12,418 INFO L226 Difference]: Without dead ends: 85 [2022-01-10 14:36:12,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-10 14:36:12,419 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 135 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:12,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 372 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-10 14:36:12,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-10 14:36:12,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2022-01-10 14:36:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 14 states have call successors, (14), 4 states have call predecessors, (14), 7 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21) [2022-01-10 14:36:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2022-01-10 14:36:12,432 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 53 [2022-01-10 14:36:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:12,432 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2022-01-10 14:36:12,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 14:36:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-01-10 14:36:12,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 14:36:12,436 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:12,436 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:12,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 14:36:12,436 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:36:12,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:12,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1498922260, now seen corresponding path program 1 times [2022-01-10 14:36:12,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:12,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044056897] [2022-01-10 14:36:12,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:12,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:12,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:12,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 14:36:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:12,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 14:36:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:12,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 14:36:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:12,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:12,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 14:36:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:12,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 14:36:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:12,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:12,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 14:36:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:12,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-10 14:36:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-01-10 14:36:12,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:12,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044056897] [2022-01-10 14:36:12,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044056897] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:36:12,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:36:12,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 14:36:12,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224285071] [2022-01-10 14:36:12,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:36:12,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 14:36:12,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:12,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 14:36:12,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:36:12,618 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 14:36:14,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 14:36:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:15,027 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-01-10 14:36:15,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 14:36:15,027 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 66 [2022-01-10 14:36:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:15,029 INFO L225 Difference]: With dead ends: 133 [2022-01-10 14:36:15,029 INFO L226 Difference]: Without dead ends: 85 [2022-01-10 14:36:15,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-10 14:36:15,030 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 98 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:15,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 404 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 296 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-10 14:36:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-10 14:36:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-01-10 14:36:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 65 states have internal predecessors, (72), 14 states have call successors, (14), 4 states have call predecessors, (14), 8 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) [2022-01-10 14:36:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2022-01-10 14:36:15,040 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 66 [2022-01-10 14:36:15,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:15,040 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2022-01-10 14:36:15,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 14:36:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2022-01-10 14:36:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-10 14:36:15,041 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:15,041 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:15,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 14:36:15,042 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:36:15,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:15,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1876670571, now seen corresponding path program 1 times [2022-01-10 14:36:15,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:15,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283483791] [2022-01-10 14:36:15,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:15,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:15,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:15,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 14:36:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:15,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 14:36:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:15,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 14:36:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:15,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 14:36:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:15,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 14:36:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:15,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 14:36:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:15,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-10 14:36:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:15,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:15,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 14:36:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 14:36:15,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:15,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283483791] [2022-01-10 14:36:15,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283483791] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:36:15,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:36:15,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 14:36:15,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528222327] [2022-01-10 14:36:15,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:36:15,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:36:15,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:15,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:36:15,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:36:15,482 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-10 14:36:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:16,298 INFO L93 Difference]: Finished difference Result 139 states and 181 transitions. [2022-01-10 14:36:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:36:16,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2022-01-10 14:36:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:16,299 INFO L225 Difference]: With dead ends: 139 [2022-01-10 14:36:16,300 INFO L226 Difference]: Without dead ends: 87 [2022-01-10 14:36:16,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:36:16,301 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 115 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:16,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 156 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 14:36:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-10 14:36:16,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-01-10 14:36:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 67 states have internal predecessors, (74), 14 states have call successors, (14), 4 states have call predecessors, (14), 8 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) [2022-01-10 14:36:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2022-01-10 14:36:16,313 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 78 [2022-01-10 14:36:16,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:16,313 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2022-01-10 14:36:16,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-10 14:36:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2022-01-10 14:36:16,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-10 14:36:16,314 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:16,315 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:16,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 14:36:16,315 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:36:16,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:16,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1933398681, now seen corresponding path program 1 times [2022-01-10 14:36:16,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:16,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082317444] [2022-01-10 14:36:16,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:16,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:16,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 14:36:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:16,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 14:36:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:16,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 14:36:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:16,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:16,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 14:36:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:16,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 14:36:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:16,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:16,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 14:36:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:16,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-10 14:36:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:16,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:16,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 14:36:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 14:36:16,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:16,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082317444] [2022-01-10 14:36:16,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082317444] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:36:16,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351473646] [2022-01-10 14:36:16,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:16,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:16,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:36:16,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 14:36:16,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 14:36:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:17,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 14:36:17,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:36:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 14:36:17,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 14:36:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 14:36:17,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351473646] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 14:36:17,791 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 14:36:17,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 4] total 14 [2022-01-10 14:36:17,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366848802] [2022-01-10 14:36:17,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 14:36:17,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 14:36:17,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:17,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 14:36:17,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-10 14:36:17,793 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-10 14:36:20,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 14:36:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:20,574 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions. [2022-01-10 14:36:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 14:36:20,575 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 79 [2022-01-10 14:36:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:20,576 INFO L225 Difference]: With dead ends: 142 [2022-01-10 14:36:20,577 INFO L226 Difference]: Without dead ends: 89 [2022-01-10 14:36:20,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-01-10 14:36:20,578 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 54 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:20,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 615 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 406 Invalid, 1 Unknown, 88 Unchecked, 2.5s Time] [2022-01-10 14:36:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-10 14:36:20,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-01-10 14:36:20,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 69 states have internal predecessors, (76), 14 states have call successors, (14), 4 states have call predecessors, (14), 8 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) [2022-01-10 14:36:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2022-01-10 14:36:20,590 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 79 [2022-01-10 14:36:20,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:20,591 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2022-01-10 14:36:20,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-10 14:36:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2022-01-10 14:36:20,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 14:36:20,592 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:20,592 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:20,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-10 14:36:20,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 14:36:20,808 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:36:20,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:20,808 INFO L85 PathProgramCache]: Analyzing trace with hash -213538795, now seen corresponding path program 2 times [2022-01-10 14:36:20,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:20,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283609370] [2022-01-10 14:36:20,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:20,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:21,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:21,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 14:36:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:21,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 14:36:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:21,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 14:36:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:21,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:21,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 14:36:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:21,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 14:36:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:21,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:21,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 14:36:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:21,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-10 14:36:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:21,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 14:36:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:21,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 14:36:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 14:36:21,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:21,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283609370] [2022-01-10 14:36:21,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283609370] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:36:21,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469830430] [2022-01-10 14:36:21,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 14:36:21,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:21,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:36:21,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 14:36:21,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 14:36:49,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 14:36:49,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 14:36:49,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-10 14:36:49,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:36:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-01-10 14:36:50,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 14:36:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-10 14:36:51,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469830430] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 14:36:51,423 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 14:36:51,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 7] total 30 [2022-01-10 14:36:51,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890621847] [2022-01-10 14:36:51,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 14:36:51,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-10 14:36:51,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:51,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-10 14:36:51,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2022-01-10 14:36:51,425 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 30 states, 30 states have (on average 2.8) internal successors, (84), 25 states have internal predecessors, (84), 9 states have call successors, (29), 4 states have call predecessors, (29), 7 states have return successors, (27), 10 states have call predecessors, (27), 9 states have call successors, (27) [2022-01-10 14:36:54,593 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 14:36:54,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:54,942 INFO L93 Difference]: Finished difference Result 173 states and 226 transitions. [2022-01-10 14:36:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-10 14:36:54,943 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.8) internal successors, (84), 25 states have internal predecessors, (84), 9 states have call successors, (29), 4 states have call predecessors, (29), 7 states have return successors, (27), 10 states have call predecessors, (27), 9 states have call successors, (27) Word has length 80 [2022-01-10 14:36:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:54,944 INFO L225 Difference]: With dead ends: 173 [2022-01-10 14:36:54,944 INFO L226 Difference]: Without dead ends: 117 [2022-01-10 14:36:54,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=279, Invalid=2373, Unknown=0, NotChecked=0, Total=2652 [2022-01-10 14:36:54,946 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 90 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 71 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:54,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 1132 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1009 Invalid, 1 Unknown, 68 Unchecked, 2.8s Time] [2022-01-10 14:36:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-01-10 14:36:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2022-01-10 14:36:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.21875) internal successors, (78), 71 states have internal predecessors, (78), 14 states have call successors, (14), 4 states have call predecessors, (14), 8 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) [2022-01-10 14:36:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 116 transitions. [2022-01-10 14:36:54,959 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 116 transitions. Word has length 80 [2022-01-10 14:36:54,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:54,959 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 116 transitions. [2022-01-10 14:36:54,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.8) internal successors, (84), 25 states have internal predecessors, (84), 9 states have call successors, (29), 4 states have call predecessors, (29), 7 states have return successors, (27), 10 states have call predecessors, (27), 9 states have call successors, (27) [2022-01-10 14:36:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2022-01-10 14:36:54,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-10 14:36:54,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:54,961 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:54,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 14:36:55,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:55,178 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:36:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:55,179 INFO L85 PathProgramCache]: Analyzing trace with hash 328263829, now seen corresponding path program 3 times [2022-01-10 14:36:55,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:55,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023979502] [2022-01-10 14:36:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:55,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 14:36:55,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 14:36:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 14:36:56,955 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 14:36:56,956 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 14:36:56,957 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-10 14:36:56,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-10 14:36:56,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-10 14:36:56,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-10 14:36:56,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 14:36:56,962 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-01-10 14:36:56,965 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 14:36:57,052 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,054 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,056 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,057 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,061 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,061 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,061 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,061 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 14:36:57,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:36:57 BasicIcfg [2022-01-10 14:36:57,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 14:36:57,103 INFO L158 Benchmark]: Toolchain (without parser) took 55779.27ms. Allocated memory was 200.3MB in the beginning and 310.4MB in the end (delta: 110.1MB). Free memory was 145.0MB in the beginning and 239.2MB in the end (delta: -94.2MB). Peak memory consumption was 156.0MB. Max. memory is 8.0GB. [2022-01-10 14:36:57,103 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 14:36:57,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.44ms. Allocated memory was 200.3MB in the beginning and 257.9MB in the end (delta: 57.7MB). Free memory was 144.8MB in the beginning and 226.2MB in the end (delta: -81.4MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2022-01-10 14:36:57,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.75ms. Allocated memory is still 257.9MB. Free memory was 226.2MB in the beginning and 224.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 14:36:57,104 INFO L158 Benchmark]: Boogie Preprocessor took 45.98ms. Allocated memory is still 257.9MB. Free memory was 224.1MB in the beginning and 222.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 14:36:57,104 INFO L158 Benchmark]: RCFGBuilder took 580.97ms. Allocated memory is still 257.9MB. Free memory was 222.0MB in the beginning and 200.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-01-10 14:36:57,104 INFO L158 Benchmark]: IcfgTransformer took 150.47ms. Allocated memory is still 257.9MB. Free memory was 200.0MB in the beginning and 187.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 14:36:57,105 INFO L158 Benchmark]: TraceAbstraction took 54664.42ms. Allocated memory was 257.9MB in the beginning and 310.4MB in the end (delta: 52.4MB). Free memory was 187.4MB in the beginning and 239.2MB in the end (delta: -51.8MB). Peak memory consumption was 141.1MB. Max. memory is 8.0GB. [2022-01-10 14:36:57,106 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.11ms. Allocated memory is still 200.3MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 291.44ms. Allocated memory was 200.3MB in the beginning and 257.9MB in the end (delta: 57.7MB). Free memory was 144.8MB in the beginning and 226.2MB in the end (delta: -81.4MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.75ms. Allocated memory is still 257.9MB. Free memory was 226.2MB in the beginning and 224.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.98ms. Allocated memory is still 257.9MB. Free memory was 224.1MB in the beginning and 222.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 580.97ms. Allocated memory is still 257.9MB. Free memory was 222.0MB in the beginning and 200.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * IcfgTransformer took 150.47ms. Allocated memory is still 257.9MB. Free memory was 200.0MB in the beginning and 187.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 54664.42ms. Allocated memory was 257.9MB in the beginning and 310.4MB in the end (delta: 52.4MB). Free memory was 187.4MB in the beginning and 239.2MB in the end (delta: -51.8MB). Peak memory consumption was 141.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L110] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-3:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-3:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-3:0}, n={-3:0}] [L110] RET, EXPR nondet_tree() VAL [nondet_tree()={-3:0}] [L110] CALL task(nondet_tree()) [L86] CALL, EXPR min(t) VAL [n={-3:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [a=2147483647, n={-3:0}, n={-3:0}, n->left={0:0}] [L41] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=-1, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=-1, n={-3:0}, n={-3:0}, n->left={0:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [a=2147483647, b=2147483647, n={-3:0}, n={-3:0}, n->right={0:0}] [L42] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=-1, n={0:0}, n={0:0}] [L42] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=-1, n={-3:0}, n={-3:0}, n->right={0:0}] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\result=-1, a=2147483647, b=2147483647, c=2147483647, n={-3:0}, n={-3:0}] [L86] RET, EXPR min(t) VAL [min(t)=-1, t={-3:0}, t={-3:0}] [L86] int a = min(t); [L87] int b; VAL [a=2147483647, b={-1:0}, t={-3:0}, t={-3:0}] [L89] CALL, EXPR size(t) VAL [t={-3:0}] [L81] COND FALSE !(!t) [L82] EXPR t->left VAL [t={-3:0}, t={-3:0}, t->left={0:0}] [L82] CALL, EXPR size(t->left) VAL [t={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L82] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-3:0}, t={-3:0}, t->left={0:0}] [L82] EXPR t->right VAL [size(t->left)=0, t={-3:0}, t={-3:0}, t->left={0:0}, t->right={0:0}] [L82] CALL, EXPR size(t->right) VAL [t={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L82] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-3:0}, t={-3:0}, t->left={0:0}, t->right={0:0}] [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) VAL [a=2147483647, b={-1:0}, size(t)=-1, t={-3:0}, t={-3:0}] [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume_cycle_if_not(n != 0) [L91] EXPR, FCALL calloc(n, sizeof(int)) [L91] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={-1:0}, calloc(n, sizeof(int))={-4:0}, n=1, t={-3:0}, t={-3:0}, x={-4:0}] [L92] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-4:0}, t={-3:0}] [L70] COND FALSE !(!t) [L73] EXPR t->left VAL [\old(i)=1, a={-4:0}, a={-4:0}, i=1, t={-3:0}, t={-3:0}, t->left={0:0}] [L73] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-4:0}, t={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(i)=1, \result=-1, a={-4:0}, a={-4:0}, i=1, t={0:0}, t={0:0}] [L73] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-4:0}, a={-4:0}, i=1, t={-3:0}, t={-3:0}, t->left={0:0}, tree_inorder(t->left, a, i)=-1] [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right VAL [\old(i)=1, a={-4:0}, a={-4:0}, i=2, t={-3:0}, t={-3:0}, t->right={0:0}] [L75] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-4:0}, t={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(i)=2, \result=-2, a={-4:0}, a={-4:0}, i=2, t={0:0}, t={0:0}] [L75] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-4:0}, a={-4:0}, i=2, t={-3:0}, t={-3:0}, t->right={0:0}, tree_inorder(t->right, a, i)=-2] [L75] i = tree_inorder(t->right, a, i) [L76] return i; VAL [\old(i)=1, \result=-2, a={-4:0}, a={-4:0}, i=2, t={-3:0}, t={-3:0}] [L92] RET tree_inorder(t, x, n) VAL [a=2147483647, b={-1:0}, calloc(n, sizeof(int))={-4:0}, n=1, t={-3:0}, t={-3:0}, tree_inorder(t, x, n)=-2, x={-4:0}] [L93] EXPR x[0] [L93] CALL __VERIFIER_assert(a == x[0]) [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 82 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 54.5s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 650 SdHoareTripleChecker+Valid, 15.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 618 mSDsluCounter, 3903 SdHoareTripleChecker+Invalid, 15.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 156 IncrementalHoareTripleChecker+Unchecked, 3349 mSDsCounter, 303 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2894 IncrementalHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 303 mSolverCounterUnsat, 554 mSDtfsCounter, 2894 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 623 GetRequests, 494 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=7, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 43 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 29.6s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 714 NumberOfCodeBlocks, 714 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 821 ConstructedInterpolants, 5 QuantifiedInterpolants, 3167 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2757 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 389/417 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 14:36:57,138 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...