/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/loop-zilu/benchmark34_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 23:32:12,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 23:32:12,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 23:32:13,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 23:32:13,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 23:32:13,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 23:32:13,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 23:32:13,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 23:32:13,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 23:32:13,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 23:32:13,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 23:32:13,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 23:32:13,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 23:32:13,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 23:32:13,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 23:32:13,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 23:32:13,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 23:32:13,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 23:32:13,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 23:32:13,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 23:32:13,046 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 23:32:13,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 23:32:13,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 23:32:13,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 23:32:13,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 23:32:13,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 23:32:13,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 23:32:13,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 23:32:13,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 23:32:13,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 23:32:13,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 23:32:13,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 23:32:13,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 23:32:13,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 23:32:13,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 23:32:13,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 23:32:13,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 23:32:13,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 23:32:13,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 23:32:13,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 23:32:13,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 23:32:13,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 23:32:13,056 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 23:32:13,071 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 23:32:13,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 23:32:13,071 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 23:32:13,072 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 23:32:13,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 23:32:13,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 23:32:13,072 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 23:32:13,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 23:32:13,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 23:32:13,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 23:32:13,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 23:32:13,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 23:32:13,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 23:32:13,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 23:32:13,073 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 23:32:13,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 23:32:13,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 23:32:13,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 23:32:13,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 23:32:13,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:32:13,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 23:32:13,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 23:32:13,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 23:32:13,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 23:32:13,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 23:32:13,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 23:32:13,075 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 23:32:13,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 23:32:13,076 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 23:32:13,076 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 23:32:13,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 23:32:13,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 23:32:13,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 23:32:13,251 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 23:32:13,251 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 23:32:13,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark34_conjunctive.i [2022-04-07 23:32:13,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54c1d9ee3/3ee76b886b27478691699f94d06751fd/FLAG06c8b64fa [2022-04-07 23:32:13,634 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 23:32:13,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark34_conjunctive.i [2022-04-07 23:32:13,639 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54c1d9ee3/3ee76b886b27478691699f94d06751fd/FLAG06c8b64fa [2022-04-07 23:32:13,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54c1d9ee3/3ee76b886b27478691699f94d06751fd [2022-04-07 23:32:13,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 23:32:13,663 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 23:32:13,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 23:32:13,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 23:32:13,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 23:32:13,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:32:13" (1/1) ... [2022-04-07 23:32:13,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296bbdf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:13, skipping insertion in model container [2022-04-07 23:32:13,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:32:13" (1/1) ... [2022-04-07 23:32:13,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 23:32:13,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 23:32:13,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark34_conjunctive.i[873,886] [2022-04-07 23:32:13,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:32:13,819 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 23:32:13,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark34_conjunctive.i[873,886] [2022-04-07 23:32:13,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:32:13,836 INFO L208 MainTranslator]: Completed translation [2022-04-07 23:32:13,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:13 WrapperNode [2022-04-07 23:32:13,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 23:32:13,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 23:32:13,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 23:32:13,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 23:32:13,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:13" (1/1) ... [2022-04-07 23:32:13,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:13" (1/1) ... [2022-04-07 23:32:13,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:13" (1/1) ... [2022-04-07 23:32:13,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:13" (1/1) ... [2022-04-07 23:32:13,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:13" (1/1) ... [2022-04-07 23:32:13,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:13" (1/1) ... [2022-04-07 23:32:13,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:13" (1/1) ... [2022-04-07 23:32:13,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 23:32:13,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 23:32:13,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 23:32:13,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 23:32:13,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:13" (1/1) ... [2022-04-07 23:32:13,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:32:13,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:32:13,888 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 23:32:13,907 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 23:32:13,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 23:32:13,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 23:32:13,919 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 23:32:13,920 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 23:32:13,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 23:32:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 23:32:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 23:32:13,921 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 23:32:13,922 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 23:32:13,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 23:32:13,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 23:32:13,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-07 23:32:13,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 23:32:13,923 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 23:32:13,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 23:32:13,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 23:32:13,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 23:32:13,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 23:32:13,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 23:32:13,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 23:32:13,964 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 23:32:13,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 23:32:14,071 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 23:32:14,075 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 23:32:14,075 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 23:32:14,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:32:14 BoogieIcfgContainer [2022-04-07 23:32:14,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 23:32:14,077 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 23:32:14,077 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 23:32:14,078 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 23:32:14,080 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:32:14" (1/1) ... [2022-04-07 23:32:14,081 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 23:32:14,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:32:14 BasicIcfg [2022-04-07 23:32:14,096 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 23:32:14,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 23:32:14,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 23:32:14,099 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 23:32:14,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:32:13" (1/4) ... [2022-04-07 23:32:14,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563ddf2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:32:14, skipping insertion in model container [2022-04-07 23:32:14,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:32:13" (2/4) ... [2022-04-07 23:32:14,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563ddf2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:32:14, skipping insertion in model container [2022-04-07 23:32:14,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:32:14" (3/4) ... [2022-04-07 23:32:14,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563ddf2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:32:14, skipping insertion in model container [2022-04-07 23:32:14,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:32:14" (4/4) ... [2022-04-07 23:32:14,101 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark34_conjunctive.iqvasr [2022-04-07 23:32:14,104 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 23:32:14,104 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 23:32:14,130 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 23:32:14,134 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 23:32:14,134 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 23:32:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 23:32:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 23:32:14,149 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:32:14,150 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:32:14,150 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:32:14,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:32:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1809217115, now seen corresponding path program 1 times [2022-04-07 23:32:14,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:32:14,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492481998] [2022-04-07 23:32:14,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:32:14,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:32:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:32:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:14,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {23#true} is VALID [2022-04-07 23:32:14,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 23:32:14,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 23:32:14,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:32:14,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {23#true} is VALID [2022-04-07 23:32:14,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 23:32:14,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 23:32:14,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 23:32:14,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648)) (= v_main_~j~0_4 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {23#true} is VALID [2022-04-07 23:32:14,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_5) (= v_main_~k~0_6 v_main_~n~0_5) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 23:32:14,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [57] L24-2-->L24-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 23:32:14,283 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~k~0_7 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {24#false} is VALID [2022-04-07 23:32:14,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-07 23:32:14,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 23:32:14,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 23:32:14,284 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 23:32:14,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:32:14,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492481998] [2022-04-07 23:32:14,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492481998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:32:14,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:32:14,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 23:32:14,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463494432] [2022-04-07 23:32:14,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:32:14,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-07 23:32:14,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:32:14,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 23:32:14,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:14,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 23:32:14,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:32:14,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 23:32:14,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:32:14,324 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 23:32:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:14,370 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-07 23:32:14,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 23:32:14,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-07 23:32:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:32:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 23:32:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-07 23:32:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 23:32:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-07 23:32:14,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-07 23:32:14,415 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 23:32:14,420 INFO L225 Difference]: With dead ends: 32 [2022-04-07 23:32:14,420 INFO L226 Difference]: Without dead ends: 13 [2022-04-07 23:32:14,422 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 23:32:14,424 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 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 23:32:14,425 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:32:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-07 23:32:14,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-07 23:32:14,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:32:14,447 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 23:32:14,448 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 23:32:14,448 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 23:32:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:14,450 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 23:32:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 23:32:14,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:14,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:14,451 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 23:32:14,451 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 23:32:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:14,452 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 23:32:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 23:32:14,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:14,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:14,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:32:14,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:32:14,453 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 23:32:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-07 23:32:14,455 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-07 23:32:14,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:32:14,455 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-07 23:32:14,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 23:32:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 23:32:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 23:32:14,456 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:32:14,456 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:32:14,456 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 23:32:14,456 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:32:14,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:32:14,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1810140636, now seen corresponding path program 1 times [2022-04-07 23:32:14,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:32:14,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769359714] [2022-04-07 23:32:14,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:32:14,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:32:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:14,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:32:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:14,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {118#true} is VALID [2022-04-07 23:32:14,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 23:32:14,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 23:32:14,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:32:14,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {118#true} is VALID [2022-04-07 23:32:14,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 23:32:14,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 23:32:14,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 23:32:14,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648)) (= v_main_~j~0_4 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {118#true} is VALID [2022-04-07 23:32:14,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_5) (= v_main_~k~0_6 v_main_~n~0_5) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {123#(and (not (<= main_~n~0 0)) (= main_~j~0 0))} is VALID [2022-04-07 23:32:14,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(and (not (<= main_~n~0 0)) (= main_~j~0 0))} [58] L24-2-->L24-3: Formula: (or (not (< v_main_~j~0_1 v_main_~n~0_1)) (not (< 0 v_main_~n~0_1))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-07 23:32:14,543 INFO L272 TraceCheckUtils]: 8: Hoare triple {119#false} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~k~0_7 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {119#false} is VALID [2022-04-07 23:32:14,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {119#false} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {119#false} is VALID [2022-04-07 23:32:14,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-07 23:32:14,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-07 23:32:14,544 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 23:32:14,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:32:14,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769359714] [2022-04-07 23:32:14,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769359714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:32:14,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:32:14,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 23:32:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453928010] [2022-04-07 23:32:14,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:32:14,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-07 23:32:14,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:32:14,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 23:32:14,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:14,560 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 23:32:14,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:32:14,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 23:32:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 23:32:14,564 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 23:32:14,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:14,627 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-07 23:32:14,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 23:32:14,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-07 23:32:14,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:32:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 23:32:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-07 23:32:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 23:32:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-07 23:32:14,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-07 23:32:14,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:14,655 INFO L225 Difference]: With dead ends: 19 [2022-04-07 23:32:14,663 INFO L226 Difference]: Without dead ends: 14 [2022-04-07 23:32:14,664 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 23:32:14,665 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:32:14,665 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:32:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-07 23:32:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-07 23:32:14,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:32:14,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 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 23:32:14,670 INFO L74 IsIncluded]: Start isIncluded. First operand 14 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 23:32:14,671 INFO L87 Difference]: Start difference. First operand 14 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 23:32:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:14,673 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 23:32:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 23:32:14,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:14,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:14,674 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 14 states. [2022-04-07 23:32:14,674 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 14 states. [2022-04-07 23:32:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:14,677 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 23:32:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 23:32:14,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:14,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:14,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:32:14,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:32:14,678 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 23:32:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-07 23:32:14,680 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-07 23:32:14,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:32:14,680 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-07 23:32:14,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 23:32:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 23:32:14,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 23:32:14,682 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:32:14,682 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:32:14,682 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 23:32:14,682 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:32:14,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:32:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash 306506437, now seen corresponding path program 1 times [2022-04-07 23:32:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:32:14,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752873991] [2022-04-07 23:32:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:32:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:32:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:14,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:32:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:14,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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 23:32:14,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 23:32:14,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} [68] 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 23:32:14,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:32:14,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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 23:32:14,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 23:32:14,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [68] 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 23:32:14,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 23:32:14,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648)) (= v_main_~j~0_4 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {208#true} is VALID [2022-04-07 23:32:14,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_5) (= v_main_~k~0_6 v_main_~n~0_5) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {213#(and (not (<= main_~n~0 0)) (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-07 23:32:14,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(and (not (<= main_~n~0 0)) (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} [59] L24-2-->L24-2: Formula: (and (< 0 v_main_~n~0_2) (< v_main_~j~0_3 v_main_~n~0_2) (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {214#(and (< 0 (+ main_~k~0 1)) (or (<= main_~k~0 0) (<= (+ main_~k~0 main_~j~0) main_~n~0)) (not (<= main_~n~0 0)))} is VALID [2022-04-07 23:32:14,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(and (< 0 (+ main_~k~0 1)) (or (<= main_~k~0 0) (<= (+ main_~k~0 main_~j~0) main_~n~0)) (not (<= main_~n~0 0)))} [58] L24-2-->L24-3: Formula: (or (not (< v_main_~j~0_1 v_main_~n~0_1)) (not (< 0 v_main_~n~0_1))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {215#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-07 23:32:14,890 INFO L272 TraceCheckUtils]: 9: Hoare triple {215#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~k~0_7 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {216#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:32:14,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {216#(not (= |__VERIFIER_assert_#in~cond| 0))} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {217#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:32:14,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {217#(not (= __VERIFIER_assert_~cond 0))} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 23:32:14,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 23:32:14,892 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 23:32:14,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:32:14,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752873991] [2022-04-07 23:32:14,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752873991] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:32:14,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527667755] [2022-04-07 23:32:14,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:32:14,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:32:14,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:32:14,902 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 23:32:14,903 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 23:32:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:14,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 23:32:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:14,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:32:15,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 23:32:15,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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 23:32:15,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 23:32:15,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [68] 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 23:32:15,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 23:32:15,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648)) (= v_main_~j~0_4 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {208#true} is VALID [2022-04-07 23:32:15,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_5) (= v_main_~k~0_6 v_main_~n~0_5) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {240#(and (< 0 main_~n~0) (<= main_~j~0 0) (= main_~n~0 main_~k~0))} is VALID [2022-04-07 23:32:15,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(and (< 0 main_~n~0) (<= main_~j~0 0) (= main_~n~0 main_~k~0))} [59] L24-2-->L24-2: Formula: (and (< 0 v_main_~n~0_2) (< v_main_~j~0_3 v_main_~n~0_2) (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {244#(and (< 0 main_~n~0) (= (+ main_~k~0 1) main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-07 23:32:15,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(and (< 0 main_~n~0) (= (+ main_~k~0 1) main_~n~0) (<= main_~j~0 1))} [58] L24-2-->L24-3: Formula: (or (not (< v_main_~j~0_1 v_main_~n~0_1)) (not (< 0 v_main_~n~0_1))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {215#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-07 23:32:15,240 INFO L272 TraceCheckUtils]: 9: Hoare triple {215#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~k~0_7 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {251#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:32:15,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {251#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {255#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:32:15,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {255#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 23:32:15,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 23:32:15,243 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 23:32:15,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:32:15,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 23:32:15,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {255#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 23:32:15,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {251#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {255#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:32:15,498 INFO L272 TraceCheckUtils]: 9: Hoare triple {215#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~k~0_7 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {251#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:32:15,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {274#(or (and (< 0 main_~n~0) (< main_~j~0 main_~n~0)) (and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0)))} [58] L24-2-->L24-3: Formula: (or (not (< v_main_~j~0_1 v_main_~n~0_1)) (not (< 0 v_main_~n~0_1))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {215#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-07 23:32:15,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {278#(or (and (<= main_~k~0 1) (< 0 main_~k~0)) (and (< 0 main_~n~0) (< (+ main_~j~0 1) main_~n~0)))} [59] L24-2-->L24-2: Formula: (and (< 0 v_main_~n~0_2) (< v_main_~j~0_3 v_main_~n~0_2) (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {274#(or (and (< 0 main_~n~0) (< main_~j~0 main_~n~0)) (and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0)))} is VALID [2022-04-07 23:32:15,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_5) (= v_main_~k~0_6 v_main_~n~0_5) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {278#(or (and (<= main_~k~0 1) (< 0 main_~k~0)) (and (< 0 main_~n~0) (< (+ main_~j~0 1) main_~n~0)))} is VALID [2022-04-07 23:32:15,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648)) (= v_main_~j~0_4 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {208#true} is VALID [2022-04-07 23:32:15,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 23:32:15,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [68] 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 23:32:15,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 23:32:15,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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 23:32:15,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 23:32:15,502 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 23:32:15,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527667755] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:32:15,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:32:15,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-07 23:32:15,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861617379] [2022-04-07 23:32:15,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:32:15,506 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 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 23:32:15,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:32:15,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:32:15,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:15,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 23:32:15,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:32:15,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 23:32:15,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-07 23:32:15,523 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:32:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:15,713 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-07 23:32:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 23:32:15,713 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 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 23:32:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:32:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:32:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-04-07 23:32:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:32:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-04-07 23:32:15,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2022-04-07 23:32:15,740 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 23:32:15,740 INFO L225 Difference]: With dead ends: 20 [2022-04-07 23:32:15,740 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 23:32:15,741 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-04-07 23:32:15,744 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:32:15,745 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 47 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:32:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 23:32:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 23:32:15,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:32:15,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 23:32:15,752 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 23:32:15,752 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 23:32:15,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:15,754 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 23:32:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 23:32:15,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:15,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:15,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 23:32:15,755 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 23:32:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:15,756 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 23:32:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 23:32:15,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:15,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:15,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:32:15,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:32:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 23:32:15,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-07 23:32:15,758 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-07 23:32:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:32:15,758 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-07 23:32:15,758 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:32:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 23:32:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 23:32:15,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:32:15,759 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:32:15,777 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 23:32:15,976 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 23:32:15,977 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:32:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:32:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash 938486524, now seen corresponding path program 2 times [2022-04-07 23:32:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:32:15,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275489956] [2022-04-07 23:32:15,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:32:15,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:32:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:16,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:32:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:16,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {397#true} is VALID [2022-04-07 23:32:16,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-07 23:32:16,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {397#true} {397#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-07 23:32:16,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:32:16,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {397#true} is VALID [2022-04-07 23:32:16,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-07 23:32:16,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-07 23:32:16,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-07 23:32:16,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648)) (= v_main_~j~0_4 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {397#true} is VALID [2022-04-07 23:32:16,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {397#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_5) (= v_main_~k~0_6 v_main_~n~0_5) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {402#(and (not (<= main_~n~0 0)) (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-07 23:32:16,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {402#(and (not (<= main_~n~0 0)) (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} [59] L24-2-->L24-2: Formula: (and (< 0 v_main_~n~0_2) (< v_main_~j~0_3 v_main_~n~0_2) (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {403#(and (<= main_~n~0 (+ main_~k~0 main_~j~0)) (not (<= main_~n~0 0)) (<= (+ main_~k~0 main_~j~0) main_~n~0))} is VALID [2022-04-07 23:32:16,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {403#(and (<= main_~n~0 (+ main_~k~0 main_~j~0)) (not (<= main_~n~0 0)) (<= (+ main_~k~0 main_~j~0) main_~n~0))} [59] L24-2-->L24-2: Formula: (and (< 0 v_main_~n~0_2) (< v_main_~j~0_3 v_main_~n~0_2) (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {404#(and (< 0 (+ main_~k~0 1)) (or (<= main_~k~0 0) (<= (+ main_~k~0 main_~j~0) main_~n~0)) (not (<= main_~n~0 0)))} is VALID [2022-04-07 23:32:16,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {404#(and (< 0 (+ main_~k~0 1)) (or (<= main_~k~0 0) (<= (+ main_~k~0 main_~j~0) main_~n~0)) (not (<= main_~n~0 0)))} [58] L24-2-->L24-3: Formula: (or (not (< v_main_~j~0_1 v_main_~n~0_1)) (not (< 0 v_main_~n~0_1))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {405#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-07 23:32:16,096 INFO L272 TraceCheckUtils]: 10: Hoare triple {405#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~k~0_7 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {406#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:32:16,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {406#(not (= |__VERIFIER_assert_#in~cond| 0))} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {407#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:32:16,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {407#(not (= __VERIFIER_assert_~cond 0))} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {398#false} is VALID [2022-04-07 23:32:16,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {398#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#false} is VALID [2022-04-07 23:32:16,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:32:16,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:32:16,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275489956] [2022-04-07 23:32:16,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275489956] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:32:16,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496406064] [2022-04-07 23:32:16,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 23:32:16,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:32:16,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:32:16,115 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 23:32:16,116 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 23:32:16,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 23:32:16,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:32:16,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 23:32:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:32:16,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:32:16,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-07 23:32:16,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#true} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {397#true} is VALID [2022-04-07 23:32:16,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-07 23:32:16,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-07 23:32:16,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-07 23:32:16,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648)) (= v_main_~j~0_4 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {397#true} is VALID [2022-04-07 23:32:16,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {397#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_5) (= v_main_~k~0_6 v_main_~n~0_5) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {402#(and (not (<= main_~n~0 0)) (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-07 23:32:16,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {402#(and (not (<= main_~n~0 0)) (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} [59] L24-2-->L24-2: Formula: (and (< 0 v_main_~n~0_2) (< v_main_~j~0_3 v_main_~n~0_2) (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {433#(and (not (<= main_~n~0 0)) (= (+ (- 1) main_~j~0) 0) (<= main_~n~0 (+ main_~k~0 1)) (<= (+ main_~k~0 1) main_~n~0))} is VALID [2022-04-07 23:32:16,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {433#(and (not (<= main_~n~0 0)) (= (+ (- 1) main_~j~0) 0) (<= main_~n~0 (+ main_~k~0 1)) (<= (+ main_~k~0 1) main_~n~0))} [59] L24-2-->L24-2: Formula: (and (< 0 v_main_~n~0_2) (< v_main_~j~0_3 v_main_~n~0_2) (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {437#(and (<= main_~n~0 (+ main_~k~0 2)) (<= main_~j~0 2) (< 1 main_~n~0) (<= (+ main_~k~0 2) main_~n~0))} is VALID [2022-04-07 23:32:16,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {437#(and (<= main_~n~0 (+ main_~k~0 2)) (<= main_~j~0 2) (< 1 main_~n~0) (<= (+ main_~k~0 2) main_~n~0))} [58] L24-2-->L24-3: Formula: (or (not (< v_main_~j~0_1 v_main_~n~0_1)) (not (< 0 v_main_~n~0_1))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {405#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-07 23:32:16,374 INFO L272 TraceCheckUtils]: 10: Hoare triple {405#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~k~0_7 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {444#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:32:16,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {444#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:32:16,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {448#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {398#false} is VALID [2022-04-07 23:32:16,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {398#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#false} is VALID [2022-04-07 23:32:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:32:16,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:32:16,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {398#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#false} is VALID [2022-04-07 23:32:16,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {448#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {398#false} is VALID [2022-04-07 23:32:16,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {444#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:32:16,630 INFO L272 TraceCheckUtils]: 10: Hoare triple {405#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~k~0_7 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {444#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:32:16,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {467#(or (and (< 0 main_~n~0) (< main_~j~0 main_~n~0)) (and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0)))} [58] L24-2-->L24-3: Formula: (or (not (< v_main_~j~0_1 v_main_~n~0_1)) (not (< 0 v_main_~n~0_1))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {405#(and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0))} is VALID [2022-04-07 23:32:16,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#(or (not (< main_~j~0 main_~n~0)) (and (<= main_~k~0 1) (< 0 main_~k~0)) (and (< 0 main_~n~0) (< (+ main_~j~0 1) main_~n~0)))} [59] L24-2-->L24-2: Formula: (and (< 0 v_main_~n~0_2) (< v_main_~j~0_3 v_main_~n~0_2) (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {467#(or (and (< 0 main_~n~0) (< main_~j~0 main_~n~0)) (and (< 0 (+ main_~k~0 1)) (<= main_~k~0 0)))} is VALID [2022-04-07 23:32:16,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {475#(or (and (< 0 main_~n~0) (< (+ main_~j~0 2) main_~n~0)) (not (< (+ main_~j~0 1) main_~n~0)) (and (< 1 main_~k~0) (<= main_~k~0 2)))} [59] L24-2-->L24-2: Formula: (and (< 0 v_main_~n~0_2) (< v_main_~j~0_3 v_main_~n~0_2) (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {471#(or (not (< main_~j~0 main_~n~0)) (and (<= main_~k~0 1) (< 0 main_~k~0)) (and (< 0 main_~n~0) (< (+ main_~j~0 1) main_~n~0)))} is VALID [2022-04-07 23:32:16,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {397#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_5) (= v_main_~k~0_6 v_main_~n~0_5) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {475#(or (and (< 0 main_~n~0) (< (+ main_~j~0 2) main_~n~0)) (not (< (+ main_~j~0 1) main_~n~0)) (and (< 1 main_~k~0) (<= main_~k~0 2)))} is VALID [2022-04-07 23:32:16,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648)) (= v_main_~j~0_4 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {397#true} is VALID [2022-04-07 23:32:16,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-07 23:32:16,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-07 23:32:16,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-07 23:32:16,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#true} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {397#true} is VALID [2022-04-07 23:32:16,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#true} is VALID [2022-04-07 23:32:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:32:16,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496406064] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:32:16,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:32:16,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-07 23:32:16,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066403447] [2022-04-07 23:32:16,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:32:16,635 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 23:32:16,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:32:16,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:32:16,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:16,656 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 23:32:16,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:32:16,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 23:32:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-04-07 23:32:16,656 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:32:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:16,972 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-07 23:32:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 23:32:16,972 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 23:32:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:32:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:32:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2022-04-07 23:32:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:32:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2022-04-07 23:32:16,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 18 transitions. [2022-04-07 23:32:16,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:32:16,993 INFO L225 Difference]: With dead ends: 17 [2022-04-07 23:32:16,993 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 23:32:16,993 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2022-04-07 23:32:16,995 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:32:16,996 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 55 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:32:16,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 23:32:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 23:32:16,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:32:16,998 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 23:32:16,998 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 23:32:16,998 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 23:32:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:16,998 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:32:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:32:16,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:16,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:16,999 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 23:32:16,999 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 23:32:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:32:16,999 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:32:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:32:16,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:16,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:32:16,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:32:16,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:32:16,999 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 23:32:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 23:32:17,000 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-07 23:32:17,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:32:17,000 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 23:32:17,000 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:32:17,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:32:17,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:32:17,003 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 23:32:17,019 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 23:32:17,215 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 23:32:17,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 23:32:17,309 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 23:32:17,309 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:32:17,309 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:32:17,309 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 23:32:17,309 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 23:32:17,309 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:32:17,309 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:32:17,309 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 29) the Hoare annotation is: true [2022-04-07 23:32:17,309 INFO L882 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-04-07 23:32:17,309 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 29) no Hoare annotation was computed. [2022-04-07 23:32:17,309 INFO L878 garLoopResultBuilder]: At program point L24-2(lines 24 26) the Hoare annotation is: (let ((.cse0 (+ main_~k~0 main_~j~0))) (and (<= main_~n~0 .cse0) (< 0 (+ main_~k~0 1)) (not (<= main_~n~0 0)) (<= .cse0 main_~n~0))) [2022-04-07 23:32:17,309 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 29) no Hoare annotation was computed. [2022-04-07 23:32:17,310 INFO L878 garLoopResultBuilder]: At program point L24-3(lines 24 26) the Hoare annotation is: (let ((.cse1 (+ main_~k~0 1))) (let ((.cse0 (< 0 .cse1)) (.cse2 (<= main_~k~0 0))) (or (and .cse0 (= .cse1 main_~n~0) .cse2 (<= main_~j~0 1)) (let ((.cse3 (+ main_~k~0 main_~j~0))) (and (<= main_~n~0 .cse3) .cse0 (not (<= main_~n~0 0)) .cse2 (<= .cse3 main_~n~0)))))) [2022-04-07 23:32:17,310 INFO L882 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-04-07 23:32:17,310 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-07 23:32:17,310 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-07 23:32:17,310 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-07 23:32:17,310 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-07 23:32:17,310 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-07 23:32:17,310 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-07 23:32:17,312 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-07 23:32:17,313 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 23:32:17,318 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:32:17,318 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 23:32:17,318 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 23:32:17,318 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:32:17,318 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 23:32:17,318 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 23:32:17,318 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 23:32:17,318 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 23:32:17,318 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 23:32:17,318 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 23:32:17,322 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 23:32:17,322 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 23:32:17,322 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-07 23:32:17,323 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 23:32:17,323 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:32:17,323 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 23:32:17,323 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-07 23:32:17,323 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 23:32:17,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:32:17 BasicIcfg [2022-04-07 23:32:17,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 23:32:17,330 INFO L158 Benchmark]: Toolchain (without parser) took 3666.81ms. Allocated memory was 212.9MB in the beginning and 277.9MB in the end (delta: 65.0MB). Free memory was 188.4MB in the beginning and 207.4MB in the end (delta: -18.9MB). Peak memory consumption was 45.7MB. Max. memory is 8.0GB. [2022-04-07 23:32:17,330 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 212.9MB. Free memory is still 174.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 23:32:17,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.68ms. Allocated memory is still 212.9MB. Free memory was 188.2MB in the beginning and 185.4MB in the end (delta: 2.8MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2022-04-07 23:32:17,330 INFO L158 Benchmark]: Boogie Preprocessor took 16.88ms. Allocated memory is still 212.9MB. Free memory was 185.4MB in the beginning and 183.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 23:32:17,331 INFO L158 Benchmark]: RCFGBuilder took 221.89ms. Allocated memory is still 212.9MB. Free memory was 183.7MB in the beginning and 172.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 23:32:17,331 INFO L158 Benchmark]: IcfgTransformer took 19.24ms. Allocated memory is still 212.9MB. Free memory was 172.7MB in the beginning and 171.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 23:32:17,331 INFO L158 Benchmark]: TraceAbstraction took 3231.99ms. Allocated memory was 212.9MB in the beginning and 277.9MB in the end (delta: 65.0MB). Free memory was 170.9MB in the beginning and 207.4MB in the end (delta: -36.5MB). Peak memory consumption was 29.3MB. Max. memory is 8.0GB. [2022-04-07 23:32:17,332 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 212.9MB. Free memory is still 174.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.68ms. Allocated memory is still 212.9MB. Free memory was 188.2MB in the beginning and 185.4MB in the end (delta: 2.8MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.88ms. Allocated memory is still 212.9MB. Free memory was 185.4MB in the beginning and 183.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 221.89ms. Allocated memory is still 212.9MB. Free memory was 183.7MB in the beginning and 172.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 19.24ms. Allocated memory is still 212.9MB. Free memory was 172.7MB in the beginning and 171.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3231.99ms. Allocated memory was 212.9MB in the beginning and 277.9MB in the end (delta: 65.0MB). Free memory was 170.9MB in the beginning and 207.4MB in the end (delta: -36.5MB). Peak memory consumption was 29.3MB. 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 144 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 134 IncrementalHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 50 mSDtfsCounter, 134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 17 NumberOfFragments, 72 HoareAnnotationTreeSize, 11 FomulaSimplifications, 19 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 59 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 438 SizeOfPredicates, 12 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/12 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: ((n <= k + j && 0 < k + 1) && !(n <= 0)) && k + j <= n RESULT: Ultimate proved your program to be correct! [2022-04-07 23:32:17,353 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...