/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.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 22:39:09,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:39:09,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:39:09,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:39:09,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:39:09,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:39:09,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:39:09,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:39:09,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:39:09,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:39:09,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:39:09,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:39:09,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:39:09,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:39:09,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:39:09,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:39:09,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:39:09,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:39:09,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:39:09,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:39:09,839 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:39:09,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:39:09,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:39:09,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:39:09,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:39:09,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:39:09,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:39:09,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:39:09,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:39:09,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:39:09,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:39:09,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:39:09,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:39:09,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:39:09,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:39:09,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:39:09,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:39:09,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:39:09,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:39:09,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:39:09,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:39:09,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:39:09,858 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:39:09,885 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:39:09,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:39:09,886 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:39:09,886 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:39:09,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:39:09,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:39:09,887 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:39:09,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:39:09,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:39:09,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:39:09,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:39:09,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:39:09,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:39:09,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:39:09,888 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:39:09,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:39:09,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:39:09,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:39:09,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:39:09,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:39:09,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:39:09,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:39:09,889 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:39:09,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:39:09,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:39:09,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:39:09,889 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:39:09,889 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:39:09,890 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:39:09,890 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 22:39:10,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:39:10,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:39:10,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:39:10,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:39:10,171 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:39:10,172 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i.v+cfa-reducer.c [2022-04-07 22:39:10,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1abc71320/b1f369114577431faf490b28e4587908/FLAG17fe46b26 [2022-04-07 22:39:10,588 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:39:10,589 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.v+cfa-reducer.c [2022-04-07 22:39:10,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1abc71320/b1f369114577431faf490b28e4587908/FLAG17fe46b26 [2022-04-07 22:39:10,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1abc71320/b1f369114577431faf490b28e4587908 [2022-04-07 22:39:10,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:39:10,619 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:39:10,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:39:10,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:39:10,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:39:10,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:39:10" (1/1) ... [2022-04-07 22:39:10,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2138cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:39:10, skipping insertion in model container [2022-04-07 22:39:10,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:39:10" (1/1) ... [2022-04-07 22:39:10,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:39:10,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:39:10,832 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.v+cfa-reducer.c[1014,1027] [2022-04-07 22:39:10,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:39:10,847 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:39:10,867 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.v+cfa-reducer.c[1014,1027] [2022-04-07 22:39:10,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:39:10,889 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:39:10,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:39:10 WrapperNode [2022-04-07 22:39:10,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:39:10,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:39:10,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:39:10,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:39:10,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:39:10" (1/1) ... [2022-04-07 22:39:10,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:39:10" (1/1) ... [2022-04-07 22:39:10,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:39:10" (1/1) ... [2022-04-07 22:39:10,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:39:10" (1/1) ... [2022-04-07 22:39:10,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:39:10" (1/1) ... [2022-04-07 22:39:10,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:39:10" (1/1) ... [2022-04-07 22:39:10,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:39:10" (1/1) ... [2022-04-07 22:39:10,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:39:10,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:39:10,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:39:10,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:39:10,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:39:10" (1/1) ... [2022-04-07 22:39:10,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:39:10,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:39:10,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 22:39:10,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 22:39:11,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:39:11,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:39:11,005 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:39:11,005 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 22:39:11,005 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:39:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:39:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:39:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:39:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:39:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 22:39:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:39:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 22:39:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:39:11,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:39:11,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:39:11,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:39:11,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:39:11,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:39:11,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:39:11,059 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:39:11,060 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:39:11,169 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:39:11,174 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:39:11,174 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-07 22:39:11,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:39:11 BoogieIcfgContainer [2022-04-07 22:39:11,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:39:11,176 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:39:11,176 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:39:11,177 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:39:11,180 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:39:11" (1/1) ... [2022-04-07 22:39:11,182 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:39:11,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:39:11 BasicIcfg [2022-04-07 22:39:11,199 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:39:11,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:39:11,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:39:11,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:39:11,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:39:10" (1/4) ... [2022-04-07 22:39:11,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484676aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:39:11, skipping insertion in model container [2022-04-07 22:39:11,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:39:10" (2/4) ... [2022-04-07 22:39:11,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484676aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:39:11, skipping insertion in model container [2022-04-07 22:39:11,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:39:11" (3/4) ... [2022-04-07 22:39:11,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484676aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:39:11, skipping insertion in model container [2022-04-07 22:39:11,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:39:11" (4/4) ... [2022-04-07 22:39:11,206 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.i.v+cfa-reducer.cqvasr [2022-04-07 22:39:11,209 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:39:11,210 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:39:11,253 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:39:11,258 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 22:39:11,258 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:39:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-07 22:39:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 22:39:11,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:39:11,277 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:39:11,277 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:39:11,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:39:11,282 INFO L85 PathProgramCache]: Analyzing trace with hash 323261602, now seen corresponding path program 1 times [2022-04-07 22:39:11,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:39:11,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784592853] [2022-04-07 22:39:11,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:39:11,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:39:11,418 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 22:39:11,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1052871271] [2022-04-07 22:39:11,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:39:11,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:39:11,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:39:11,439 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:39:11,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 22:39:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:39:11,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 22:39:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:39:11,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:39:11,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {19#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-07 22:39:11,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= v_~__return_60~0_2 0) (= (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) (= 0 v_~__return_main~0_4) (= (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_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_60~0=v_~__return_60~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_60~0, #NULL.offset, #NULL.base] {19#true} is VALID [2022-04-07 22:39:11,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-07 22:39:11,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-07 22:39:11,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-07 22:39:11,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#true} [45] mainENTRY-->L19: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__n~0_5) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |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_5, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {19#true} is VALID [2022-04-07 22:39:11,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {19#true} [48] L19-->L25: Formula: (<= 1 v_main_~main__n~0_9) InVars {main_~main__n~0=v_main_~main__n~0_9} OutVars{main_~main__n~0=v_main_~main__n~0_9} AuxVars[] AssignedVars[] {42#(<= 1 main_~main__n~0)} is VALID [2022-04-07 22:39:11,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#(<= 1 main_~main__n~0)} [51] L25-->L38: Formula: (and (<= v_main_~main__n~0_2 1000) (= v_main_~main__i~0_1 1) (= v_main_~main__sum~0_1 0)) InVars {main_~main__n~0=v_main_~main__n~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_2, 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] {46#(and (<= main_~main__i~0 1) (<= 1 main_~main__n~0))} is VALID [2022-04-07 22:39:11,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#(and (<= main_~main__i~0 1) (<= 1 main_~main__n~0))} [53] L38-->L47: Formula: (and (not (<= v_main_~main__i~0_4 v_main_~main__n~0_4)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (= (* (+ v_main_~main__n~0_4 1) v_main_~main__n~0_4) (* 2 v_main_~main__sum~0_4)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {20#false} is VALID [2022-04-07 22:39:11,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {20#false} [54] L47-->L49: 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[] {20#false} is VALID [2022-04-07 22:39:11,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {20#false} [56] L49-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#false} is VALID [2022-04-07 22:39:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:39:11,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 22:39:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:39:11,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784592853] [2022-04-07 22:39:11,753 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 22:39:11,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052871271] [2022-04-07 22:39:11,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052871271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:39:11,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:39:11,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 22:39:11,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639627005] [2022-04-07 22:39:11,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:39:11,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 11 [2022-04-07 22:39:11,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:39:11,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-07 22:39:11,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:39:11,781 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 22:39:11,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:39:11,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 22:39:11,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-07 22:39:11,804 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-07 22:39:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:39:11,874 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-07 22:39:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 22:39:11,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 11 [2022-04-07 22:39:11,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:39:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-07 22:39:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-07 22:39:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-07 22:39:11,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-07 22:39:11,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-07 22:39:11,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:39:11,930 INFO L225 Difference]: With dead ends: 26 [2022-04-07 22:39:11,930 INFO L226 Difference]: Without dead ends: 13 [2022-04-07 22:39:11,933 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-07 22:39:11,938 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:39:11,939 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:39:11,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-07 22:39:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-07 22:39:11,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:39:11,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 22:39:11,969 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 22:39:11,969 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 22:39:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:39:11,978 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 22:39:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 22:39:11,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:39:11,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:39:11,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 13 states. [2022-04-07 22:39:11,979 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 13 states. [2022-04-07 22:39:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:39:11,983 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 22:39:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 22:39:11,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:39:11,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:39:11,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:39:11,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:39:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 22:39:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-07 22:39:11,994 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-07 22:39:11,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:39:11,994 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-07 22:39:11,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-07 22:39:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 22:39:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 22:39:11,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:39:11,995 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:39:12,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 22:39:12,203 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-07 22:39:12,204 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:39:12,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:39:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1431144312, now seen corresponding path program 1 times [2022-04-07 22:39:12,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:39:12,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793938437] [2022-04-07 22:39:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:39:12,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:39:12,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 22:39:12,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1172511036] [2022-04-07 22:39:12,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:39:12,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:39:12,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:39:12,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:39:12,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 22:39:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:39:12,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 22:39:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:39:12,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:39:12,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {132#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 22:39:12,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= v_~__return_60~0_2 0) (= (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) (= 0 v_~__return_main~0_4) (= (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_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_60~0=v_~__return_60~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_60~0, #NULL.offset, #NULL.base] {132#true} is VALID [2022-04-07 22:39:12,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 22:39:12,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 22:39:12,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {132#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 22:39:12,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#true} [45] mainENTRY-->L19: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__n~0_5) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |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_5, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {132#true} is VALID [2022-04-07 22:39:12,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#true} [48] L19-->L25: Formula: (<= 1 v_main_~main__n~0_9) InVars {main_~main__n~0=v_main_~main__n~0_9} OutVars{main_~main__n~0=v_main_~main__n~0_9} AuxVars[] AssignedVars[] {155#(<= 1 main_~main__n~0)} is VALID [2022-04-07 22:39:12,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {155#(<= 1 main_~main__n~0)} [51] L25-->L38: Formula: (and (<= v_main_~main__n~0_2 1000) (= v_main_~main__i~0_1 1) (= v_main_~main__sum~0_1 0)) InVars {main_~main__n~0=v_main_~main__n~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_2, 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] {159#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-07 22:39:12,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 0) (= main_~main__i~0 1))} [52] L38-->L38: Formula: (and (= (+ v_main_~main__i~0_3 1) v_main_~main__i~0_2) (= v_main_~main__sum~0_2 (+ v_main_~main__sum~0_3 v_main_~main__i~0_3)) (<= v_main_~main__i~0_3 v_main_~main__n~0_3)) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} OutVars{main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {163#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 1) (<= main_~main__i~0 (+ main_~main__sum~0 1)))} is VALID [2022-04-07 22:39:12,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#(and (<= 1 main_~main__n~0) (= main_~main__sum~0 1) (<= main_~main__i~0 (+ main_~main__sum~0 1)))} [53] L38-->L47: Formula: (and (not (<= v_main_~main__i~0_4 v_main_~main__n~0_4)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (= (* (+ v_main_~main__n~0_4 1) v_main_~main__n~0_4) (* 2 v_main_~main__sum~0_4)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {167#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-07 22:39:12,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {167#(<= 1 main_~__VERIFIER_assert__cond~0)} [54] L47-->L49: 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[] {133#false} is VALID [2022-04-07 22:39:12,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {133#false} [56] L49-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#false} is VALID [2022-04-07 22:39:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:39:12,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:39:12,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {133#false} [56] L49-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#false} is VALID [2022-04-07 22:39:12,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {167#(<= 1 main_~__VERIFIER_assert__cond~0)} [54] L47-->L49: 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[] {133#false} is VALID [2022-04-07 22:39:12,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {180#(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))} [53] L38-->L47: Formula: (and (not (<= v_main_~main__i~0_4 v_main_~main__n~0_4)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (= (* (+ v_main_~main__n~0_4 1) v_main_~main__n~0_4) (* 2 v_main_~main__sum~0_4)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {167#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-07 22:39:12,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {184#(or (<= (+ main_~main__i~0 1) 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))))} [52] L38-->L38: Formula: (and (= (+ v_main_~main__i~0_3 1) v_main_~main__i~0_2) (= v_main_~main__sum~0_2 (+ v_main_~main__sum~0_3 v_main_~main__i~0_3)) (<= v_main_~main__i~0_3 v_main_~main__n~0_3)) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} OutVars{main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {180#(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-07 22:39:12,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#(or (= 2 (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= 2 main_~main__n~0))} [51] L25-->L38: Formula: (and (<= v_main_~main__n~0_2 1000) (= v_main_~main__i~0_1 1) (= v_main_~main__sum~0_1 0)) InVars {main_~main__n~0=v_main_~main__n~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_2, 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] {184#(or (<= (+ main_~main__i~0 1) 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-07 22:39:12,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#true} [48] L19-->L25: Formula: (<= 1 v_main_~main__n~0_9) InVars {main_~main__n~0=v_main_~main__n~0_9} OutVars{main_~main__n~0=v_main_~main__n~0_9} AuxVars[] AssignedVars[] {188#(or (= 2 (+ (* main_~main__n~0 main_~main__n~0) main_~main__n~0)) (<= 2 main_~main__n~0))} is VALID [2022-04-07 22:39:12,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#true} [45] mainENTRY-->L19: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__n~0_5) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |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_5, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {132#true} is VALID [2022-04-07 22:39:12,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {132#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 22:39:12,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 22:39:12,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 22:39:12,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= v_~__return_60~0_2 0) (= (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) (= 0 v_~__return_main~0_4) (= (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_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_60~0=v_~__return_60~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_60~0, #NULL.offset, #NULL.base] {132#true} is VALID [2022-04-07 22:39:12,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {132#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 22:39:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:39:12,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:39:12,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793938437] [2022-04-07 22:39:12,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 22:39:12,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172511036] [2022-04-07 22:39:12,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172511036] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:39:12,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 22:39:12,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-07 22:39:12,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326367716] [2022-04-07 22:39:12,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 22:39:12,850 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 12 [2022-04-07 22:39:12,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:39:12,851 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-07 22:39:12,865 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-07 22:39:12,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 22:39:12,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:39:12,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 22:39:12,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-07 22:39:12,866 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. 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-07 22:39:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:39:12,953 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-07 22:39:12,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 22:39:12,953 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 12 [2022-04-07 22:39:12,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:39:12,954 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-07 22:39:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-07 22:39:12,955 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-07 22:39:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-07 22:39:12,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2022-04-07 22:39:12,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:39:12,973 INFO L225 Difference]: With dead ends: 17 [2022-04-07 22:39:12,973 INFO L226 Difference]: Without dead ends: 14 [2022-04-07 22:39:12,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-04-07 22:39:12,975 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:39:12,975 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:39:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-07 22:39:12,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-07 22:39:12,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:39:12,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-07 22:39:12,981 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-07 22:39:12,981 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-07 22:39:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:39:12,983 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 22:39:12,983 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 22:39:12,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:39:12,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:39:12,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 14 states. [2022-04-07 22:39:12,984 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 14 states. [2022-04-07 22:39:12,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:39:12,985 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 22:39:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 22:39:12,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:39:12,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:39:12,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:39:12,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:39:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-07 22:39:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-07 22:39:12,987 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-07 22:39:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:39:12,987 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-07 22:39:12,987 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-07 22:39:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 22:39:12,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 22:39:12,988 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:39:12,988 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:39:13,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 22:39:13,210 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-07 22:39:13,211 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:39:13,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:39:13,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1415769954, now seen corresponding path program 2 times [2022-04-07 22:39:13,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:39:13,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426287351] [2022-04-07 22:39:13,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:39:13,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:39:13,226 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 22:39:13,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1267345853] [2022-04-07 22:39:13,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 22:39:13,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:39:13,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:39:13,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:39:13,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 22:39:13,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 22:39:13,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 22:39:13,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-07 22:39:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:39:13,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:39:13,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {287#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {287#true} is VALID [2022-04-07 22:39:13,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= v_~__return_60~0_2 0) (= (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) (= 0 v_~__return_main~0_4) (= (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_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_60~0=v_~__return_60~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_60~0, #NULL.offset, #NULL.base] {287#true} is VALID [2022-04-07 22:39:13,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {287#true} is VALID [2022-04-07 22:39:13,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {287#true} {287#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {287#true} is VALID [2022-04-07 22:39:13,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {287#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {287#true} is VALID [2022-04-07 22:39:13,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {287#true} [45] mainENTRY-->L19: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__n~0_5) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |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_5, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {287#true} is VALID [2022-04-07 22:39:13,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#true} [48] L19-->L25: Formula: (<= 1 v_main_~main__n~0_9) InVars {main_~main__n~0=v_main_~main__n~0_9} OutVars{main_~main__n~0=v_main_~main__n~0_9} AuxVars[] AssignedVars[] {287#true} is VALID [2022-04-07 22:39:13,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {287#true} [51] L25-->L38: Formula: (and (<= v_main_~main__n~0_2 1000) (= v_main_~main__i~0_1 1) (= v_main_~main__sum~0_1 0)) InVars {main_~main__n~0=v_main_~main__n~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_2, 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] {313#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} is VALID [2022-04-07 22:39:13,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#(and (= main_~main__sum~0 0) (= main_~main__i~0 1))} [52] L38-->L38: Formula: (and (= (+ v_main_~main__i~0_3 1) v_main_~main__i~0_2) (= v_main_~main__sum~0_2 (+ v_main_~main__sum~0_3 v_main_~main__i~0_3)) (<= v_main_~main__i~0_3 v_main_~main__n~0_3)) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} OutVars{main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {317#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} is VALID [2022-04-07 22:39:13,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {317#(and (= (+ main_~main__sum~0 1) main_~main__i~0) (= main_~main__sum~0 1))} [52] L38-->L38: Formula: (and (= (+ v_main_~main__i~0_3 1) v_main_~main__i~0_2) (= v_main_~main__sum~0_2 (+ v_main_~main__sum~0_3 v_main_~main__i~0_3)) (<= v_main_~main__i~0_3 v_main_~main__n~0_3)) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} OutVars{main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {321#(and (<= main_~main__i~0 3) (<= 2 main_~main__n~0) (= main_~main__sum~0 3))} is VALID [2022-04-07 22:39:13,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {321#(and (<= main_~main__i~0 3) (<= 2 main_~main__n~0) (= main_~main__sum~0 3))} [53] L38-->L47: Formula: (and (not (<= v_main_~main__i~0_4 v_main_~main__n~0_4)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (= (* (+ v_main_~main__n~0_4 1) v_main_~main__n~0_4) (* 2 v_main_~main__sum~0_4)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {325#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-07 22:39:13,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {325#(<= 1 main_~__VERIFIER_assert__cond~0)} [54] L47-->L49: 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[] {288#false} is VALID [2022-04-07 22:39:13,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {288#false} [56] L49-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#false} is VALID [2022-04-07 22:39:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:39:13,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:39:14,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {288#false} [56] L49-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#false} is VALID [2022-04-07 22:39:14,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {325#(<= 1 main_~__VERIFIER_assert__cond~0)} [54] L47-->L49: 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[] {288#false} is VALID [2022-04-07 22:39:14,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {338#(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))} [53] L38-->L47: Formula: (and (not (<= v_main_~main__i~0_4 v_main_~main__n~0_4)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (= (* (+ v_main_~main__n~0_4 1) v_main_~main__n~0_4) (* 2 v_main_~main__sum~0_4)) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~main__i~0=v_main_~main__i~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__n~0=v_main_~main__n~0_4, main_~main__sum~0=v_main_~main__sum~0_4, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {325#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-07 22:39:14,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {342#(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)))))} [52] L38-->L38: Formula: (and (= (+ v_main_~main__i~0_3 1) v_main_~main__i~0_2) (= v_main_~main__sum~0_2 (+ v_main_~main__sum~0_3 v_main_~main__i~0_3)) (<= v_main_~main__i~0_3 v_main_~main__n~0_3)) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} OutVars{main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {338#(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-07 22:39:14,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {342#(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)))))} [52] L38-->L38: Formula: (and (= (+ v_main_~main__i~0_3 1) v_main_~main__i~0_2) (= v_main_~main__sum~0_2 (+ v_main_~main__sum~0_3 v_main_~main__i~0_3)) (<= v_main_~main__i~0_3 v_main_~main__n~0_3)) InVars {main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_3, main_~main__i~0=v_main_~main__i~0_3} OutVars{main_~main__n~0=v_main_~main__n~0_3, main_~main__sum~0=v_main_~main__sum~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_~main__sum~0, main_~main__i~0] {342#(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-07 22:39:14,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {287#true} [51] L25-->L38: Formula: (and (<= v_main_~main__n~0_2 1000) (= v_main_~main__i~0_1 1) (= v_main_~main__sum~0_1 0)) InVars {main_~main__n~0=v_main_~main__n~0_2} OutVars{main_~main__n~0=v_main_~main__n~0_2, 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] {342#(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-07 22:39:14,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#true} [48] L19-->L25: Formula: (<= 1 v_main_~main__n~0_9) InVars {main_~main__n~0=v_main_~main__n~0_9} OutVars{main_~main__n~0=v_main_~main__n~0_9} AuxVars[] AssignedVars[] {287#true} is VALID [2022-04-07 22:39:14,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {287#true} [45] mainENTRY-->L19: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__n~0_5) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |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_5, main_~main__sum~0=v_main_~main__sum~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__n~0, main_~main__sum~0, main_~main__i~0] {287#true} is VALID [2022-04-07 22:39:14,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {287#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {287#true} is VALID [2022-04-07 22:39:14,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {287#true} {287#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {287#true} is VALID [2022-04-07 22:39:14,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {287#true} is VALID [2022-04-07 22:39:14,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= v_~__return_60~0_2 0) (= (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) (= 0 v_~__return_main~0_4) (= (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_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_60~0=v_~__return_60~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, ~__return_60~0, #NULL.offset, #NULL.base] {287#true} is VALID [2022-04-07 22:39:14,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {287#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {287#true} is VALID [2022-04-07 22:39:14,053 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-07 22:39:14,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:39:14,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426287351] [2022-04-07 22:39:14,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 22:39:14,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267345853] [2022-04-07 22:39:14,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267345853] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:39:14,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 22:39:14,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2022-04-07 22:39:14,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555616693] [2022-04-07 22:39:14,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 22:39:14,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 13 [2022-04-07 22:39:14,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:39:14,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-07 22:39:14,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:39:14,084 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 22:39:14,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:39:14,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 22:39:14,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 22:39:14,086 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-07 22:39:14,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:39:14,245 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 22:39:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 22:39:14,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 13 [2022-04-07 22:39:14,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:39:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-07 22:39:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2022-04-07 22:39:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-07 22:39:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2022-04-07 22:39:14,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 16 transitions. [2022-04-07 22:39:14,296 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-07 22:39:14,296 INFO L225 Difference]: With dead ends: 15 [2022-04-07 22:39:14,296 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 22:39:14,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-07 22:39:14,298 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:39:14,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-04-07 22:39:14,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 22:39:14,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 22:39:14,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:39:14,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:39:14,299 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:39:14,300 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:39:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:39:14,300 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:39:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:39:14,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:39:14,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:39:14,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 22:39:14,300 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 22:39:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:39:14,301 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:39:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:39:14,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:39:14,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:39:14,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:39:14,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:39:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:39:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 22:39:14,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-07 22:39:14,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:39:14,302 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 22:39:14,302 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-07 22:39:14,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:39:14,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:39:14,304 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 22:39:14,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 22:39:14,515 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-07 22:39:14,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 22:39:14,627 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-07 22:39:14,627 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:39:14,627 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:39:14,628 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 22:39:14,628 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 22:39:14,628 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:39:14,628 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:39:14,628 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 13 61) the Hoare annotation is: true [2022-04-07 22:39:14,628 INFO L882 garLoopResultBuilder]: For program point L19(lines 19 60) no Hoare annotation was computed. [2022-04-07 22:39:14,628 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 13 61) no Hoare annotation was computed. [2022-04-07 22:39:14,628 INFO L882 garLoopResultBuilder]: For program point L25(lines 25 59) no Hoare annotation was computed. [2022-04-07 22:39:14,628 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 13 61) no Hoare annotation was computed. [2022-04-07 22:39:14,629 INFO L878 garLoopResultBuilder]: At program point L38(lines 30 59) 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))))) (<= 1 main_~main__n~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-07 22:39:14,629 INFO L882 garLoopResultBuilder]: For program point L47(lines 47 56) no Hoare annotation was computed. [2022-04-07 22:39:14,629 INFO L882 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-04-07 22:39:14,629 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 49) no Hoare annotation was computed. [2022-04-07 22:39:14,631 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-07 22:39:14,632 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 22:39:14,635 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:39:14,635 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 22:39:14,635 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:39:14,636 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 22:39:14,636 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 22:39:14,636 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 22:39:14,636 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:39:14,636 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 22:39:14,636 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 22:39:14,636 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 22:39:14,652 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-07 22:39:14,652 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 22:39:14,653 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-07 22:39:14,653 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-07 22:39:14,653 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-07 22:39:14,653 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-07 22:39:14,653 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-07 22:39:14,657 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,657 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,657 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,657 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,658 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,662 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,663 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,663 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,663 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,663 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:39:14 BasicIcfg [2022-04-07 22:39:14,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 22:39:14,665 INFO L158 Benchmark]: Toolchain (without parser) took 4045.49ms. Allocated memory was 192.9MB in the beginning and 259.0MB in the end (delta: 66.1MB). Free memory was 134.2MB in the beginning and 153.6MB in the end (delta: -19.4MB). Peak memory consumption was 46.5MB. Max. memory is 8.0GB. [2022-04-07 22:39:14,665 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory was 150.5MB in the beginning and 150.3MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 22:39:14,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.70ms. Allocated memory was 192.9MB in the beginning and 259.0MB in the end (delta: 66.1MB). Free memory was 134.1MB in the beginning and 231.4MB in the end (delta: -97.2MB). Peak memory consumption was 16.1MB. Max. memory is 8.0GB. [2022-04-07 22:39:14,666 INFO L158 Benchmark]: Boogie Preprocessor took 39.21ms. Allocated memory is still 259.0MB. Free memory was 231.4MB in the beginning and 229.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:39:14,666 INFO L158 Benchmark]: RCFGBuilder took 243.89ms. Allocated memory is still 259.0MB. Free memory was 229.8MB in the beginning and 217.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 22:39:14,666 INFO L158 Benchmark]: IcfgTransformer took 22.69ms. Allocated memory is still 259.0MB. Free memory was 217.7MB in the beginning and 216.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:39:14,667 INFO L158 Benchmark]: TraceAbstraction took 3463.58ms. Allocated memory is still 259.0MB. Free memory was 216.2MB in the beginning and 153.6MB in the end (delta: 62.5MB). Peak memory consumption was 62.5MB. Max. memory is 8.0GB. [2022-04-07 22:39:14,668 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.11ms. Allocated memory is still 192.9MB. Free memory was 150.5MB in the beginning and 150.3MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 269.70ms. Allocated memory was 192.9MB in the beginning and 259.0MB in the end (delta: 66.1MB). Free memory was 134.1MB in the beginning and 231.4MB in the end (delta: -97.2MB). Peak memory consumption was 16.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.21ms. Allocated memory is still 259.0MB. Free memory was 231.4MB in the beginning and 229.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 243.89ms. Allocated memory is still 259.0MB. Free memory was 229.8MB in the beginning and 217.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 22.69ms. Allocated memory is still 259.0MB. Free memory was 217.7MB in the beginning and 216.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3463.58ms. Allocated memory is still 259.0MB. Free memory was 216.2MB in the beginning and 153.6MB in the end (delta: 62.5MB). Peak memory consumption was 62.5MB. 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: 49]: 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, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 33 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 8 NumberOfFragments, 45 HoareAnnotationTreeSize, 5 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 67 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 56 ConstructedInterpolants, 2 QuantifiedInterpolants, 215 SizeOfPredicates, 12 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 31 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: 30]: Loop Invariant [2022-04-07 22:39:14,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2022-04-07 22:39:14,676 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) && 1 <= main__n) && (main__sum * 2 == main__n * main__n + main__n || main__i <= main__n) RESULT: Ultimate proved your program to be correct! [2022-04-07 22:39:14,685 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...