./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-new/gauss_sum.i.p+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-new/gauss_sum.i.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d48497fc10d41c19aadcae37a705912ab368d39 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:11:58,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:11:58,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:11:58,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:11:58,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:11:58,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:11:58,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:11:58,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:11:58,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:11:58,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:11:58,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:11:58,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:11:58,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:11:58,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:11:58,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:11:58,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:11:58,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:11:58,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:11:58,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:11:58,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:11:58,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:11:58,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:11:58,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:11:58,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:11:58,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:11:58,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:11:58,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:11:58,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:11:58,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:11:58,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:11:58,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:11:58,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:11:58,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:11:58,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:11:58,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:11:58,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:11:58,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:11:58,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:11:58,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:11:58,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:11:58,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:11:58,560 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 14:11:58,585 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:11:58,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:11:58,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:11:58,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:11:58,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:11:58,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:11:58,588 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:11:58,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:11:58,589 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:11:58,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:11:58,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:11:58,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:11:58,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:11:58,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:11:58,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:11:58,590 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:11:58,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:11:58,591 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:11:58,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:11:58,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:11:58,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:11:58,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:11:58,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:11:58,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:11:58,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:11:58,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:11:58,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:11:58,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:11:58,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:11:58,593 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:11:58,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5d48497fc10d41c19aadcae37a705912ab368d39 [2021-09-13 14:11:58,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:11:58,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:11:58,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:11:58,931 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:11:58,931 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:11:58,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-new/gauss_sum.i.p+cfa-reducer.c [2021-09-13 14:11:58,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b6bf212/a31406aaf4964b43b948d3824c505870/FLAG3d8e6f530 [2021-09-13 14:11:59,296 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:11:59,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-new/gauss_sum.i.p+cfa-reducer.c [2021-09-13 14:11:59,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b6bf212/a31406aaf4964b43b948d3824c505870/FLAG3d8e6f530 [2021-09-13 14:11:59,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b6bf212/a31406aaf4964b43b948d3824c505870 [2021-09-13 14:11:59,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:11:59,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:11:59,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:11:59,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:11:59,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:11:59,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:11:59" (1/1) ... [2021-09-13 14:11:59,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574a0ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:11:59, skipping insertion in model container [2021-09-13 14:11:59,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:11:59" (1/1) ... [2021-09-13 14:11:59,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:11:59,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:11:59,870 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-new/gauss_sum.i.p+cfa-reducer.c[1014,1027] [2021-09-13 14:11:59,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:11:59,878 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:11:59,889 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-new/gauss_sum.i.p+cfa-reducer.c[1014,1027] [2021-09-13 14:11:59,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:11:59,899 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:11:59,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:11:59 WrapperNode [2021-09-13 14:11:59,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:11:59,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:11:59,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:11:59,901 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:11:59,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:11:59" (1/1) ... [2021-09-13 14:11:59,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:11:59" (1/1) ... [2021-09-13 14:11:59,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:11:59,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:11:59,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:11:59,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:11:59,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:11:59" (1/1) ... [2021-09-13 14:11:59,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:11:59" (1/1) ... [2021-09-13 14:11:59,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:11:59" (1/1) ... [2021-09-13 14:11:59,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:11:59" (1/1) ... [2021-09-13 14:11:59,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:11:59" (1/1) ... [2021-09-13 14:11:59,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:11:59" (1/1) ... [2021-09-13 14:11:59,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:11:59" (1/1) ... [2021-09-13 14:11:59,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:11:59,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:11:59,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:11:59,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:11:59,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:11:59" (1/1) ... [2021-09-13 14:11:59,987 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:11:59,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:00,004 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) [2021-09-13 14:12:00,024 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 [2021-09-13 14:12:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:12:00,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:12:00,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:12:00,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:12:00,214 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:12:00,217 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-09-13 14:12:00,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:12:00 BoogieIcfgContainer [2021-09-13 14:12:00,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:12:00,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:12:00,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:12:00,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:12:00,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:11:59" (1/3) ... [2021-09-13 14:12:00,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad5dd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:12:00, skipping insertion in model container [2021-09-13 14:12:00,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:11:59" (2/3) ... [2021-09-13 14:12:00,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad5dd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:12:00, skipping insertion in model container [2021-09-13 14:12:00,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:12:00" (3/3) ... [2021-09-13 14:12:00,233 INFO L111 eAbstractionObserver]: Analyzing ICFG gauss_sum.i.p+cfa-reducer.c [2021-09-13 14:12:00,250 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:12:00,250 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 14:12:00,304 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:12:00,308 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 14:12:00,309 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 14:12:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 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) [2021-09-13 14:12:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-13 14:12:00,358 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:00,358 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:00,359 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:00,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:00,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1806908747, now seen corresponding path program 1 times [2021-09-13 14:12:00,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:00,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833600847] [2021-09-13 14:12:00,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:00,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:00,469 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:12:00,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790305754] [2021-09-13 14:12:00,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:00,471 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:00,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:00,472 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) [2021-09-13 14:12:00,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-09-13 14:12:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:00,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:12:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:00,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:00,698 INFO L281 TraceCheckUtils]: 0: Hoare triple {14#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(28);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~__return_main~0 := 0;~__return_80~0 := 0; {14#true} is VALID [2021-09-13 14:12:00,698 INFO L281 TraceCheckUtils]: 1: Hoare triple {14#true} havoc main_#res;havoc main_#t~nondet7, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__n~0, main_~main__sum~0, main_~main__i~0;havoc main_~main__n~0;havoc main_~main__sum~0;havoc main_~main__i~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~main__n~0 := main_#t~nondet7;havoc main_#t~nondet7; {14#true} is VALID [2021-09-13 14:12:00,699 INFO L281 TraceCheckUtils]: 2: Hoare triple {14#true} assume !!(1 <= main_~main__n~0); {25#(<= 1 ULTIMATE.start_main_~main__n~0)} is VALID [2021-09-13 14:12:00,700 INFO L281 TraceCheckUtils]: 3: Hoare triple {25#(<= 1 ULTIMATE.start_main_~main__n~0)} assume !!(main_~main__n~0 <= 1000);main_~main__sum~0 := 0;main_~main__i~0 := 1; {29#(and (<= ULTIMATE.start_main_~main__i~0 1) (<= 1 ULTIMATE.start_main_~main__n~0))} is VALID [2021-09-13 14:12:00,701 INFO L281 TraceCheckUtils]: 4: Hoare triple {29#(and (<= ULTIMATE.start_main_~main__i~0 1) (<= 1 ULTIMATE.start_main_~main__n~0))} assume !(main_~main__i~0 <= main_~main__n~0);havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if 2 * main_~main__sum~0 == main_~main__n~0 * (1 + main_~main__n~0) then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {15#false} is VALID [2021-09-13 14:12:00,702 INFO L281 TraceCheckUtils]: 5: Hoare triple {15#false} assume 0 == main_~__VERIFIER_assert__cond~0; {15#false} is VALID [2021-09-13 14:12:00,702 INFO L281 TraceCheckUtils]: 6: Hoare triple {15#false} assume !false; {15#false} is VALID [2021-09-13 14:12:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:00,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:12:00,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:00,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833600847] [2021-09-13 14:12:00,704 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:12:00,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790305754] [2021-09-13 14:12:00,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790305754] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:12:00,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:12:00,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:12:00,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154011731] [2021-09-13 14:12:00,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2021-09-13 14:12:00,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:00,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:12:00,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:00,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:12:00,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:00,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:12:00,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:12:00,755 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 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 has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:12:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:00,833 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-09-13 14:12:00,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:12:00,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2021-09-13 14:12:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:12:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2021-09-13 14:12:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:12:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2021-09-13 14:12:00,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2021-09-13 14:12:00,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:00,872 INFO L225 Difference]: With dead ends: 21 [2021-09-13 14:12:00,873 INFO L226 Difference]: Without dead ends: 9 [2021-09-13 14:12:00,875 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.39ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:12:00,878 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.93ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.24ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:00,880 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 30 Unknown, 0 Unchecked, 0.93ms Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 27.24ms Time] [2021-09-13 14:12:00,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-09-13 14:12:00,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-09-13 14:12:00,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:00,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) [2021-09-13 14:12:00,902 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) [2021-09-13 14:12:00,902 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) [2021-09-13 14:12:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:00,904 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2021-09-13 14:12:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-09-13 14:12:00,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:00,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:00,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 9 states. [2021-09-13 14:12:00,906 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 9 states. [2021-09-13 14:12:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:00,909 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2021-09-13 14:12:00,909 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-09-13 14:12:00,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:00,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:00,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:00,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) [2021-09-13 14:12:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-09-13 14:12:00,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2021-09-13 14:12:00,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:00,913 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-09-13 14:12:00,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:12:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-09-13 14:12:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-09-13 14:12:00,914 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:00,914 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:00,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-09-13 14:12:01,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-09-13 14:12:01,132 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:01,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:01,133 INFO L82 PathProgramCache]: Analyzing trace with hash 179533835, now seen corresponding path program 1 times [2021-09-13 14:12:01,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:01,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702405784] [2021-09-13 14:12:01,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:01,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:01,146 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:12:01,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1981233412] [2021-09-13 14:12:01,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:01,147 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:01,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:01,148 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) [2021-09-13 14:12:01,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-09-13 14:12:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:01,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2021-09-13 14:12:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:01,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:01,451 INFO L281 TraceCheckUtils]: 0: Hoare triple {93#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(28);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~__return_main~0 := 0;~__return_80~0 := 0; {93#true} is VALID [2021-09-13 14:12:01,451 INFO L281 TraceCheckUtils]: 1: Hoare triple {93#true} havoc main_#res;havoc main_#t~nondet7, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__n~0, main_~main__sum~0, main_~main__i~0;havoc main_~main__n~0;havoc main_~main__sum~0;havoc main_~main__i~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~main__n~0 := main_#t~nondet7;havoc main_#t~nondet7; {93#true} is VALID [2021-09-13 14:12:01,451 INFO L281 TraceCheckUtils]: 2: Hoare triple {93#true} assume !!(1 <= main_~main__n~0); {104#(<= 1 ULTIMATE.start_main_~main__n~0)} is VALID [2021-09-13 14:12:01,452 INFO L281 TraceCheckUtils]: 3: Hoare triple {104#(<= 1 ULTIMATE.start_main_~main__n~0)} assume !!(main_~main__n~0 <= 1000);main_~main__sum~0 := 0;main_~main__i~0 := 1; {108#(and (= ULTIMATE.start_main_~main__i~0 1) (<= 1 ULTIMATE.start_main_~main__n~0) (= ULTIMATE.start_main_~main__sum~0 0))} is VALID [2021-09-13 14:12:01,452 INFO L281 TraceCheckUtils]: 4: Hoare triple {108#(and (= ULTIMATE.start_main_~main__i~0 1) (<= 1 ULTIMATE.start_main_~main__n~0) (= ULTIMATE.start_main_~main__sum~0 0))} assume main_~main__i~0 <= main_~main__n~0;main_~main__sum~0 := main_~main__sum~0 + main_~main__i~0;main_~main__i~0 := 1 + main_~main__i~0; {112#(and (<= 1 ULTIMATE.start_main_~main__n~0) (= ULTIMATE.start_main_~main__sum~0 1) (<= ULTIMATE.start_main_~main__i~0 2))} is VALID [2021-09-13 14:12:01,453 INFO L281 TraceCheckUtils]: 5: Hoare triple {112#(and (<= 1 ULTIMATE.start_main_~main__n~0) (= ULTIMATE.start_main_~main__sum~0 1) (<= ULTIMATE.start_main_~main__i~0 2))} assume !(main_~main__i~0 <= main_~main__n~0);havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if 2 * main_~main__sum~0 == main_~main__n~0 * (1 + main_~main__n~0) then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {116#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} is VALID [2021-09-13 14:12:01,454 INFO L281 TraceCheckUtils]: 6: Hoare triple {116#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} assume 0 == main_~__VERIFIER_assert__cond~0; {94#false} is VALID [2021-09-13 14:12:01,454 INFO L281 TraceCheckUtils]: 7: Hoare triple {94#false} assume !false; {94#false} is VALID [2021-09-13 14:12:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:01,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:12:01,627 INFO L281 TraceCheckUtils]: 7: Hoare triple {94#false} assume !false; {94#false} is VALID [2021-09-13 14:12:01,628 INFO L281 TraceCheckUtils]: 6: Hoare triple {116#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} assume 0 == main_~__VERIFIER_assert__cond~0; {94#false} is VALID [2021-09-13 14:12:01,629 INFO L281 TraceCheckUtils]: 5: Hoare triple {129#(or (= (+ ULTIMATE.start_main_~main__n~0 (* ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__n~0)) (* 2 ULTIMATE.start_main_~main__sum~0)) (<= ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__n~0))} assume !(main_~main__i~0 <= main_~main__n~0);havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if 2 * main_~main__sum~0 == main_~main__n~0 * (1 + main_~main__n~0) then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {116#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} is VALID [2021-09-13 14:12:01,629 INFO L281 TraceCheckUtils]: 4: Hoare triple {133#(or (= (+ ULTIMATE.start_main_~main__n~0 (* ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__n~0)) (+ (* 2 ULTIMATE.start_main_~main__i~0) (* 2 ULTIMATE.start_main_~main__sum~0))) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__n~0))} assume main_~main__i~0 <= main_~main__n~0;main_~main__sum~0 := main_~main__sum~0 + main_~main__i~0;main_~main__i~0 := 1 + main_~main__i~0; {129#(or (= (+ ULTIMATE.start_main_~main__n~0 (* ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__n~0)) (* 2 ULTIMATE.start_main_~main__sum~0)) (<= ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__n~0))} is VALID [2021-09-13 14:12:01,630 INFO L281 TraceCheckUtils]: 3: Hoare triple {137#(or (<= 2 ULTIMATE.start_main_~main__n~0) (= (+ ULTIMATE.start_main_~main__n~0 (* ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__n~0)) 2))} assume !!(main_~main__n~0 <= 1000);main_~main__sum~0 := 0;main_~main__i~0 := 1; {133#(or (= (+ ULTIMATE.start_main_~main__n~0 (* ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__n~0)) (+ (* 2 ULTIMATE.start_main_~main__i~0) (* 2 ULTIMATE.start_main_~main__sum~0))) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__n~0))} is VALID [2021-09-13 14:12:01,630 INFO L281 TraceCheckUtils]: 2: Hoare triple {93#true} assume !!(1 <= main_~main__n~0); {137#(or (<= 2 ULTIMATE.start_main_~main__n~0) (= (+ ULTIMATE.start_main_~main__n~0 (* ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__n~0)) 2))} is VALID [2021-09-13 14:12:01,631 INFO L281 TraceCheckUtils]: 1: Hoare triple {93#true} havoc main_#res;havoc main_#t~nondet7, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__n~0, main_~main__sum~0, main_~main__i~0;havoc main_~main__n~0;havoc main_~main__sum~0;havoc main_~main__i~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~main__n~0 := main_#t~nondet7;havoc main_#t~nondet7; {93#true} is VALID [2021-09-13 14:12:01,631 INFO L281 TraceCheckUtils]: 0: Hoare triple {93#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(28);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~__return_main~0 := 0;~__return_80~0 := 0; {93#true} is VALID [2021-09-13 14:12:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:01,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:01,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702405784] [2021-09-13 14:12:01,631 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:12:01,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981233412] [2021-09-13 14:12:01,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981233412] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:12:01,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:12:01,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-09-13 14:12:01,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132189929] [2021-09-13 14:12:01,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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) Word has length 8 [2021-09-13 14:12:01,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:01,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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) [2021-09-13 14:12:01,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:01,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:12:01,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:01,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:12:01,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:12:01,643 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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) [2021-09-13 14:12:01,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:01,733 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2021-09-13 14:12:01,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:12:01,734 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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) Word has length 8 [2021-09-13 14:12:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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) [2021-09-13 14:12:01,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2021-09-13 14:12:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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) [2021-09-13 14:12:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2021-09-13 14:12:01,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 13 transitions. [2021-09-13 14:12:01,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:01,748 INFO L225 Difference]: With dead ends: 13 [2021-09-13 14:12:01,748 INFO L226 Difference]: Without dead ends: 10 [2021-09-13 14:12:01,748 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 61.12ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:12:01,749 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.43ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.29ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:01,750 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 48 Unknown, 0 Unchecked, 0.43ms Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 37.29ms Time] [2021-09-13 14:12:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2021-09-13 14:12:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-09-13 14:12:01,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:01,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) [2021-09-13 14:12:01,755 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) [2021-09-13 14:12:01,755 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) [2021-09-13 14:12:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:01,756 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2021-09-13 14:12:01,756 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2021-09-13 14:12:01,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:01,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:01,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 10 states. [2021-09-13 14:12:01,757 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 10 states. [2021-09-13 14:12:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:01,758 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2021-09-13 14:12:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2021-09-13 14:12:01,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:01,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:01,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:01,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) [2021-09-13 14:12:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2021-09-13 14:12:01,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2021-09-13 14:12:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:01,759 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2021-09-13 14:12:01,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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) [2021-09-13 14:12:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2021-09-13 14:12:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-09-13 14:12:01,760 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:01,760 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:01,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-09-13 14:12:01,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-09-13 14:12:01,968 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:01,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:01,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1270519115, now seen corresponding path program 2 times [2021-09-13 14:12:01,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:01,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162024225] [2021-09-13 14:12:01,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:01,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:01,984 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:12:01,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084166281] [2021-09-13 14:12:01,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:12:01,999 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:01,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:02,008 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) [2021-09-13 14:12:02,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-09-13 14:12:02,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:12:02,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:12:02,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2021-09-13 14:12:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:02,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:02,254 INFO L281 TraceCheckUtils]: 0: Hoare triple {197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(28);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~__return_main~0 := 0;~__return_80~0 := 0; {197#true} is VALID [2021-09-13 14:12:02,254 INFO L281 TraceCheckUtils]: 1: Hoare triple {197#true} havoc main_#res;havoc main_#t~nondet7, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__n~0, main_~main__sum~0, main_~main__i~0;havoc main_~main__n~0;havoc main_~main__sum~0;havoc main_~main__i~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~main__n~0 := main_#t~nondet7;havoc main_#t~nondet7; {197#true} is VALID [2021-09-13 14:12:02,255 INFO L281 TraceCheckUtils]: 2: Hoare triple {197#true} assume !!(1 <= main_~main__n~0); {197#true} is VALID [2021-09-13 14:12:02,255 INFO L281 TraceCheckUtils]: 3: Hoare triple {197#true} assume !!(main_~main__n~0 <= 1000);main_~main__sum~0 := 0;main_~main__i~0 := 1; {211#(and (= ULTIMATE.start_main_~main__i~0 1) (= ULTIMATE.start_main_~main__sum~0 0))} is VALID [2021-09-13 14:12:02,255 INFO L281 TraceCheckUtils]: 4: Hoare triple {211#(and (= ULTIMATE.start_main_~main__i~0 1) (= ULTIMATE.start_main_~main__sum~0 0))} assume main_~main__i~0 <= main_~main__n~0;main_~main__sum~0 := main_~main__sum~0 + main_~main__i~0;main_~main__i~0 := 1 + main_~main__i~0; {215#(and (= ULTIMATE.start_main_~main__i~0 2) (= ULTIMATE.start_main_~main__i~0 (+ ULTIMATE.start_main_~main__sum~0 1)))} is VALID [2021-09-13 14:12:02,256 INFO L281 TraceCheckUtils]: 5: Hoare triple {215#(and (= ULTIMATE.start_main_~main__i~0 2) (= ULTIMATE.start_main_~main__i~0 (+ ULTIMATE.start_main_~main__sum~0 1)))} assume main_~main__i~0 <= main_~main__n~0;main_~main__sum~0 := main_~main__sum~0 + main_~main__i~0;main_~main__i~0 := 1 + main_~main__i~0; {219#(and (= 3 ULTIMATE.start_main_~main__sum~0) (<= ULTIMATE.start_main_~main__i~0 3) (<= 2 ULTIMATE.start_main_~main__n~0))} is VALID [2021-09-13 14:12:02,257 INFO L281 TraceCheckUtils]: 6: Hoare triple {219#(and (= 3 ULTIMATE.start_main_~main__sum~0) (<= ULTIMATE.start_main_~main__i~0 3) (<= 2 ULTIMATE.start_main_~main__n~0))} assume !(main_~main__i~0 <= main_~main__n~0);havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if 2 * main_~main__sum~0 == main_~main__n~0 * (1 + main_~main__n~0) then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {223#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} is VALID [2021-09-13 14:12:02,257 INFO L281 TraceCheckUtils]: 7: Hoare triple {223#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} assume 0 == main_~__VERIFIER_assert__cond~0; {198#false} is VALID [2021-09-13 14:12:02,257 INFO L281 TraceCheckUtils]: 8: Hoare triple {198#false} assume !false; {198#false} is VALID [2021-09-13 14:12:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:02,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:12:02,640 INFO L281 TraceCheckUtils]: 8: Hoare triple {198#false} assume !false; {198#false} is VALID [2021-09-13 14:12:02,641 INFO L281 TraceCheckUtils]: 7: Hoare triple {223#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} assume 0 == main_~__VERIFIER_assert__cond~0; {198#false} is VALID [2021-09-13 14:12:02,641 INFO L281 TraceCheckUtils]: 6: Hoare triple {236#(or (= (+ ULTIMATE.start_main_~main__n~0 (* ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__n~0)) (* 2 ULTIMATE.start_main_~main__sum~0)) (<= ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__n~0))} assume !(main_~main__i~0 <= main_~main__n~0);havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if 2 * main_~main__sum~0 == main_~main__n~0 * (1 + main_~main__n~0) then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {223#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} is VALID [2021-09-13 14:12:02,642 INFO L281 TraceCheckUtils]: 5: Hoare triple {240#(forall ((ULTIMATE.start_main_~main__n~0 Int)) (or (= (+ ULTIMATE.start_main_~main__n~0 (* ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__n~0)) (+ (* 2 ULTIMATE.start_main_~main__i~0) (* 2 ULTIMATE.start_main_~main__sum~0))) (< ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__n~0)))} assume main_~main__i~0 <= main_~main__n~0;main_~main__sum~0 := main_~main__sum~0 + main_~main__i~0;main_~main__i~0 := 1 + main_~main__i~0; {236#(or (= (+ ULTIMATE.start_main_~main__n~0 (* ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__n~0)) (* 2 ULTIMATE.start_main_~main__sum~0)) (<= ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__n~0))} is VALID [2021-09-13 14:12:02,649 INFO L281 TraceCheckUtils]: 4: Hoare triple {240#(forall ((ULTIMATE.start_main_~main__n~0 Int)) (or (= (+ ULTIMATE.start_main_~main__n~0 (* ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__n~0)) (+ (* 2 ULTIMATE.start_main_~main__i~0) (* 2 ULTIMATE.start_main_~main__sum~0))) (< ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__n~0)))} assume main_~main__i~0 <= main_~main__n~0;main_~main__sum~0 := main_~main__sum~0 + main_~main__i~0;main_~main__i~0 := 1 + main_~main__i~0; {240#(forall ((ULTIMATE.start_main_~main__n~0 Int)) (or (= (+ ULTIMATE.start_main_~main__n~0 (* ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__n~0)) (+ (* 2 ULTIMATE.start_main_~main__i~0) (* 2 ULTIMATE.start_main_~main__sum~0))) (< ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__n~0)))} is VALID [2021-09-13 14:12:02,650 INFO L281 TraceCheckUtils]: 3: Hoare triple {197#true} assume !!(main_~main__n~0 <= 1000);main_~main__sum~0 := 0;main_~main__i~0 := 1; {240#(forall ((ULTIMATE.start_main_~main__n~0 Int)) (or (= (+ ULTIMATE.start_main_~main__n~0 (* ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__n~0)) (+ (* 2 ULTIMATE.start_main_~main__i~0) (* 2 ULTIMATE.start_main_~main__sum~0))) (< ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__n~0)))} is VALID [2021-09-13 14:12:02,650 INFO L281 TraceCheckUtils]: 2: Hoare triple {197#true} assume !!(1 <= main_~main__n~0); {197#true} is VALID [2021-09-13 14:12:02,650 INFO L281 TraceCheckUtils]: 1: Hoare triple {197#true} havoc main_#res;havoc main_#t~nondet7, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__n~0, main_~main__sum~0, main_~main__i~0;havoc main_~main__n~0;havoc main_~main__sum~0;havoc main_~main__i~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~main__n~0 := main_#t~nondet7;havoc main_#t~nondet7; {197#true} is VALID [2021-09-13 14:12:02,650 INFO L281 TraceCheckUtils]: 0: Hoare triple {197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(28);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~__return_main~0 := 0;~__return_80~0 := 0; {197#true} is VALID [2021-09-13 14:12:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-09-13 14:12:02,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:02,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162024225] [2021-09-13 14:12:02,651 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:12:02,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084166281] [2021-09-13 14:12:02,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084166281] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:12:02,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:12:02,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2021-09-13 14:12:02,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910537795] [2021-09-13 14:12:02,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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) Word has length 9 [2021-09-13 14:12:02,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:02,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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) [2021-09-13 14:12:02,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:02,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:12:02,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:02,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:12:02,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:12:02,667 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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) [2021-09-13 14:12:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:02,794 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2021-09-13 14:12:02,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:12:02,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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) Word has length 9 [2021-09-13 14:12:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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) [2021-09-13 14:12:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2021-09-13 14:12:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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) [2021-09-13 14:12:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2021-09-13 14:12:02,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 12 transitions. [2021-09-13 14:12:02,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:02,819 INFO L225 Difference]: With dead ends: 11 [2021-09-13 14:12:02,819 INFO L226 Difference]: Without dead ends: 0 [2021-09-13 14:12:02,820 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 213.70ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:12:02,820 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.23ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 17.00ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:02,820 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 29 Unknown, 0 Unchecked, 0.23ms Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 5 Unchecked, 17.00ms Time] [2021-09-13 14:12:02,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-09-13 14:12:02,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-09-13 14:12:02,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:02,821 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) [2021-09-13 14:12:02,821 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) [2021-09-13 14:12:02,821 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) [2021-09-13 14:12:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:02,821 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:12:02,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:12:02,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:02,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:02,822 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. [2021-09-13 14:12:02,822 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. [2021-09-13 14:12:02,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:02,822 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:12:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:12:02,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:02,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:02,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:02,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:02,822 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) [2021-09-13 14:12:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-09-13 14:12:02,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2021-09-13 14:12:02,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:02,822 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-09-13 14:12:02,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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) [2021-09-13 14:12:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:12:02,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:02,825 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-09-13 14:12:02,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-09-13 14:12:03,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:03,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-09-13 14:12:03,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:12:03,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:12:03,123 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-09-13 14:12:03,123 INFO L858 garLoopResultBuilder]: For program point L25(lines 25 59) no Hoare annotation was computed. [2021-09-13 14:12:03,123 INFO L858 garLoopResultBuilder]: For program point L19(lines 19 60) no Hoare annotation was computed. [2021-09-13 14:12:03,123 INFO L854 garLoopResultBuilder]: At program point L38(lines 30 59) the Hoare annotation is: (and (forall ((ULTIMATE.start_main_~main__n~0 Int)) (or (= (+ ULTIMATE.start_main_~main__n~0 (* ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__n~0)) (+ (* 2 ULTIMATE.start_main_~main__i~0) (* 2 ULTIMATE.start_main_~main__sum~0))) (< ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__n~0))) (or (= (+ ULTIMATE.start_main_~main__n~0 (* ULTIMATE.start_main_~main__n~0 ULTIMATE.start_main_~main__n~0)) (* 2 ULTIMATE.start_main_~main__sum~0)) (<= ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__n~0)) (<= 1 ULTIMATE.start_main_~main__n~0)) [2021-09-13 14:12:03,123 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-09-13 14:12:03,123 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-09-13 14:12:03,124 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-09-13 14:12:03,124 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 49) no Hoare annotation was computed. [2021-09-13 14:12:03,124 INFO L861 garLoopResultBuilder]: At program point L55(lines 13 61) the Hoare annotation is: true [2021-09-13 14:12:03,124 INFO L858 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2021-09-13 14:12:03,124 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 56) no Hoare annotation was computed. [2021-09-13 14:12:03,127 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:12:03,129 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:12:03,129 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:12:03,129 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2021-09-13 14:12:03,129 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2021-09-13 14:12:03,130 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:12:03,130 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2021-09-13 14:12:03,130 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2021-09-13 14:12:03,130 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:12:03,140 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2021-09-13 14:12:03,140 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2021-09-13 14:12:03,140 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2021-09-13 14:12:03,140 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2021-09-13 14:12:03,140 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2021-09-13 14:12:03,140 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:12:03,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,147 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:12:03 BoogieIcfgContainer [2021-09-13 14:12:03,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:12:03,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:12:03,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:12:03,149 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:12:03,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:12:00" (3/4) ... [2021-09-13 14:12:03,151 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-09-13 14:12:03,172 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-09-13 14:12:03,173 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-09-13 14:12:03,173 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:12:03,173 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:12:03,247 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:12:03,247 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:12:03,247 INFO L158 Benchmark]: Toolchain (without parser) took 3514.30ms. Allocated memory was 46.1MB in the beginning and 98.6MB in the end (delta: 52.4MB). Free memory was 22.3MB in the beginning and 73.4MB in the end (delta: -51.1MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. [2021-09-13 14:12:03,248 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 46.1MB. Free memory was 28.5MB in the beginning and 28.4MB in the end (delta: 43.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:12:03,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.03ms. Allocated memory is still 58.7MB. Free memory was 43.8MB in the beginning and 33.8MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-09-13 14:12:03,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.44ms. Allocated memory is still 58.7MB. Free memory was 33.8MB in the beginning and 42.0MB in the end (delta: -8.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-09-13 14:12:03,248 INFO L158 Benchmark]: Boogie Preprocessor took 27.13ms. Allocated memory is still 58.7MB. Free memory was 42.0MB in the beginning and 40.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:12:03,249 INFO L158 Benchmark]: RCFGBuilder took 238.30ms. Allocated memory is still 58.7MB. Free memory was 40.9MB in the beginning and 31.6MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-09-13 14:12:03,249 INFO L158 Benchmark]: TraceAbstraction took 2928.36ms. Allocated memory was 58.7MB in the beginning and 98.6MB in the end (delta: 39.8MB). Free memory was 31.2MB in the beginning and 76.3MB in the end (delta: -45.1MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2021-09-13 14:12:03,249 INFO L158 Benchmark]: Witness Printer took 98.10ms. Allocated memory is still 98.6MB. Free memory was 76.3MB in the beginning and 73.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:12:03,250 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.14ms. Allocated memory is still 46.1MB. Free memory was 28.5MB in the beginning and 28.4MB in the end (delta: 43.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.03ms. Allocated memory is still 58.7MB. Free memory was 43.8MB in the beginning and 33.8MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.44ms. Allocated memory is still 58.7MB. Free memory was 33.8MB in the beginning and 42.0MB in the end (delta: -8.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.13ms. Allocated memory is still 58.7MB. Free memory was 42.0MB in the beginning and 40.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 238.30ms. Allocated memory is still 58.7MB. Free memory was 40.9MB in the beginning and 31.6MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2928.36ms. Allocated memory was 58.7MB in the beginning and 98.6MB in the end (delta: 39.8MB). Free memory was 31.2MB in the beginning and 76.3MB in the end (delta: -45.1MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * Witness Printer took 98.10ms. Allocated memory is still 98.6MB. Free memory was 76.3MB in the beginning and 73.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2824.12ms, OverallIterations: 3, TraceHistogramMax: 2, EmptinessCheckTime: 43.83ms, AutomataDifference: 407.59ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 89.51ms, InitialAbstractionConstructionTime: 5.68ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 81.53ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 78.16ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 98 IncrementalHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 0 mSDtfsCounter, 98 mSolverCounterSat, 1.59ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 297.21ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred 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.00ms DumpTime, AutomataMinimizationStatistics: 33.22ms AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 41 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 19.13ms HoareSimplificationTime, 2 FomulaSimplificationsInter, 78 FormulaSimplificationTreeSizeReductionInter, 64.84ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 15.35ms SsaConstructionTime, 44.49ms SatisfiabilityAnalysisTime, 1232.15ms InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 36 ConstructedInterpolants, 2 QuantifiedInterpolants, 191 SizeOfPredicates, 12 NumberOfNonLiveVariables, 174 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 [2021-09-13 14:12:03,264 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,268 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,269 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,270 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] [2021-09-13 14:12:03,270 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__n~0,QUANTIFIED] Derived loop invariant: ((forall ULTIMATE.start_main_~main__n~0 : int :: (ULTIMATE.start_main_~main__n~0 + ULTIMATE.start_main_~main__n~0 * ULTIMATE.start_main_~main__n~0 == 2 * main__i + 2 * main__sum || ULTIMATE.start_main_~main__n~0 < main__i) || main__i + 1 <= ULTIMATE.start_main_~main__n~0) && (main__n + main__n * main__n == 2 * main__sum || main__i <= main__n)) && 1 <= main__n - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-09-13 14:12:03,280 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...