/usr/bin/java -ea -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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 22:01:30,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:01:30,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:01:30,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:01:30,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:01:30,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:01:30,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:01:30,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:01:30,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:01:30,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:01:30,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:01:30,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:01:30,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:01:30,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:01:30,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:01:30,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:01:30,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:01:30,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:01:30,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:01:30,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:01:30,660 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:01:30,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:01:30,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:01:30,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:01:30,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:01:30,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:01:30,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:01:30,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:01:30,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:01:30,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:01:30,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:01:30,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:01:30,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:01:30,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:01:30,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:01:30,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:01:30,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:01:30,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:01:30,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:01:30,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:01:30,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:01:30,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:01:30,675 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:01:30,697 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:01:30,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:01:30,698 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:01:30,698 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:01:30,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:01:30,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:01:30,699 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:01:30,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:01:30,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:01:30,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:01:30,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:01:30,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:01:30,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:01:30,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:01:30,700 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:01:30,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:01:30,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:01:30,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:01:30,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:01:30,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:01:30,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:01:30,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:01:30,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:01:30,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:01:30,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:01:30,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:01:30,701 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:01:30,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:01:30,702 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:01:30,702 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-04-07 22:01:30,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:01:30,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:01:30,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:01:30,923 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:01:30,924 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:01:30,924 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i [2022-04-07 22:01:30,977 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ec72eef3/00157e8f6c824ea184ad9652f027d727/FLAG1b76e9da6 [2022-04-07 22:01:31,343 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:01:31,343 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2022-04-07 22:01:31,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ec72eef3/00157e8f6c824ea184ad9652f027d727/FLAG1b76e9da6 [2022-04-07 22:01:31,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ec72eef3/00157e8f6c824ea184ad9652f027d727 [2022-04-07 22:01:31,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:01:31,368 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:01:31,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:01:31,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:01:31,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:01:31,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:01:31" (1/1) ... [2022-04-07 22:01:31,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25285b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:31, skipping insertion in model container [2022-04-07 22:01:31,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:01:31" (1/1) ... [2022-04-07 22:01:31,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:01:31,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:01:31,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i[808,821] [2022-04-07 22:01:31,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:01:31,545 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:01:31,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i[808,821] [2022-04-07 22:01:31,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:01:31,563 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:01:31,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:31 WrapperNode [2022-04-07 22:01:31,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:01:31,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:01:31,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:01:31,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:01:31,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:31" (1/1) ... [2022-04-07 22:01:31,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:31" (1/1) ... [2022-04-07 22:01:31,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:31" (1/1) ... [2022-04-07 22:01:31,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:31" (1/1) ... [2022-04-07 22:01:31,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:31" (1/1) ... [2022-04-07 22:01:31,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:31" (1/1) ... [2022-04-07 22:01:31,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:31" (1/1) ... [2022-04-07 22:01:31,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:01:31,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:01:31,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:01:31,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:01:31,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:31" (1/1) ... [2022-04-07 22:01:31,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:01:31,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:01:31,624 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-04-07 22:01:31,638 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-04-07 22:01:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:01:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:01:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:01:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 22:01:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:01:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:01:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:01:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 22:01:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 22:01:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:01:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:01:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:01:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:01:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:01:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:01:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:01:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:01:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:01:31,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:01:31,725 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:01:31,727 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:01:31,796 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:01:31,801 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:01:31,801 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 22:01:31,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:01:31 BoogieIcfgContainer [2022-04-07 22:01:31,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:01:31,803 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:01:31,803 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:01:31,804 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:01:31,806 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:01:31" (1/1) ... [2022-04-07 22:01:31,808 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:01:31,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:01:31 BasicIcfg [2022-04-07 22:01:31,849 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:01:31,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:01:31,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:01:31,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:01:31,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:01:31" (1/4) ... [2022-04-07 22:01:31,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621195e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:01:31, skipping insertion in model container [2022-04-07 22:01:31,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:31" (2/4) ... [2022-04-07 22:01:31,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621195e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:01:31, skipping insertion in model container [2022-04-07 22:01:31,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:01:31" (3/4) ... [2022-04-07 22:01:31,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621195e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:01:31, skipping insertion in model container [2022-04-07 22:01:31,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:01:31" (4/4) ... [2022-04-07 22:01:31,853 INFO L111 eAbstractionObserver]: Analyzing ICFG sum04-2.iqvasr [2022-04-07 22:01:31,857 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:01:31,857 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:01:31,925 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:01:31,930 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-07 22:01:31,930 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:01:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:01:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 22:01:31,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:31,965 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:31,965 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:31,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:31,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1795998501, now seen corresponding path program 1 times [2022-04-07 22:01:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:31,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745153670] [2022-04-07 22:01:31,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:31,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:32,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:32,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {22#true} is VALID [2022-04-07 22:01:32,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 22:01:32,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 22:01:32,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:32,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {22#true} is VALID [2022-04-07 22:01:32,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 22:01:32,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 22:01:32,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 22:01:32,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {22#true} is VALID [2022-04-07 22:01:32,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} [51] L24-3-->L24-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-07 22:01:32,143 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {23#false} is VALID [2022-04-07 22:01:32,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23#false} is VALID [2022-04-07 22:01:32,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} [58] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-07 22:01:32,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-07 22:01:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:32,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:32,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745153670] [2022-04-07 22:01:32,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745153670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:01:32,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:01:32,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 22:01:32,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064330919] [2022-04-07 22:01:32,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:01:32,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 22:01:32,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:32,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:32,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 22:01:32,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:32,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 22:01:32,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 22:01:32,193 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:32,270 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-07 22:01:32,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 22:01:32,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 22:01:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-07 22:01:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-07 22:01:32,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-04-07 22:01:32,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:32,338 INFO L225 Difference]: With dead ends: 30 [2022-04-07 22:01:32,339 INFO L226 Difference]: Without dead ends: 13 [2022-04-07 22:01:32,340 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 22:01:32,342 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:32,343 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 21 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:01:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-07 22:01:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-07 22:01:32,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:32,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,368 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,368 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:32,373 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 22:01:32,373 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 22:01:32,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:32,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:32,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-07 22:01:32,374 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-07 22:01:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:32,375 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 22:01:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 22:01:32,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:32,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:32,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:32,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-07 22:01:32,379 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-07 22:01:32,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:32,382 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-07 22:01:32,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 22:01:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 22:01:32,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:32,386 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:32,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:01:32,387 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1796922022, now seen corresponding path program 1 times [2022-04-07 22:01:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:32,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361861043] [2022-04-07 22:01:32,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:32,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:32,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:32,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {115#true} is VALID [2022-04-07 22:01:32,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-07 22:01:32,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115#true} {115#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-07 22:01:32,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {115#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:32,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {115#true} is VALID [2022-04-07 22:01:32,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {115#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-07 22:01:32,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115#true} {115#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-07 22:01:32,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {115#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-07 22:01:32,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {115#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {120#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 22:01:32,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {120#(= (+ (- 1) main_~i~0) 0)} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {116#false} is VALID [2022-04-07 22:01:32,463 INFO L272 TraceCheckUtils]: 7: Hoare triple {116#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {116#false} is VALID [2022-04-07 22:01:32,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {116#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {116#false} is VALID [2022-04-07 22:01:32,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {116#false} [58] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {116#false} is VALID [2022-04-07 22:01:32,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {116#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#false} is VALID [2022-04-07 22:01:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:32,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:32,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361861043] [2022-04-07 22:01:32,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361861043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:01:32,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:01:32,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 22:01:32,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584310025] [2022-04-07 22:01:32,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:01:32,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 22:01:32,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:32,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:32,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 22:01:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:32,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 22:01:32,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 22:01:32,480 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:32,549 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-07 22:01:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 22:01:32,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 22:01:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-07 22:01:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-07 22:01:32,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-04-07 22:01:32,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:32,572 INFO L225 Difference]: With dead ends: 20 [2022-04-07 22:01:32,572 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 22:01:32,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 22:01:32,576 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:32,577 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 18 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:01:32,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 22:01:32,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-07 22:01:32,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:32,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,582 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,582 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:32,584 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 22:01:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 22:01:32,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:32,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:32,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 22:01:32,585 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 22:01:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:32,587 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 22:01:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 22:01:32,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:32,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:32,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:32,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-07 22:01:32,589 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2022-04-07 22:01:32,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:32,590 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-07 22:01:32,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 22:01:32,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 22:01:32,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:32,591 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:32,591 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 22:01:32,591 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:32,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:32,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1176605188, now seen corresponding path program 1 times [2022-04-07 22:01:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:32,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065311109] [2022-04-07 22:01:32,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:32,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:32,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:32,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-07 22:01:32,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:01:32,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:01:32,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:32,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-07 22:01:32,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:01:32,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:01:32,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:01:32,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {213#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 22:01:32,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(= (+ (- 1) main_~i~0) 0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {213#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 22:01:32,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(= (+ (- 1) main_~i~0) 0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {214#(<= main_~i~0 2)} is VALID [2022-04-07 22:01:32,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(<= main_~i~0 2)} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 22:01:32,672 INFO L272 TraceCheckUtils]: 9: Hoare triple {209#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {209#false} is VALID [2022-04-07 22:01:32,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {209#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {209#false} is VALID [2022-04-07 22:01:32,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#false} [58] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 22:01:32,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 22:01:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:32,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:32,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065311109] [2022-04-07 22:01:32,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065311109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:01:32,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121748506] [2022-04-07 22:01:32,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:32,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:32,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:01:32,680 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-04-07 22:01:32,719 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-04-07 22:01:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:32,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 22:01:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:32,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:01:32,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:01:32,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-07 22:01:32,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:01:32,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:01:32,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:01:32,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {234#(<= main_~i~0 1)} is VALID [2022-04-07 22:01:32,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {234#(<= main_~i~0 1)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {234#(<= main_~i~0 1)} is VALID [2022-04-07 22:01:32,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(<= main_~i~0 1)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {214#(<= main_~i~0 2)} is VALID [2022-04-07 22:01:32,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(<= main_~i~0 2)} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 22:01:32,840 INFO L272 TraceCheckUtils]: 9: Hoare triple {209#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {209#false} is VALID [2022-04-07 22:01:32,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {209#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {209#false} is VALID [2022-04-07 22:01:32,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#false} [58] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 22:01:32,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 22:01:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:32,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:01:32,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 22:01:32,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#false} [58] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 22:01:32,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {209#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {209#false} is VALID [2022-04-07 22:01:32,918 INFO L272 TraceCheckUtils]: 9: Hoare triple {209#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {209#false} is VALID [2022-04-07 22:01:32,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#(<= main_~i~0 8)} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 22:01:32,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {272#(<= main_~i~0 7)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {268#(<= main_~i~0 8)} is VALID [2022-04-07 22:01:32,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {272#(<= main_~i~0 7)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {272#(<= main_~i~0 7)} is VALID [2022-04-07 22:01:32,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {272#(<= main_~i~0 7)} is VALID [2022-04-07 22:01:32,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:01:32,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:01:32,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:01:32,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-07 22:01:32,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:01:32,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:32,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121748506] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:01:32,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:01:32,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-07 22:01:32,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103402149] [2022-04-07 22:01:32,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:01:32,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 22:01:32,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:32,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:32,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:32,941 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 22:01:32,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:32,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 22:01:32,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-07 22:01:32,942 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:33,039 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-07 22:01:33,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 22:01:33,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 22:01:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-07 22:01:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-07 22:01:33,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-07 22:01:33,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:33,066 INFO L225 Difference]: With dead ends: 25 [2022-04-07 22:01:33,066 INFO L226 Difference]: Without dead ends: 20 [2022-04-07 22:01:33,066 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-07 22:01:33,067 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:33,067 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 23 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:01:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-07 22:01:33,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-07 22:01:33,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:33,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,072 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,072 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:33,073 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-07 22:01:33,073 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-07 22:01:33,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:33,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:33,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-07 22:01:33,074 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-07 22:01:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:33,075 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-07 22:01:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-07 22:01:33,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:33,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:33,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:33,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:33,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-07 22:01:33,076 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 13 [2022-04-07 22:01:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:33,076 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-07 22:01:33,076 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-07 22:01:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 22:01:33,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:33,077 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:33,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 22:01:33,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:33,292 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:33,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:33,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2042821406, now seen corresponding path program 2 times [2022-04-07 22:01:33,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:33,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252826815] [2022-04-07 22:01:33,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:33,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:33,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:33,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {413#true} is VALID [2022-04-07 22:01:33,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-07 22:01:33,422 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {413#true} {413#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-07 22:01:33,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:33,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {413#true} is VALID [2022-04-07 22:01:33,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-07 22:01:33,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-07 22:01:33,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-07 22:01:33,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {418#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 22:01:33,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {418#(= (+ (- 1) main_~i~0) 0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {418#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 22:01:33,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(= (+ (- 1) main_~i~0) 0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {419#(<= main_~i~0 2)} is VALID [2022-04-07 22:01:33,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#(<= main_~i~0 2)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {419#(<= main_~i~0 2)} is VALID [2022-04-07 22:01:33,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(<= main_~i~0 2)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {420#(<= main_~i~0 3)} is VALID [2022-04-07 22:01:33,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(<= main_~i~0 3)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {420#(<= main_~i~0 3)} is VALID [2022-04-07 22:01:33,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#(<= main_~i~0 3)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {421#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:33,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#(<= main_~i~0 4)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {421#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:33,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {421#(<= main_~i~0 4)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {422#(<= main_~i~0 5)} is VALID [2022-04-07 22:01:33,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {422#(<= main_~i~0 5)} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-07 22:01:33,429 INFO L272 TraceCheckUtils]: 15: Hoare triple {414#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {414#false} is VALID [2022-04-07 22:01:33,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {414#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {414#false} is VALID [2022-04-07 22:01:33,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {414#false} [58] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-07 22:01:33,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {414#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-07 22:01:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:33,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:33,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252826815] [2022-04-07 22:01:33,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252826815] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:01:33,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637600798] [2022-04-07 22:01:33,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 22:01:33,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:33,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:01:33,431 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-04-07 22:01:33,441 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-04-07 22:01:33,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 22:01:33,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 22:01:33,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 22:01:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:33,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:01:33,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-07 22:01:33,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {413#true} is VALID [2022-04-07 22:01:33,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-07 22:01:33,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-07 22:01:33,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-07 22:01:33,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {442#(<= main_~i~0 1)} is VALID [2022-04-07 22:01:33,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {442#(<= main_~i~0 1)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {442#(<= main_~i~0 1)} is VALID [2022-04-07 22:01:33,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {442#(<= main_~i~0 1)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {419#(<= main_~i~0 2)} is VALID [2022-04-07 22:01:33,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#(<= main_~i~0 2)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {419#(<= main_~i~0 2)} is VALID [2022-04-07 22:01:33,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(<= main_~i~0 2)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {420#(<= main_~i~0 3)} is VALID [2022-04-07 22:01:33,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(<= main_~i~0 3)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {420#(<= main_~i~0 3)} is VALID [2022-04-07 22:01:33,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#(<= main_~i~0 3)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {421#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:33,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#(<= main_~i~0 4)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {421#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:33,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {421#(<= main_~i~0 4)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {422#(<= main_~i~0 5)} is VALID [2022-04-07 22:01:33,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {422#(<= main_~i~0 5)} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-07 22:01:33,592 INFO L272 TraceCheckUtils]: 15: Hoare triple {414#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {414#false} is VALID [2022-04-07 22:01:33,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {414#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {414#false} is VALID [2022-04-07 22:01:33,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {414#false} [58] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-07 22:01:33,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {414#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-07 22:01:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:33,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:01:33,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {414#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-07 22:01:33,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {414#false} [58] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-07 22:01:33,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {414#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {414#false} is VALID [2022-04-07 22:01:33,734 INFO L272 TraceCheckUtils]: 15: Hoare triple {414#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {414#false} is VALID [2022-04-07 22:01:33,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {494#(<= main_~i~0 8)} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-07 22:01:33,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {498#(<= main_~i~0 7)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {494#(<= main_~i~0 8)} is VALID [2022-04-07 22:01:33,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {498#(<= main_~i~0 7)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {498#(<= main_~i~0 7)} is VALID [2022-04-07 22:01:33,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#(<= main_~i~0 6)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {498#(<= main_~i~0 7)} is VALID [2022-04-07 22:01:33,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(<= main_~i~0 6)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {505#(<= main_~i~0 6)} is VALID [2022-04-07 22:01:33,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#(<= main_~i~0 5)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {505#(<= main_~i~0 6)} is VALID [2022-04-07 22:01:33,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(<= main_~i~0 5)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {422#(<= main_~i~0 5)} is VALID [2022-04-07 22:01:33,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(<= main_~i~0 4)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {422#(<= main_~i~0 5)} is VALID [2022-04-07 22:01:33,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(<= main_~i~0 4)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {421#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:33,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {421#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:33,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-07 22:01:33,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-07 22:01:33,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-07 22:01:33,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {413#true} is VALID [2022-04-07 22:01:33,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-07 22:01:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:33,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637600798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:01:33,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:01:33,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-07 22:01:33,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926692711] [2022-04-07 22:01:33,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:01:33,746 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 22:01:33,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:33,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:33,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 22:01:33,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:33,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 22:01:33,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-07 22:01:33,775 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:33,941 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 22:01:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 22:01:33,942 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 22:01:33,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-07 22:01:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-07 22:01:33,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 36 transitions. [2022-04-07 22:01:33,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:33,974 INFO L225 Difference]: With dead ends: 33 [2022-04-07 22:01:33,974 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 22:01:33,975 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2022-04-07 22:01:33,975 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:33,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:01:33,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 22:01:33,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-07 22:01:33,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:33,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,983 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,983 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:33,984 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-07 22:01:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-07 22:01:33,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:33,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:33,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-07 22:01:33,985 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-07 22:01:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:33,986 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-07 22:01:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-07 22:01:33,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:33,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:33,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:33,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-07 22:01:33,987 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2022-04-07 22:01:33,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:33,988 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-07 22:01:33,988 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-07 22:01:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 22:01:33,988 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:33,988 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:34,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 22:01:34,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-07 22:01:34,203 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:34,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1851728790, now seen corresponding path program 3 times [2022-04-07 22:01:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:34,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639442716] [2022-04-07 22:01:34,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:34,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:34,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:34,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {722#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {706#true} is VALID [2022-04-07 22:01:34,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {706#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {706#true} is VALID [2022-04-07 22:01:34,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {706#true} {706#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {706#true} is VALID [2022-04-07 22:01:34,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {706#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {722#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:34,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {722#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {706#true} is VALID [2022-04-07 22:01:34,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {706#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {706#true} is VALID [2022-04-07 22:01:34,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {706#true} {706#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {706#true} is VALID [2022-04-07 22:01:34,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {706#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {706#true} is VALID [2022-04-07 22:01:34,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {706#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {711#(= main_~sn~0 0)} is VALID [2022-04-07 22:01:34,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {711#(= main_~sn~0 0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 22:01:34,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 22:01:34,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-07 22:01:34,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-07 22:01:34,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-07 22:01:34,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-07 22:01:34,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-07 22:01:34,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-07 22:01:34,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-07 22:01:34,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-07 22:01:34,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-07 22:01:34,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-07 22:01:34,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-07 22:01:34,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-07 22:01:34,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-07 22:01:34,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-07 22:01:34,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-07 22:01:34,382 INFO L272 TraceCheckUtils]: 23: Hoare triple {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {720#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:01:34,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {720#(not (= |__VERIFIER_assert_#in~cond| 0))} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {721#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:01:34,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {721#(not (= __VERIFIER_assert_~cond 0))} [58] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {707#false} is VALID [2022-04-07 22:01:34,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {707#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {707#false} is VALID [2022-04-07 22:01:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:34,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:34,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639442716] [2022-04-07 22:01:34,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639442716] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:01:34,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116434039] [2022-04-07 22:01:34,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 22:01:34,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:34,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:01:34,399 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-04-07 22:01:34,402 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-04-07 22:01:34,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-04-07 22:01:34,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 22:01:34,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-07 22:01:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:34,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:01:34,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {706#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {706#true} is VALID [2022-04-07 22:01:34,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {706#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {706#true} is VALID [2022-04-07 22:01:34,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {706#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {706#true} is VALID [2022-04-07 22:01:34,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {706#true} {706#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {706#true} is VALID [2022-04-07 22:01:34,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {706#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {706#true} is VALID [2022-04-07 22:01:34,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {706#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {711#(= main_~sn~0 0)} is VALID [2022-04-07 22:01:34,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {711#(= main_~sn~0 0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 22:01:34,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 22:01:34,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-07 22:01:34,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-07 22:01:34,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-07 22:01:34,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-07 22:01:34,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-07 22:01:34,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-07 22:01:34,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-07 22:01:34,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-07 22:01:34,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-07 22:01:34,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-07 22:01:34,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-07 22:01:34,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-07 22:01:34,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-07 22:01:34,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-07 22:01:34,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-07 22:01:34,755 INFO L272 TraceCheckUtils]: 23: Hoare triple {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {795#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:01:34,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 |__VERIFIER_assert_#in~cond|)} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {799#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:01:34,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {799#(<= 1 __VERIFIER_assert_~cond)} [58] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {707#false} is VALID [2022-04-07 22:01:34,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {707#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {707#false} is VALID [2022-04-07 22:01:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:34,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:01:35,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {707#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {707#false} is VALID [2022-04-07 22:01:35,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {799#(<= 1 __VERIFIER_assert_~cond)} [58] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {707#false} is VALID [2022-04-07 22:01:35,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 |__VERIFIER_assert_#in~cond|)} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {799#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:01:35,084 INFO L272 TraceCheckUtils]: 23: Hoare triple {815#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {795#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:01:35,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {815#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {815#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-07 22:01:35,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {815#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {815#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-07 22:01:35,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {825#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {815#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-07 22:01:35,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {825#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {825#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-07 22:01:35,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {832#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {825#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-07 22:01:35,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {832#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {832#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-07 22:01:35,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {839#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {832#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-07 22:01:35,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {839#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {839#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-07 22:01:35,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {846#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {839#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-07 22:01:35,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {846#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {846#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} is VALID [2022-04-07 22:01:35,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {846#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} is VALID [2022-04-07 22:01:35,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {853#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {853#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} is VALID [2022-04-07 22:01:35,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {853#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} is VALID [2022-04-07 22:01:35,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {860#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} is VALID [2022-04-07 22:01:35,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {867#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {860#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} is VALID [2022-04-07 22:01:35,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {867#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {867#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} is VALID [2022-04-07 22:01:35,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {874#(or (= (+ 16 main_~sn~0) 0) (= 16 (+ 16 main_~sn~0)))} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {867#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} is VALID [2022-04-07 22:01:35,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {706#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {874#(or (= (+ 16 main_~sn~0) 0) (= 16 (+ 16 main_~sn~0)))} is VALID [2022-04-07 22:01:35,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {706#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {706#true} is VALID [2022-04-07 22:01:35,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {706#true} {706#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {706#true} is VALID [2022-04-07 22:01:35,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {706#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {706#true} is VALID [2022-04-07 22:01:35,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {706#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {706#true} is VALID [2022-04-07 22:01:35,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {706#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {706#true} is VALID [2022-04-07 22:01:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:35,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116434039] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:01:35,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:01:35,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 25 [2022-04-07 22:01:35,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992859482] [2022-04-07 22:01:35,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:01:35,099 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-07 22:01:35,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:35,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:35,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:35,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-07 22:01:35,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:35,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-07 22:01:35,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2022-04-07 22:01:35,136 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:35,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:35,739 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-07 22:01:35,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 22:01:35,739 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-07 22:01:35,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2022-04-07 22:01:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2022-04-07 22:01:35,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 35 transitions. [2022-04-07 22:01:35,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:35,763 INFO L225 Difference]: With dead ends: 35 [2022-04-07 22:01:35,763 INFO L226 Difference]: Without dead ends: 30 [2022-04-07 22:01:35,764 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2022-04-07 22:01:35,764 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:35,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 105 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 22:01:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-07 22:01:35,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-07 22:01:35,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:35,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:35,802 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:35,802 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:35,804 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-07 22:01:35,804 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-07 22:01:35,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:35,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:35,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-07 22:01:35,804 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-07 22:01:35,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:35,805 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-07 22:01:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-07 22:01:35,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:35,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:35,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:35,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-07 22:01:35,807 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2022-04-07 22:01:35,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:35,807 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-07 22:01:35,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-07 22:01:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 22:01:35,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:35,808 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:35,831 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-04-07 22:01:36,027 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:36,027 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:36,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:36,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1988665612, now seen corresponding path program 4 times [2022-04-07 22:01:36,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:36,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140194233] [2022-04-07 22:01:36,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:36,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:36,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:36,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {1090#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1076#true} is VALID [2022-04-07 22:01:36,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1076#true} is VALID [2022-04-07 22:01:36,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1076#true} {1076#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1076#true} is VALID [2022-04-07 22:01:36,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {1076#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:36,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1076#true} is VALID [2022-04-07 22:01:36,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1076#true} is VALID [2022-04-07 22:01:36,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1076#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1076#true} is VALID [2022-04-07 22:01:36,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {1076#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1076#true} is VALID [2022-04-07 22:01:36,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {1076#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {1081#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 22:01:36,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {1081#(= (+ (- 1) main_~i~0) 0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1081#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 22:01:36,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {1081#(= (+ (- 1) main_~i~0) 0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1082#(<= 2 main_~i~0)} is VALID [2022-04-07 22:01:36,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {1082#(<= 2 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1082#(<= 2 main_~i~0)} is VALID [2022-04-07 22:01:36,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {1082#(<= 2 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1083#(<= 3 main_~i~0)} is VALID [2022-04-07 22:01:36,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {1083#(<= 3 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1083#(<= 3 main_~i~0)} is VALID [2022-04-07 22:01:36,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {1083#(<= 3 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1084#(<= 4 main_~i~0)} is VALID [2022-04-07 22:01:36,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {1084#(<= 4 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1084#(<= 4 main_~i~0)} is VALID [2022-04-07 22:01:36,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {1084#(<= 4 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1085#(<= 5 main_~i~0)} is VALID [2022-04-07 22:01:36,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {1085#(<= 5 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1085#(<= 5 main_~i~0)} is VALID [2022-04-07 22:01:36,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {1085#(<= 5 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1086#(<= 6 main_~i~0)} is VALID [2022-04-07 22:01:36,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {1086#(<= 6 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1086#(<= 6 main_~i~0)} is VALID [2022-04-07 22:01:36,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {1086#(<= 6 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1087#(<= 7 main_~i~0)} is VALID [2022-04-07 22:01:36,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {1087#(<= 7 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1087#(<= 7 main_~i~0)} is VALID [2022-04-07 22:01:36,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {1087#(<= 7 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1088#(<= 8 main_~i~0)} is VALID [2022-04-07 22:01:36,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {1088#(<= 8 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1088#(<= 8 main_~i~0)} is VALID [2022-04-07 22:01:36,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {1088#(<= 8 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1089#(<= 9 main_~i~0)} is VALID [2022-04-07 22:01:36,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {1089#(<= 9 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1077#false} is VALID [2022-04-07 22:01:36,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {1077#false} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1077#false} is VALID [2022-04-07 22:01:36,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {1077#false} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {1077#false} is VALID [2022-04-07 22:01:36,139 INFO L272 TraceCheckUtils]: 25: Hoare triple {1077#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {1077#false} is VALID [2022-04-07 22:01:36,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {1077#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1077#false} is VALID [2022-04-07 22:01:36,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {1077#false} [58] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1077#false} is VALID [2022-04-07 22:01:36,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {1077#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1077#false} is VALID [2022-04-07 22:01:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:36,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:36,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140194233] [2022-04-07 22:01:36,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140194233] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:01:36,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198736697] [2022-04-07 22:01:36,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 22:01:36,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:36,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:01:36,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:01:36,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 22:01:36,176 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 22:01:36,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 22:01:36,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 22:01:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:36,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:01:36,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {1076#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1076#true} is VALID [2022-04-07 22:01:36,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1076#true} is VALID [2022-04-07 22:01:36,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1076#true} is VALID [2022-04-07 22:01:36,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1076#true} [63] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1076#true} is VALID [2022-04-07 22:01:36,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {1076#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1076#true} is VALID [2022-04-07 22:01:36,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {1076#true} [49] mainENTRY-->L24-3: Formula: (and (= v_main_~i~0_3 1) (= v_main_~sn~0_2 0)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {1109#(<= 1 main_~i~0)} is VALID [2022-04-07 22:01:36,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {1109#(<= 1 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1109#(<= 1 main_~i~0)} is VALID [2022-04-07 22:01:36,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {1109#(<= 1 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1082#(<= 2 main_~i~0)} is VALID [2022-04-07 22:01:36,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {1082#(<= 2 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1082#(<= 2 main_~i~0)} is VALID [2022-04-07 22:01:36,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {1082#(<= 2 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1083#(<= 3 main_~i~0)} is VALID [2022-04-07 22:01:36,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {1083#(<= 3 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1083#(<= 3 main_~i~0)} is VALID [2022-04-07 22:01:36,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {1083#(<= 3 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1084#(<= 4 main_~i~0)} is VALID [2022-04-07 22:01:36,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {1084#(<= 4 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1084#(<= 4 main_~i~0)} is VALID [2022-04-07 22:01:36,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {1084#(<= 4 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1085#(<= 5 main_~i~0)} is VALID [2022-04-07 22:01:36,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {1085#(<= 5 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1085#(<= 5 main_~i~0)} is VALID [2022-04-07 22:01:36,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {1085#(<= 5 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1086#(<= 6 main_~i~0)} is VALID [2022-04-07 22:01:36,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {1086#(<= 6 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1086#(<= 6 main_~i~0)} is VALID [2022-04-07 22:01:36,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {1086#(<= 6 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1087#(<= 7 main_~i~0)} is VALID [2022-04-07 22:01:36,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {1087#(<= 7 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1087#(<= 7 main_~i~0)} is VALID [2022-04-07 22:01:36,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {1087#(<= 7 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1088#(<= 8 main_~i~0)} is VALID [2022-04-07 22:01:36,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {1088#(<= 8 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1088#(<= 8 main_~i~0)} is VALID [2022-04-07 22:01:36,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {1088#(<= 8 main_~i~0)} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1089#(<= 9 main_~i~0)} is VALID [2022-04-07 22:01:36,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {1089#(<= 9 main_~i~0)} [53] L24-3-->L24-2: Formula: (and (<= v_main_~i~0_7 8) (= v_main_~sn~0_3 (+ v_main_~sn~0_4 2))) InVars {main_~sn~0=v_main_~sn~0_4, main_~i~0=v_main_~i~0_7} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[main_~sn~0] {1077#false} is VALID [2022-04-07 22:01:36,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {1077#false} [55] L24-2-->L24-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1077#false} is VALID [2022-04-07 22:01:36,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {1077#false} [52] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {1077#false} is VALID [2022-04-07 22:01:36,353 INFO L272 TraceCheckUtils]: 25: Hoare triple {1077#false} [54] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {1077#false} is VALID [2022-04-07 22:01:36,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {1077#false} [57] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1077#false} is VALID [2022-04-07 22:01:36,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {1077#false} [58] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1077#false} is VALID [2022-04-07 22:01:36,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {1077#false} [60] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1077#false} is VALID [2022-04-07 22:01:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:36,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 22:01:36,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198736697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:01:36,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 22:01:36,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 13 [2022-04-07 22:01:36,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918834578] [2022-04-07 22:01:36,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:01:36,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-07 22:01:36,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:36,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:36,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:36,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-07 22:01:36,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:36,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-07 22:01:36,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-04-07 22:01:36,372 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:36,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:36,432 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-07 22:01:36,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 22:01:36,432 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-07 22:01:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 30 transitions. [2022-04-07 22:01:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 30 transitions. [2022-04-07 22:01:36,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 30 transitions. [2022-04-07 22:01:36,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:36,451 INFO L225 Difference]: With dead ends: 30 [2022-04-07 22:01:36,451 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 22:01:36,451 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-04-07 22:01:36,452 INFO L913 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:36,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:01:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 22:01:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 22:01:36,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:36,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:01:36,453 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:01:36,453 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:01:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:36,453 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:01:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:01:36,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:36,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:36,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 22:01:36,453 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 22:01:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:36,453 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:01:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:01:36,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:36,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:36,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:36,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:01:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 22:01:36,454 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-04-07 22:01:36,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:36,454 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 22:01:36,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:01:36,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:36,456 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 22:01:36,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 22:01:36,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:36,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 22:01:36,780 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 22:01:36,781 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:01:36,781 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:01:36,781 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 22:01:36,781 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 22:01:36,781 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:01:36,781 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:01:36,781 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 28) the Hoare annotation is: true [2022-04-07 22:01:36,781 INFO L878 garLoopResultBuilder]: At program point L24-3(lines 24 26) the Hoare annotation is: (or (and (<= main_~sn~0 16) (<= 9 main_~i~0) (< 15 main_~sn~0)) (and (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~i~0 4) (<= 4 main_~i~0)) (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 7) (<= 12 main_~sn~0) (<= main_~sn~0 12) (<= 7 main_~i~0)) (and (<= 14 main_~sn~0) (<= 8 main_~i~0) (<= main_~i~0 8) (<= main_~sn~0 14)) (and (<= main_~sn~0 10) (<= 10 main_~sn~0) (<= main_~i~0 6) (<= 6 main_~i~0)) (and (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= 3 main_~i~0) (<= main_~i~0 3)) (and (<= 2 main_~i~0) (<= main_~sn~0 2) (<= main_~i~0 2) (<= 2 main_~sn~0)) (and (<= main_~i~0 5) (<= 8 main_~sn~0) (<= 5 main_~i~0) (<= main_~sn~0 8))) [2022-04-07 22:01:36,781 INFO L878 garLoopResultBuilder]: At program point L24-4(lines 24 26) the Hoare annotation is: (and (<= main_~sn~0 16) (< 15 main_~sn~0)) [2022-04-07 22:01:36,781 INFO L882 garLoopResultBuilder]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2022-04-07 22:01:36,781 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 22 28) no Hoare annotation was computed. [2022-04-07 22:01:36,781 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 22 28) no Hoare annotation was computed. [2022-04-07 22:01:36,781 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-07 22:01:36,781 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-07 22:01:36,781 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-07 22:01:36,781 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 19) no Hoare annotation was computed. [2022-04-07 22:01:36,782 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-07 22:01:36,782 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 19) no Hoare annotation was computed. [2022-04-07 22:01:36,784 INFO L719 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-04-07 22:01:36,784 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 22:01:36,787 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:01:36,788 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 22:01:36,788 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:01:36,804 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-07 22:01:36,804 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 22:01:36,804 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 22:01:36,804 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 22:01:36,805 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-07 22:01:36,805 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 22:01:36,805 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 22:01:36,805 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-07 22:01:36,805 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:01:36,805 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:01:36,805 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 22:01:36,805 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 22:01:36,805 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 22:01:36,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:01:36 BasicIcfg [2022-04-07 22:01:36,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 22:01:36,812 INFO L158 Benchmark]: Toolchain (without parser) took 5444.39ms. Allocated memory was 169.9MB in the beginning and 208.7MB in the end (delta: 38.8MB). Free memory was 118.3MB in the beginning and 147.1MB in the end (delta: -28.9MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-07 22:01:36,813 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 169.9MB. Free memory was 134.4MB in the beginning and 134.3MB in the end (delta: 122.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 22:01:36,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.53ms. Allocated memory is still 169.9MB. Free memory was 118.0MB in the beginning and 144.8MB in the end (delta: -26.8MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-07 22:01:36,813 INFO L158 Benchmark]: Boogie Preprocessor took 26.95ms. Allocated memory is still 169.9MB. Free memory was 144.8MB in the beginning and 143.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 22:01:36,813 INFO L158 Benchmark]: RCFGBuilder took 208.59ms. Allocated memory is still 169.9MB. Free memory was 143.0MB in the beginning and 133.3MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-07 22:01:36,813 INFO L158 Benchmark]: IcfgTransformer took 45.56ms. Allocated memory is still 169.9MB. Free memory was 133.3MB in the beginning and 131.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 22:01:36,814 INFO L158 Benchmark]: TraceAbstraction took 4962.27ms. Allocated memory was 169.9MB in the beginning and 208.7MB in the end (delta: 38.8MB). Free memory was 131.5MB in the beginning and 147.1MB in the end (delta: -15.6MB). Peak memory consumption was 23.4MB. Max. memory is 8.0GB. [2022-04-07 22:01:36,815 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 169.9MB. Free memory was 134.4MB in the beginning and 134.3MB in the end (delta: 122.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.53ms. Allocated memory is still 169.9MB. Free memory was 118.0MB in the beginning and 144.8MB in the end (delta: -26.8MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.95ms. Allocated memory is still 169.9MB. Free memory was 144.8MB in the beginning and 143.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 208.59ms. Allocated memory is still 169.9MB. Free memory was 143.0MB in the beginning and 133.3MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 45.56ms. Allocated memory is still 169.9MB. Free memory was 133.3MB in the beginning and 131.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4962.27ms. Allocated memory was 169.9MB in the beginning and 208.7MB in the end (delta: 38.8MB). Free memory was 131.5MB in the beginning and 147.1MB in the end (delta: -15.6MB). Peak memory consumption was 23.4MB. Max. memory is 8.0GB. * 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 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 489 IncrementalHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 75 mSDtfsCounter, 489 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 139 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=5, InterpolantAutomatonStates: 50, 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, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 127 HoareAnnotationTreeSize, 12 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 198 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 826 SizeOfPredicates, 1 NumberOfNonLiveVariables, 283 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 147/405 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((((sn <= 16 && 9 <= i) && 15 < sn) || (((6 <= sn && sn <= 6) && i <= 4) && 4 <= i)) || (sn == 0 && i == 1)) || (((i <= 7 && 12 <= sn) && sn <= 12) && 7 <= i)) || (((14 <= sn && 8 <= i) && i <= 8) && sn <= 14)) || (((sn <= 10 && 10 <= sn) && i <= 6) && 6 <= i)) || (((4 <= sn && sn <= 4) && 3 <= i) && i <= 3)) || (((2 <= i && sn <= 2) && i <= 2) && 2 <= sn)) || (((i <= 5 && 8 <= sn) && 5 <= i) && sn <= 8) RESULT: Ultimate proved your program to be correct! [2022-04-07 22:01:36,858 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...