/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-new/gauss_sum.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:45:51,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:45:51,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:45:51,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:45:51,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:45:51,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:45:51,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:45:51,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:45:51,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:45:51,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:45:51,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:45:51,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:45:51,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:45:51,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:45:51,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:45:51,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:45:51,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:45:51,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:45:51,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:45:51,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:45:51,162 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:45:51,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:45:51,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:45:51,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:45:51,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:45:51,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:45:51,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:45:51,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:45:51,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:45:51,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:45:51,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:45:51,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:45:51,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:45:51,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:45:51,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:45:51,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:45:51,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:45:51,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:45:51,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:45:51,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:45:51,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:45:51,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:45:51,185 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:45:51,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:45:51,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:45:51,220 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:45:51,220 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:45:51,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:45:51,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:45:51,221 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:45:51,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:45:51,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:45:51,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:45:51,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:45:51,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:45:51,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:45:51,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:45:51,222 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:45:51,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:45:51,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:45:51,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:45:51,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:45:51,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:45:51,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:45:51,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:45:51,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:45:51,223 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:45:51,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:45:51,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:45:51,224 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:45:51,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:45:51,225 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:45:51,225 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-15 00:45:51,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:45:51,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:45:51,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:45:51,409 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:45:51,411 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:45:51,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c [2022-04-15 00:45:51,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41527034/50e5cf38ca39427ebcaa4ddb33baac6a/FLAG6f55358c0 [2022-04-15 00:45:51,825 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:45:51,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.p+lhb-reducer.c [2022-04-15 00:45:51,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41527034/50e5cf38ca39427ebcaa4ddb33baac6a/FLAG6f55358c0 [2022-04-15 00:45:51,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41527034/50e5cf38ca39427ebcaa4ddb33baac6a [2022-04-15 00:45:51,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:45:51,843 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:45:51,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:45:51,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:45:51,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:45:51,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:45:51" (1/1) ... [2022-04-15 00:45:51,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91729b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:45:51, skipping insertion in model container [2022-04-15 00:45:51,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:45:51" (1/1) ... [2022-04-15 00:45:51,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:45:51,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:45:52,019 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-new/gauss_sum.i.p+lhb-reducer.c[1444,1457] [2022-04-15 00:45:52,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:45:52,027 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:45:52,043 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-new/gauss_sum.i.p+lhb-reducer.c[1444,1457] [2022-04-15 00:45:52,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:45:52,053 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:45:52,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:45:52 WrapperNode [2022-04-15 00:45:52,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:45:52,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:45:52,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:45:52,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:45:52,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:45:52" (1/1) ... [2022-04-15 00:45:52,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:45:52" (1/1) ... [2022-04-15 00:45:52,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:45:52" (1/1) ... [2022-04-15 00:45:52,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:45:52" (1/1) ... [2022-04-15 00:45:52,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:45:52" (1/1) ... [2022-04-15 00:45:52,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:45:52" (1/1) ... [2022-04-15 00:45:52,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:45:52" (1/1) ... [2022-04-15 00:45:52,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:45:52,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:45:52,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:45:52,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:45:52,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:45:52" (1/1) ... [2022-04-15 00:45:52,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:45:52,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:45:52,124 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-15 00:45:52,142 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-15 00:45:52,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:45:52,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:45:52,156 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:45:52,156 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 00:45:52,156 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:45:52,156 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:45:52,156 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:45:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:45:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:45:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 00:45:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:45:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:45:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:45:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:45:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:45:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:45:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:45:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:45:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:45:52,209 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:45:52,210 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:45:52,393 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:45:52,400 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:45:52,400 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 00:45:52,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:45:52 BoogieIcfgContainer [2022-04-15 00:45:52,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:45:52,402 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:45:52,402 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:45:52,403 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:45:52,405 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:45:52" (1/1) ... [2022-04-15 00:45:52,407 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:45:52,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:45:52 BasicIcfg [2022-04-15 00:45:52,437 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:45:52,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:45:52,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:45:52,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:45:52,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:45:51" (1/4) ... [2022-04-15 00:45:52,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c29d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:45:52, skipping insertion in model container [2022-04-15 00:45:52,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:45:52" (2/4) ... [2022-04-15 00:45:52,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c29d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:45:52, skipping insertion in model container [2022-04-15 00:45:52,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:45:52" (3/4) ... [2022-04-15 00:45:52,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c29d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:45:52, skipping insertion in model container [2022-04-15 00:45:52,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:45:52" (4/4) ... [2022-04-15 00:45:52,442 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.i.p+lhb-reducer.cqvasr [2022-04-15 00:45:52,451 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:45:52,452 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:45:52,549 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:45:52,554 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-15 00:45:52,560 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:45:52,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:45:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 00:45:52,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:45:52,579 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:45:52,580 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:45:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:45:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash 456799944, now seen corresponding path program 1 times [2022-04-15 00:45:52,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:45:52,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309033754] [2022-04-15 00:45:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:45:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:45:52,682 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 00:45:52,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1532986438] [2022-04-15 00:45:52,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:45:52,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:45:52,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:45:52,687 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-15 00:45:52,703 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-15 00:45:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:45:52,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 00:45:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:45:52,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:45:53,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 00:45:53,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= v_~__return_96~0_2 0) (= 0 v_~__return_main~0_9) (= (select |v_#length_1| 3) 12) (= (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{~__return_main~0=v_~__return_main~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_96~0=v_~__return_96~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_96~0, #NULL.base] {24#true} is VALID [2022-04-15 00:45:53,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 00:45:53,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 00:45:53,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 00:45:53,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [65] mainENTRY-->L19: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__n~0_4) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_6, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {24#true} is VALID [2022-04-15 00:45:53,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [68] L19-->L25: Formula: (<= 1 v_main_~main__n~0_8) InVars {main_~main__n~0=v_main_~main__n~0_8} OutVars{main_~main__n~0=v_main_~main__n~0_8} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 00:45:53,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [71] L25-->L33: Formula: (and (<= v_main_~main__n~0_14 1000) (= v_main_~main__i~0_11 1) (= v_main_~main__sum~0_7 0)) InVars {main_~main__n~0=v_main_~main__n~0_14} OutVars{main_~main__n~0=v_main_~main__n~0_14, main_~main__sum~0=v_main_~main__sum~0_7, main_~main__i~0=v_main_~main__i~0_11} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {50#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 00:45:53,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {50#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} [72] L33-->L37: Formula: (and (<= v_main_~main__i~0_14 v_main_~main__n~0_16) (= (+ v_main_~main__i~0_14 1) v_main_~main__i~0_13) (= v_main_~main__sum~0_8 (+ v_main_~main__sum~0_9 v_main_~main__i~0_14))) InVars {main_~main__n~0=v_main_~main__n~0_16, main_~main__sum~0=v_main_~main__sum~0_9, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__n~0=v_main_~main__n~0_16, main_~main__sum~0=v_main_~main__sum~0_8, main_~main__i~0=v_main_~main__i~0_13} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {54#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} is VALID [2022-04-15 00:45:53,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {54#(and (= (+ (- 1) main_~main__i~0) main_~main__sum~0) (= (+ (- 1) main_~main__i~0) 1))} [74] L37-->L41: Formula: (and (= (+ v_main_~main__i~0_16 v_main_~main__sum~0_11) v_main_~main__sum~0_10) (<= v_main_~main__i~0_16 v_main_~main__n~0_17) (= (+ v_main_~main__i~0_16 1) v_main_~main__i~0_15)) InVars {main_~main__n~0=v_main_~main__n~0_17, main_~main__sum~0=v_main_~main__sum~0_11, main_~main__i~0=v_main_~main__i~0_16} OutVars{main_~main__n~0=v_main_~main__n~0_17, main_~main__sum~0=v_main_~main__sum~0_10, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {58#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} is VALID [2022-04-15 00:45:53,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {58#(and (= (+ (- 2) main_~main__i~0) 1) (= main_~main__sum~0 (+ (* 2 main_~main__i~0) (- 3))))} [76] L41-->L45: Formula: (and (= (+ v_main_~main__i~0_18 1) v_main_~main__i~0_17) (<= v_main_~main__i~0_18 v_main_~main__n~0_18) (= (+ v_main_~main__i~0_18 v_main_~main__sum~0_13) v_main_~main__sum~0_12)) InVars {main_~main__n~0=v_main_~main__n~0_18, main_~main__sum~0=v_main_~main__sum~0_13, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~main__n~0=v_main_~main__n~0_18, main_~main__sum~0=v_main_~main__sum~0_12, main_~main__i~0=v_main_~main__i~0_17} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {62#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} is VALID [2022-04-15 00:45:53,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {62#(and (= main_~main__sum~0 6) (= 4 main_~main__i~0))} [78] L45-->L49: Formula: (and (= (+ v_main_~main__i~0_20 v_main_~main__sum~0_15) v_main_~main__sum~0_14) (= (+ v_main_~main__i~0_20 1) v_main_~main__i~0_19) (<= v_main_~main__i~0_20 v_main_~main__n~0_19)) InVars {main_~main__n~0=v_main_~main__n~0_19, main_~main__sum~0=v_main_~main__sum~0_15, main_~main__i~0=v_main_~main__i~0_20} OutVars{main_~main__n~0=v_main_~main__n~0_19, main_~main__sum~0=v_main_~main__sum~0_14, main_~main__i~0=v_main_~main__i~0_19} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {66#(and (= (+ (- 1) main_~main__i~0) 4) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} is VALID [2022-04-15 00:45:53,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {66#(and (= (+ (- 1) main_~main__i~0) 4) (= 6 (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)))} [80] L49-->L58: Formula: (and (<= v_main_~main__i~0_2 v_main_~main__n~0_1) (= (+ v_main_~main__sum~0_2 v_main_~main__i~0_2) v_main_~main__sum~0_1) (= (+ v_main_~main__i~0_2 1) v_main_~main__i~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_1, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_1, main_~main__sum~0=v_main_~main__sum~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {70#(and (= (+ (- 9) main_~main__sum~0) 6) (<= 5 main_~main__n~0) (<= main_~main__i~0 6))} is VALID [2022-04-15 00:45:53,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {70#(and (= (+ (- 9) main_~main__sum~0) 6) (<= 5 main_~main__n~0) (<= main_~main__i~0 6))} [83] L58-->L67: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (<= v_main_~main__i~0_5 v_main_~main__n~0_3)) (= (ite (= (* 2 v_main_~main__sum~0_5) (* (+ v_main_~main__n~0_3 1) v_main_~main__n~0_3)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_5, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {74#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 00:45:53,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {74#(<= 1 main_~__VERIFIER_assert__cond~0)} [84] L67-->L69: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 00:45:53,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {25#false} [86] L69-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 00:45:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:45:53,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 00:45:53,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:45:53,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309033754] [2022-04-15 00:45:53,327 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 00:45:53,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532986438] [2022-04-15 00:45:53,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532986438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:45:53,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:45:53,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 00:45:53,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912515199] [2022-04-15 00:45:53,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:45:53,336 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 00:45:53,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:45:53,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:53,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:45:53,362 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 00:45:53,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:45:53,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 00:45:53,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-15 00:45:53,391 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:53,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:45:53,696 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 00:45:53,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 00:45:53,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 00:45:53,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:45:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 00:45:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 00:45:53,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-15 00:45:53,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:45:53,763 INFO L225 Difference]: With dead ends: 41 [2022-04-15 00:45:53,763 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 00:45:53,765 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-15 00:45:53,768 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:45:53,769 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 194 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:45:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 00:45:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 00:45:53,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:45:53,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:53,798 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:53,798 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:53,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:45:53,800 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 00:45:53,800 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 00:45:53,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:45:53,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:45:53,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 00:45:53,801 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 00:45:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:45:53,803 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 00:45:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 00:45:53,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:45:53,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:45:53,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:45:53,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:45:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 00:45:53,806 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-15 00:45:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:45:53,807 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 00:45:53,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 00:45:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 00:45:53,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:45:53,808 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:45:53,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 00:45:54,023 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-15 00:45:54,024 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:45:54,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:45:54,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1275865648, now seen corresponding path program 1 times [2022-04-15 00:45:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:45:54,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011055946] [2022-04-15 00:45:54,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:45:54,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:45:54,048 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 00:45:54,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962449816] [2022-04-15 00:45:54,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:45:54,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:45:54,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:45:54,054 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-15 00:45:54,055 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-15 00:45:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:45:54,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 00:45:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:45:54,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:45:54,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {189#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#true} is VALID [2022-04-15 00:45:54,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#true} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= v_~__return_96~0_2 0) (= 0 v_~__return_main~0_9) (= (select |v_#length_1| 3) 12) (= (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{~__return_main~0=v_~__return_main~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_96~0=v_~__return_96~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_96~0, #NULL.base] {189#true} is VALID [2022-04-15 00:45:54,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#true} is VALID [2022-04-15 00:45:54,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#true} is VALID [2022-04-15 00:45:54,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#true} is VALID [2022-04-15 00:45:54,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#true} [65] mainENTRY-->L19: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__n~0_4) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_6, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {189#true} is VALID [2022-04-15 00:45:54,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {189#true} [68] L19-->L25: Formula: (<= 1 v_main_~main__n~0_8) InVars {main_~main__n~0=v_main_~main__n~0_8} OutVars{main_~main__n~0=v_main_~main__n~0_8} AuxVars[] AssignedVars[] {189#true} is VALID [2022-04-15 00:45:54,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {189#true} [71] L25-->L33: Formula: (and (<= v_main_~main__n~0_14 1000) (= v_main_~main__i~0_11 1) (= v_main_~main__sum~0_7 0)) InVars {main_~main__n~0=v_main_~main__n~0_14} OutVars{main_~main__n~0=v_main_~main__n~0_14, main_~main__sum~0=v_main_~main__sum~0_7, main_~main__i~0=v_main_~main__i~0_11} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {215#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 00:45:54,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {215#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} [72] L33-->L37: Formula: (and (<= v_main_~main__i~0_14 v_main_~main__n~0_16) (= (+ v_main_~main__i~0_14 1) v_main_~main__i~0_13) (= v_main_~main__sum~0_8 (+ v_main_~main__sum~0_9 v_main_~main__i~0_14))) InVars {main_~main__n~0=v_main_~main__n~0_16, main_~main__sum~0=v_main_~main__sum~0_9, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__n~0=v_main_~main__n~0_16, main_~main__sum~0=v_main_~main__sum~0_8, main_~main__i~0=v_main_~main__i~0_13} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {219#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} is VALID [2022-04-15 00:45:54,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {219#(and (= 2 main_~main__i~0) (= (+ (- 1) main_~main__sum~0) 0))} [74] L37-->L41: Formula: (and (= (+ v_main_~main__i~0_16 v_main_~main__sum~0_11) v_main_~main__sum~0_10) (<= v_main_~main__i~0_16 v_main_~main__n~0_17) (= (+ v_main_~main__i~0_16 1) v_main_~main__i~0_15)) InVars {main_~main__n~0=v_main_~main__n~0_17, main_~main__sum~0=v_main_~main__sum~0_11, main_~main__i~0=v_main_~main__i~0_16} OutVars{main_~main__n~0=v_main_~main__n~0_17, main_~main__sum~0=v_main_~main__sum~0_10, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {223#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} is VALID [2022-04-15 00:45:54,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {223#(and (= 0 (+ main_~main__sum~0 (* (- 1) main_~main__i~0))) (= (+ (- 1) main_~main__i~0) 2))} [76] L41-->L45: Formula: (and (= (+ v_main_~main__i~0_18 1) v_main_~main__i~0_17) (<= v_main_~main__i~0_18 v_main_~main__n~0_18) (= (+ v_main_~main__i~0_18 v_main_~main__sum~0_13) v_main_~main__sum~0_12)) InVars {main_~main__n~0=v_main_~main__n~0_18, main_~main__sum~0=v_main_~main__sum~0_13, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~main__n~0=v_main_~main__n~0_18, main_~main__sum~0=v_main_~main__sum~0_12, main_~main__i~0=v_main_~main__i~0_17} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {227#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0))} is VALID [2022-04-15 00:45:54,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {227#(and (= 2 (+ (- 2) main_~main__i~0)) (= (+ main_~main__sum~0 2 (* (- 2) main_~main__i~0)) 0))} [78] L45-->L49: Formula: (and (= (+ v_main_~main__i~0_20 v_main_~main__sum~0_15) v_main_~main__sum~0_14) (= (+ v_main_~main__i~0_20 1) v_main_~main__i~0_19) (<= v_main_~main__i~0_20 v_main_~main__n~0_19)) InVars {main_~main__n~0=v_main_~main__n~0_19, main_~main__sum~0=v_main_~main__sum~0_15, main_~main__i~0=v_main_~main__i~0_20} OutVars{main_~main__n~0=v_main_~main__n~0_19, main_~main__sum~0=v_main_~main__sum~0_14, main_~main__i~0=v_main_~main__i~0_19} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {231#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0))} is VALID [2022-04-15 00:45:54,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {231#(and (= 5 main_~main__i~0) (= (+ main_~main__sum~0 (- 10)) 0))} [80] L49-->L58: Formula: (and (<= v_main_~main__i~0_2 v_main_~main__n~0_1) (= (+ v_main_~main__sum~0_2 v_main_~main__i~0_2) v_main_~main__sum~0_1) (= (+ v_main_~main__i~0_2 1) v_main_~main__i~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_1, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_1, main_~main__sum~0=v_main_~main__sum~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {235#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0))} is VALID [2022-04-15 00:45:54,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#(and (= (+ (- 1) main_~main__i~0) 5) (= (+ (- 9) main_~main__sum~0 (* (- 1) main_~main__i~0)) 0))} [82] L58-->L58: Formula: (and (= (+ v_main_~main__sum~0_4 v_main_~main__i~0_4) v_main_~main__sum~0_3) (= (+ v_main_~main__i~0_4 1) v_main_~main__i~0_3) (<= v_main_~main__i~0_4 v_main_~main__n~0_2)) InVars {main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {239#(and (<= main_~main__i~0 7) (<= 6 main_~main__n~0) (= main_~main__sum~0 21))} is VALID [2022-04-15 00:45:54,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#(and (<= main_~main__i~0 7) (<= 6 main_~main__n~0) (= main_~main__sum~0 21))} [83] L58-->L67: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (<= v_main_~main__i~0_5 v_main_~main__n~0_3)) (= (ite (= (* 2 v_main_~main__sum~0_5) (* (+ v_main_~main__n~0_3 1) v_main_~main__n~0_3)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_5, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {243#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 00:45:54,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#(<= 1 main_~__VERIFIER_assert__cond~0)} [84] L67-->L69: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {190#false} is VALID [2022-04-15 00:45:54,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {190#false} [86] L69-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#false} is VALID [2022-04-15 00:45:54,435 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-15 00:45:54,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:45:55,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {190#false} [86] L69-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#false} is VALID [2022-04-15 00:45:55,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#(<= 1 main_~__VERIFIER_assert__cond~0)} [84] L67-->L69: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {190#false} is VALID [2022-04-15 00:45:55,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {256#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} [83] L58-->L67: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (<= v_main_~main__i~0_5 v_main_~main__n~0_3)) (= (ite (= (* 2 v_main_~main__sum~0_5) (* (+ v_main_~main__n~0_3 1) v_main_~main__n~0_3)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_5, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {243#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 00:45:55,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} [82] L58-->L58: Formula: (and (= (+ v_main_~main__sum~0_4 v_main_~main__i~0_4) v_main_~main__sum~0_3) (= (+ v_main_~main__i~0_4 1) v_main_~main__i~0_3) (<= v_main_~main__i~0_4 v_main_~main__n~0_2)) InVars {main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {256#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 00:45:55,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} [80] L49-->L58: Formula: (and (<= v_main_~main__i~0_2 v_main_~main__n~0_1) (= (+ v_main_~main__sum~0_2 v_main_~main__i~0_2) v_main_~main__sum~0_1) (= (+ v_main_~main__i~0_2 1) v_main_~main__i~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_1, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_1, main_~main__sum~0=v_main_~main__sum~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 00:45:55,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} [78] L45-->L49: Formula: (and (= (+ v_main_~main__i~0_20 v_main_~main__sum~0_15) v_main_~main__sum~0_14) (= (+ v_main_~main__i~0_20 1) v_main_~main__i~0_19) (<= v_main_~main__i~0_20 v_main_~main__n~0_19)) InVars {main_~main__n~0=v_main_~main__n~0_19, main_~main__sum~0=v_main_~main__sum~0_15, main_~main__i~0=v_main_~main__i~0_20} OutVars{main_~main__n~0=v_main_~main__n~0_19, main_~main__sum~0=v_main_~main__sum~0_14, main_~main__i~0=v_main_~main__i~0_19} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 00:45:55,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} [76] L41-->L45: Formula: (and (= (+ v_main_~main__i~0_18 1) v_main_~main__i~0_17) (<= v_main_~main__i~0_18 v_main_~main__n~0_18) (= (+ v_main_~main__i~0_18 v_main_~main__sum~0_13) v_main_~main__sum~0_12)) InVars {main_~main__n~0=v_main_~main__n~0_18, main_~main__sum~0=v_main_~main__sum~0_13, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~main__n~0=v_main_~main__n~0_18, main_~main__sum~0=v_main_~main__sum~0_12, main_~main__i~0=v_main_~main__i~0_17} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 00:45:55,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} [74] L37-->L41: Formula: (and (= (+ v_main_~main__i~0_16 v_main_~main__sum~0_11) v_main_~main__sum~0_10) (<= v_main_~main__i~0_16 v_main_~main__n~0_17) (= (+ v_main_~main__i~0_16 1) v_main_~main__i~0_15)) InVars {main_~main__n~0=v_main_~main__n~0_17, main_~main__sum~0=v_main_~main__sum~0_11, main_~main__i~0=v_main_~main__i~0_16} OutVars{main_~main__n~0=v_main_~main__n~0_17, main_~main__sum~0=v_main_~main__sum~0_10, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 00:45:55,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} [72] L33-->L37: Formula: (and (<= v_main_~main__i~0_14 v_main_~main__n~0_16) (= (+ v_main_~main__i~0_14 1) v_main_~main__i~0_13) (= v_main_~main__sum~0_8 (+ v_main_~main__sum~0_9 v_main_~main__i~0_14))) InVars {main_~main__n~0=v_main_~main__n~0_16, main_~main__sum~0=v_main_~main__sum~0_9, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__n~0=v_main_~main__n~0_16, main_~main__sum~0=v_main_~main__sum~0_8, main_~main__i~0=v_main_~main__i~0_13} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 00:45:55,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {189#true} [71] L25-->L33: Formula: (and (<= v_main_~main__n~0_14 1000) (= v_main_~main__i~0_11 1) (= v_main_~main__sum~0_7 0)) InVars {main_~main__n~0=v_main_~main__n~0_14} OutVars{main_~main__n~0=v_main_~main__n~0_14, main_~main__sum~0=v_main_~main__sum~0_7, main_~main__i~0=v_main_~main__i~0_11} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {260#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 00:45:55,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {189#true} [68] L19-->L25: Formula: (<= 1 v_main_~main__n~0_8) InVars {main_~main__n~0=v_main_~main__n~0_8} OutVars{main_~main__n~0=v_main_~main__n~0_8} AuxVars[] AssignedVars[] {189#true} is VALID [2022-04-15 00:45:55,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#true} [65] mainENTRY-->L19: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__n~0_4) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_6, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {189#true} is VALID [2022-04-15 00:45:55,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#true} is VALID [2022-04-15 00:45:55,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#true} is VALID [2022-04-15 00:45:55,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#true} is VALID [2022-04-15 00:45:55,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#true} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= v_~__return_96~0_2 0) (= 0 v_~__return_main~0_9) (= (select |v_#length_1| 3) 12) (= (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{~__return_main~0=v_~__return_main~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_96~0=v_~__return_96~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_96~0, #NULL.base] {189#true} is VALID [2022-04-15 00:45:55,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {189#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#true} is VALID [2022-04-15 00:45:55,553 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-15 00:45:55,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:45:55,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011055946] [2022-04-15 00:45:55,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 00:45:55,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962449816] [2022-04-15 00:45:55,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962449816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:45:55,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 00:45:55,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 12 [2022-04-15 00:45:55,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258216515] [2022-04-15 00:45:55,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 00:45:55,555 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 00:45:55,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:45:55,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:55,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:45:55,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 00:45:55,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:45:55,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 00:45:55,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:45:55,667 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:45:55,875 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 00:45:55,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 00:45:55,875 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 00:45:55,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:45:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2022-04-15 00:45:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2022-04-15 00:45:55,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 22 transitions. [2022-04-15 00:45:55,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:45:55,904 INFO L225 Difference]: With dead ends: 22 [2022-04-15 00:45:55,904 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 00:45:55,905 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-15 00:45:55,906 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:45:55,906 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 4 Unchecked, 0.1s Time] [2022-04-15 00:45:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 00:45:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 00:45:55,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:45:55,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:55,911 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:55,911 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:55,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:45:55,912 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 00:45:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 00:45:55,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:45:55,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:45:55,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 00:45:55,913 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 00:45:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:45:55,914 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 00:45:55,914 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 00:45:55,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:45:55,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:45:55,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:45:55,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:45:55,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-15 00:45:55,915 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-15 00:45:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:45:55,915 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-15 00:45:55,916 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 00:45:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 00:45:55,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:45:55,916 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:45:55,937 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-15 00:45:56,131 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,SelfDestructingSolverStorable1 [2022-04-15 00:45:56,132 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:45:56,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:45:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash 897098696, now seen corresponding path program 2 times [2022-04-15 00:45:56,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:45:56,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519042861] [2022-04-15 00:45:56,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:45:56,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:45:56,149 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 00:45:56,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1113592422] [2022-04-15 00:45:56,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 00:45:56,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:45:56,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:45:56,150 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:45:56,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 00:45:56,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 00:45:56,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:45:56,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 00:45:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:45:56,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:45:56,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {407#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407#true} is VALID [2022-04-15 00:45:56,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {407#true} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= v_~__return_96~0_2 0) (= 0 v_~__return_main~0_9) (= (select |v_#length_1| 3) 12) (= (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{~__return_main~0=v_~__return_main~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_96~0=v_~__return_96~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_96~0, #NULL.base] {407#true} is VALID [2022-04-15 00:45:56,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {407#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407#true} is VALID [2022-04-15 00:45:56,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407#true} is VALID [2022-04-15 00:45:56,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {407#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407#true} is VALID [2022-04-15 00:45:56,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {407#true} [65] mainENTRY-->L19: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__n~0_4) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_6, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {407#true} is VALID [2022-04-15 00:45:56,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {407#true} [68] L19-->L25: Formula: (<= 1 v_main_~main__n~0_8) InVars {main_~main__n~0=v_main_~main__n~0_8} OutVars{main_~main__n~0=v_main_~main__n~0_8} AuxVars[] AssignedVars[] {407#true} is VALID [2022-04-15 00:45:56,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {407#true} [71] L25-->L33: Formula: (and (<= v_main_~main__n~0_14 1000) (= v_main_~main__i~0_11 1) (= v_main_~main__sum~0_7 0)) InVars {main_~main__n~0=v_main_~main__n~0_14} OutVars{main_~main__n~0=v_main_~main__n~0_14, main_~main__sum~0=v_main_~main__sum~0_7, main_~main__i~0=v_main_~main__i~0_11} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {433#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-15 00:45:56,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {433#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} [72] L33-->L37: Formula: (and (<= v_main_~main__i~0_14 v_main_~main__n~0_16) (= (+ v_main_~main__i~0_14 1) v_main_~main__i~0_13) (= v_main_~main__sum~0_8 (+ v_main_~main__sum~0_9 v_main_~main__i~0_14))) InVars {main_~main__n~0=v_main_~main__n~0_16, main_~main__sum~0=v_main_~main__sum~0_9, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__n~0=v_main_~main__n~0_16, main_~main__sum~0=v_main_~main__sum~0_8, main_~main__i~0=v_main_~main__i~0_13} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {437#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-15 00:45:56,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {437#(and (= 2 main_~main__i~0) (= main_~main__sum~0 1))} [74] L37-->L41: Formula: (and (= (+ v_main_~main__i~0_16 v_main_~main__sum~0_11) v_main_~main__sum~0_10) (<= v_main_~main__i~0_16 v_main_~main__n~0_17) (= (+ v_main_~main__i~0_16 1) v_main_~main__i~0_15)) InVars {main_~main__n~0=v_main_~main__n~0_17, main_~main__sum~0=v_main_~main__sum~0_11, main_~main__i~0=v_main_~main__i~0_16} OutVars{main_~main__n~0=v_main_~main__n~0_17, main_~main__sum~0=v_main_~main__sum~0_10, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {441#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} is VALID [2022-04-15 00:45:56,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {441#(and (= (+ (- 2) main_~main__sum~0) 1) (= 3 main_~main__i~0))} [76] L41-->L45: Formula: (and (= (+ v_main_~main__i~0_18 1) v_main_~main__i~0_17) (<= v_main_~main__i~0_18 v_main_~main__n~0_18) (= (+ v_main_~main__i~0_18 v_main_~main__sum~0_13) v_main_~main__sum~0_12)) InVars {main_~main__n~0=v_main_~main__n~0_18, main_~main__sum~0=v_main_~main__sum~0_13, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~main__n~0=v_main_~main__n~0_18, main_~main__sum~0=v_main_~main__sum~0_12, main_~main__i~0=v_main_~main__i~0_17} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {445#(and (= (+ main_~main__sum~0 (- 5)) 1) (= 4 main_~main__i~0))} is VALID [2022-04-15 00:45:56,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {445#(and (= (+ main_~main__sum~0 (- 5)) 1) (= 4 main_~main__i~0))} [78] L45-->L49: Formula: (and (= (+ v_main_~main__i~0_20 v_main_~main__sum~0_15) v_main_~main__sum~0_14) (= (+ v_main_~main__i~0_20 1) v_main_~main__i~0_19) (<= v_main_~main__i~0_20 v_main_~main__n~0_19)) InVars {main_~main__n~0=v_main_~main__n~0_19, main_~main__sum~0=v_main_~main__sum~0_15, main_~main__i~0=v_main_~main__i~0_20} OutVars{main_~main__n~0=v_main_~main__n~0_19, main_~main__sum~0=v_main_~main__sum~0_14, main_~main__i~0=v_main_~main__i~0_19} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {449#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} is VALID [2022-04-15 00:45:56,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {449#(and (= (+ (- 1) main_~main__i~0) 4) (= main_~main__sum~0 (+ 5 main_~main__i~0)))} [80] L49-->L58: Formula: (and (<= v_main_~main__i~0_2 v_main_~main__n~0_1) (= (+ v_main_~main__sum~0_2 v_main_~main__i~0_2) v_main_~main__sum~0_1) (= (+ v_main_~main__i~0_2 1) v_main_~main__i~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_1, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_1, main_~main__sum~0=v_main_~main__sum~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {453#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} is VALID [2022-04-15 00:45:56,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {453#(and (= (+ 4 main_~main__i~0) (+ main_~main__sum~0 (* (- 1) main_~main__i~0) 1)) (= (+ (- 2) main_~main__i~0) 4))} [82] L58-->L58: Formula: (and (= (+ v_main_~main__sum~0_4 v_main_~main__i~0_4) v_main_~main__sum~0_3) (= (+ v_main_~main__i~0_4 1) v_main_~main__i~0_3) (<= v_main_~main__i~0_4 v_main_~main__n~0_2)) InVars {main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {457#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ 3 main_~main__i~0)) (= (+ (- 3) main_~main__i~0) 4))} is VALID [2022-04-15 00:45:56,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {457#(and (= (+ main_~main__sum~0 (* (- 2) main_~main__i~0) 3) (+ 3 main_~main__i~0)) (= (+ (- 3) main_~main__i~0) 4))} [82] L58-->L58: Formula: (and (= (+ v_main_~main__sum~0_4 v_main_~main__i~0_4) v_main_~main__sum~0_3) (= (+ v_main_~main__i~0_4 1) v_main_~main__i~0_3) (<= v_main_~main__i~0_4 v_main_~main__n~0_2)) InVars {main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {461#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} is VALID [2022-04-15 00:45:56,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {461#(and (<= main_~main__i~0 8) (<= 7 main_~main__n~0) (= main_~main__sum~0 28))} [83] L58-->L67: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (<= v_main_~main__i~0_5 v_main_~main__n~0_3)) (= (ite (= (* 2 v_main_~main__sum~0_5) (* (+ v_main_~main__n~0_3 1) v_main_~main__n~0_3)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_5, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {465#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 00:45:56,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {465#(<= 1 main_~__VERIFIER_assert__cond~0)} [84] L67-->L69: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {408#false} is VALID [2022-04-15 00:45:56,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {408#false} [86] L69-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {408#false} is VALID [2022-04-15 00:45:56,480 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-15 00:45:56,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:45:57,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {408#false} [86] L69-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {408#false} is VALID [2022-04-15 00:45:57,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {465#(<= 1 main_~__VERIFIER_assert__cond~0)} [84] L67-->L69: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {408#false} is VALID [2022-04-15 00:45:57,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {478#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} [83] L58-->L67: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (<= v_main_~main__i~0_5 v_main_~main__n~0_3)) (= (ite (= (* 2 v_main_~main__sum~0_5) (* (+ v_main_~main__n~0_3 1) v_main_~main__n~0_3)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_5, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {465#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 00:45:57,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} [82] L58-->L58: Formula: (and (= (+ v_main_~main__sum~0_4 v_main_~main__i~0_4) v_main_~main__sum~0_3) (= (+ v_main_~main__i~0_4 1) v_main_~main__i~0_3) (<= v_main_~main__i~0_4 v_main_~main__n~0_2)) InVars {main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {478#(or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))} is VALID [2022-04-15 00:45:57,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} [82] L58-->L58: Formula: (and (= (+ v_main_~main__sum~0_4 v_main_~main__i~0_4) v_main_~main__sum~0_3) (= (+ v_main_~main__i~0_4 1) v_main_~main__i~0_3) (<= v_main_~main__i~0_4 v_main_~main__n~0_2)) InVars {main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~main__n~0=v_main_~main__n~0_2, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 00:45:57,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} [80] L49-->L58: Formula: (and (<= v_main_~main__i~0_2 v_main_~main__n~0_1) (= (+ v_main_~main__sum~0_2 v_main_~main__i~0_2) v_main_~main__sum~0_1) (= (+ v_main_~main__i~0_2 1) v_main_~main__i~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_1, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_1, main_~main__sum~0=v_main_~main__sum~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 00:45:57,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} [78] L45-->L49: Formula: (and (= (+ v_main_~main__i~0_20 v_main_~main__sum~0_15) v_main_~main__sum~0_14) (= (+ v_main_~main__i~0_20 1) v_main_~main__i~0_19) (<= v_main_~main__i~0_20 v_main_~main__n~0_19)) InVars {main_~main__n~0=v_main_~main__n~0_19, main_~main__sum~0=v_main_~main__sum~0_15, main_~main__i~0=v_main_~main__i~0_20} OutVars{main_~main__n~0=v_main_~main__n~0_19, main_~main__sum~0=v_main_~main__sum~0_14, main_~main__i~0=v_main_~main__i~0_19} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 00:45:57,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} [76] L41-->L45: Formula: (and (= (+ v_main_~main__i~0_18 1) v_main_~main__i~0_17) (<= v_main_~main__i~0_18 v_main_~main__n~0_18) (= (+ v_main_~main__i~0_18 v_main_~main__sum~0_13) v_main_~main__sum~0_12)) InVars {main_~main__n~0=v_main_~main__n~0_18, main_~main__sum~0=v_main_~main__sum~0_13, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~main__n~0=v_main_~main__n~0_18, main_~main__sum~0=v_main_~main__sum~0_12, main_~main__i~0=v_main_~main__i~0_17} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 00:45:57,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} [74] L37-->L41: Formula: (and (= (+ v_main_~main__i~0_16 v_main_~main__sum~0_11) v_main_~main__sum~0_10) (<= v_main_~main__i~0_16 v_main_~main__n~0_17) (= (+ v_main_~main__i~0_16 1) v_main_~main__i~0_15)) InVars {main_~main__n~0=v_main_~main__n~0_17, main_~main__sum~0=v_main_~main__sum~0_11, main_~main__i~0=v_main_~main__i~0_16} OutVars{main_~main__n~0=v_main_~main__n~0_17, main_~main__sum~0=v_main_~main__sum~0_10, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 00:45:57,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} [72] L33-->L37: Formula: (and (<= v_main_~main__i~0_14 v_main_~main__n~0_16) (= (+ v_main_~main__i~0_14 1) v_main_~main__i~0_13) (= v_main_~main__sum~0_8 (+ v_main_~main__sum~0_9 v_main_~main__i~0_14))) InVars {main_~main__n~0=v_main_~main__n~0_16, main_~main__sum~0=v_main_~main__sum~0_9, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__n~0=v_main_~main__n~0_16, main_~main__sum~0=v_main_~main__sum~0_8, main_~main__i~0=v_main_~main__i~0_13} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 00:45:57,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {407#true} [71] L25-->L33: Formula: (and (<= v_main_~main__n~0_14 1000) (= v_main_~main__i~0_11 1) (= v_main_~main__sum~0_7 0)) InVars {main_~main__n~0=v_main_~main__n~0_14} OutVars{main_~main__n~0=v_main_~main__n~0_14, main_~main__sum~0=v_main_~main__sum~0_7, main_~main__i~0=v_main_~main__i~0_11} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {482#(forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0)))))} is VALID [2022-04-15 00:45:57,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {407#true} [68] L19-->L25: Formula: (<= 1 v_main_~main__n~0_8) InVars {main_~main__n~0=v_main_~main__n~0_8} OutVars{main_~main__n~0=v_main_~main__n~0_8} AuxVars[] AssignedVars[] {407#true} is VALID [2022-04-15 00:45:57,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {407#true} [65] mainENTRY-->L19: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__n~0_4) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_6, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {407#true} is VALID [2022-04-15 00:45:57,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {407#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407#true} is VALID [2022-04-15 00:45:57,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407#true} is VALID [2022-04-15 00:45:57,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {407#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407#true} is VALID [2022-04-15 00:45:57,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {407#true} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= v_~__return_96~0_2 0) (= 0 v_~__return_main~0_9) (= (select |v_#length_1| 3) 12) (= (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{~__return_main~0=v_~__return_main~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_96~0=v_~__return_96~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_96~0, #NULL.base] {407#true} is VALID [2022-04-15 00:45:57,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {407#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {407#true} is VALID [2022-04-15 00:45:57,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 00:45:57,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:45:57,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519042861] [2022-04-15 00:45:57,541 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 00:45:57,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113592422] [2022-04-15 00:45:57,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113592422] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:45:57,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 00:45:57,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2022-04-15 00:45:57,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3459756] [2022-04-15 00:45:57,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 00:45:57,542 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 00:45:57,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:45:57,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:57,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:45:57,621 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 00:45:57,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:45:57,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 00:45:57,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-15 00:45:57,622 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:45:58,032 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-15 00:45:58,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 00:45:58,033 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 00:45:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:45:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2022-04-15 00:45:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2022-04-15 00:45:58,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 21 transitions. [2022-04-15 00:45:58,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:45:58,093 INFO L225 Difference]: With dead ends: 20 [2022-04-15 00:45:58,093 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:45:58,094 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-04-15 00:45:58,094 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:45:58,095 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 3 Unchecked, 0.1s Time] [2022-04-15 00:45:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:45:58,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:45:58,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:45:58,096 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-15 00:45:58,096 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-15 00:45:58,096 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-15 00:45:58,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:45:58,096 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:45:58,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:45:58,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:45:58,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:45:58,096 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-15 00:45:58,096 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-15 00:45:58,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:45:58,096 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:45:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:45:58,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:45:58,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:45:58,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:45:58,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:45:58,097 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-15 00:45:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:45:58,097 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-15 00:45:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:45:58,097 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:45:58,097 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:45:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:45:58,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:45:58,100 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:45:58,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 00:45:58,300 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:45:58,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:45:58,409 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:45:58,410 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:45:58,410 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:45:58,410 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:45:58,410 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:45:58,410 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:45:58,410 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:45:58,410 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 13 106) the Hoare annotation is: true [2022-04-15 00:45:58,410 INFO L882 garLoopResultBuilder]: For program point L19(lines 19 105) no Hoare annotation was computed. [2022-04-15 00:45:58,410 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 13 106) no Hoare annotation was computed. [2022-04-15 00:45:58,410 INFO L882 garLoopResultBuilder]: For program point L25(lines 25 104) no Hoare annotation was computed. [2022-04-15 00:45:58,410 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 13 106) no Hoare annotation was computed. [2022-04-15 00:45:58,410 INFO L882 garLoopResultBuilder]: For program point L33(lines 33 103) no Hoare annotation was computed. [2022-04-15 00:45:58,410 INFO L882 garLoopResultBuilder]: For program point L37(lines 37 98) no Hoare annotation was computed. [2022-04-15 00:45:58,411 INFO L882 garLoopResultBuilder]: For program point L41(lines 41 93) no Hoare annotation was computed. [2022-04-15 00:45:58,411 INFO L882 garLoopResultBuilder]: For program point L45(lines 45 88) no Hoare annotation was computed. [2022-04-15 00:45:58,411 INFO L882 garLoopResultBuilder]: For program point L49(lines 49 83) no Hoare annotation was computed. [2022-04-15 00:45:58,411 INFO L878 garLoopResultBuilder]: At program point L58(lines 50 79) the Hoare annotation is: (and (forall ((main_~main__n~0 Int)) (or (<= (+ main_~main__i~0 1) main_~main__n~0) (not (<= main_~main__i~0 main_~main__n~0)) (= (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0) (+ (* main_~main__sum~0 2) (* 2 main_~main__i~0))))) (or (= (* main_~main__sum~0 2) (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= main_~main__i~0 main_~main__n~0))) [2022-04-15 00:45:58,411 INFO L882 garLoopResultBuilder]: For program point L67(lines 67 76) no Hoare annotation was computed. [2022-04-15 00:45:58,411 INFO L882 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2022-04-15 00:45:58,411 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 69) no Hoare annotation was computed. [2022-04-15 00:45:58,413 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-15 00:45:58,414 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:45:58,416 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:45:58,416 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:45:58,416 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:45:58,416 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:45:58,416 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-15 00:45:58,417 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-15 00:45:58,428 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-04-15 00:45:58,428 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-04-15 00:45:58,428 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-04-15 00:45:58,428 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-04-15 00:45:58,428 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-04-15 00:45:58,428 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:45:58,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:45:58 BasicIcfg [2022-04-15 00:45:58,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:45:58,438 INFO L158 Benchmark]: Toolchain (without parser) took 6595.32ms. Allocated memory was 186.6MB in the beginning and 244.3MB in the end (delta: 57.7MB). Free memory was 135.6MB in the beginning and 167.6MB in the end (delta: -32.1MB). Peak memory consumption was 26.1MB. Max. memory is 8.0GB. [2022-04-15 00:45:58,439 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 186.6MB. Free memory was 152.4MB in the beginning and 152.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:45:58,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.52ms. Allocated memory is still 186.6MB. Free memory was 135.4MB in the beginning and 161.7MB in the end (delta: -26.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 00:45:58,440 INFO L158 Benchmark]: Boogie Preprocessor took 18.19ms. Allocated memory is still 186.6MB. Free memory was 161.7MB in the beginning and 160.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:45:58,440 INFO L158 Benchmark]: RCFGBuilder took 328.95ms. Allocated memory is still 186.6MB. Free memory was 160.1MB in the beginning and 148.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 00:45:58,440 INFO L158 Benchmark]: IcfgTransformer took 34.81ms. Allocated memory is still 186.6MB. Free memory was 148.6MB in the beginning and 146.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:45:58,441 INFO L158 Benchmark]: TraceAbstraction took 5999.51ms. Allocated memory was 186.6MB in the beginning and 244.3MB in the end (delta: 57.7MB). Free memory was 146.2MB in the beginning and 167.6MB in the end (delta: -21.4MB). Peak memory consumption was 37.0MB. Max. memory is 8.0GB. [2022-04-15 00:45:58,444 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 186.6MB. Free memory was 152.4MB in the beginning and 152.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.52ms. Allocated memory is still 186.6MB. Free memory was 135.4MB in the beginning and 161.7MB in the end (delta: -26.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.19ms. Allocated memory is still 186.6MB. Free memory was 161.7MB in the beginning and 160.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 328.95ms. Allocated memory is still 186.6MB. Free memory was 160.1MB in the beginning and 148.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 34.81ms. Allocated memory is still 186.6MB. Free memory was 148.6MB in the beginning and 146.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5999.51ms. Allocated memory was 186.6MB in the beginning and 244.3MB in the end (delta: 57.7MB). Free memory was 146.2MB in the beginning and 167.6MB in the end (delta: -21.4MB). Peak memory consumption was 37.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] * 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: 69]: 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 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 297 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7 IncrementalHoareTripleChecker+Unchecked, 252 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 45 mSDtfsCounter, 250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 13 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 31, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 8 NumberOfFragments, 42 HoareAnnotationTreeSize, 5 FomulaSimplifications, 28 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 95 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 81 ConstructedInterpolants, 13 QuantifiedInterpolants, 618 SizeOfPredicates, 14 NumberOfNonLiveVariables, 303 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1/8 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: 50]: Loop Invariant [2022-04-15 00:45:58,457 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,457 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,457 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,457 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,457 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,457 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,458 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,458 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,458 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-15 00:45:58,458 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] Derived loop invariant: (forall main_~main__n~0 : int :: (main__i + 1 <= main_~main__n~0 || !(main__i <= main_~main__n~0)) || main_~main__n~0 * main_~main__n~0 + main_~main__n~0 == main__sum * 2 + 2 * main__i) && (main__sum * 2 == main__n * main__n + main__n || main__i <= main__n) RESULT: Ultimate proved your program to be correct! [2022-04-15 00:45:58,468 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...