./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/ps4-ll.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/nla-digbench/ps4-ll.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 cfc42074b47d4d990a3ba4dc31ed80105722a572 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:16:36,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:16:36,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:16:36,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:16:36,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:16:36,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:16:36,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:16:36,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:16:36,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:16:36,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:16:36,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:16:36,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:16:36,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:16:36,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:16:36,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:16:36,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:16:36,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:16:36,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:16:36,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:16:36,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:16:36,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:16:36,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:16:36,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:16:36,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:16:36,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:16:36,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:16:36,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:16:36,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:16:36,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:16:36,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:16:36,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:16:36,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:16:36,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:16:36,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:16:36,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:16:36,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:16:36,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:16:36,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:16:36,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:16:36,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:16:36,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:16:36,895 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:16:36,915 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:16:36,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:16:36,915 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:16:36,915 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:16:36,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:16:36,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:16:36,916 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:16:36,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:16:36,917 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:16:36,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:16:36,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:16:36,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:16:36,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:16:36,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:16:36,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:16:36,918 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:16:36,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:16:36,918 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:16:36,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:16:36,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:16:36,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:16:36,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:16:36,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:16:36,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:16:36,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:16:36,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:16:36,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:16:36,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:16:36,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:16:36,920 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:16:36,920 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 -> cfc42074b47d4d990a3ba4dc31ed80105722a572 [2021-09-13 14:16:37,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:16:37,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:16:37,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:16:37,183 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:16:37,185 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:16:37,186 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/ps4-ll.c [2021-09-13 14:16:37,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7a3f4d1/2ec19acd8f4044c883c959d6d2d00ae1/FLAGad716aa6b [2021-09-13 14:16:37,573 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:16:37,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/ps4-ll.c [2021-09-13 14:16:37,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7a3f4d1/2ec19acd8f4044c883c959d6d2d00ae1/FLAGad716aa6b [2021-09-13 14:16:37,602 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7a3f4d1/2ec19acd8f4044c883c959d6d2d00ae1 [2021-09-13 14:16:37,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:16:37,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:16:37,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:16:37,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:16:37,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:16:37,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:16:37" (1/1) ... [2021-09-13 14:16:37,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c1d7052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:37, skipping insertion in model container [2021-09-13 14:16:37,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:16:37" (1/1) ... [2021-09-13 14:16:37,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:16:37,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:16:37,700 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/nla-digbench/ps4-ll.c[458,471] [2021-09-13 14:16:37,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:16:37,714 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:16:37,721 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/nla-digbench/ps4-ll.c[458,471] [2021-09-13 14:16:37,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:16:37,735 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:16:37,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:37 WrapperNode [2021-09-13 14:16:37,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:16:37,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:16:37,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:16:37,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:16:37,742 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:16:37" (1/1) ... [2021-09-13 14:16:37,746 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:16:37" (1/1) ... [2021-09-13 14:16:37,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:16:37,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:16:37,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:16:37,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:16:37,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:37" (1/1) ... [2021-09-13 14:16:37,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:37" (1/1) ... [2021-09-13 14:16:37,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:37" (1/1) ... [2021-09-13 14:16:37,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:37" (1/1) ... [2021-09-13 14:16:37,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:37" (1/1) ... [2021-09-13 14:16:37,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:37" (1/1) ... [2021-09-13 14:16:37,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:37" (1/1) ... [2021-09-13 14:16:37,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:16:37,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:16:37,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:16:37,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:16:37,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:37" (1/1) ... [2021-09-13 14:16:37,807 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:16:37,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:16:37,829 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:16:37,848 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:16:37,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:16:37,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:16:37,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:16:37,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:16:38,023 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:16:38,023 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-09-13 14:16:38,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:16:38 BoogieIcfgContainer [2021-09-13 14:16:38,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:16:38,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:16:38,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:16:38,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:16:38,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:16:37" (1/3) ... [2021-09-13 14:16:38,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755a8580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:16:38, skipping insertion in model container [2021-09-13 14:16:38,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:16:37" (2/3) ... [2021-09-13 14:16:38,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755a8580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:16:38, skipping insertion in model container [2021-09-13 14:16:38,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:16:38" (3/3) ... [2021-09-13 14:16:38,030 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll.c [2021-09-13 14:16:38,033 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:16:38,034 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-09-13 14:16:38,060 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:16:38,064 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:16:38,064 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-09-13 14:16:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 15 states have (on average 1.6) internal successors, (24), 18 states have internal predecessors, (24), 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:16:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-09-13 14:16:38,077 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:16:38,077 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-09-13 14:16:38,078 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:16:38,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:16:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash 28699754, now seen corresponding path program 1 times [2021-09-13 14:16:38,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:16:38,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278732540] [2021-09-13 14:16:38,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:38,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:16:38,162 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:16:38,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [662290028] [2021-09-13 14:16:38,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:38,163 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:16:38,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:16:38,172 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:16:38,181 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:16:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:38,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:16:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:38,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:16:38,387 INFO L281 TraceCheckUtils]: 0: Hoare triple {22#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(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {22#true} is VALID [2021-09-13 14:16:38,388 INFO L281 TraceCheckUtils]: 1: Hoare triple {22#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {30#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} is VALID [2021-09-13 14:16:38,389 INFO L281 TraceCheckUtils]: 2: Hoare triple {30#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {34#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:16:38,390 INFO L281 TraceCheckUtils]: 3: Hoare triple {34#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {23#false} is VALID [2021-09-13 14:16:38,390 INFO L281 TraceCheckUtils]: 4: Hoare triple {23#false} assume !false; {23#false} is VALID [2021-09-13 14:16:38,391 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:16:38,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:16:38,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:16:38,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278732540] [2021-09-13 14:16:38,391 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:16:38,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662290028] [2021-09-13 14:16:38,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662290028] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:16:38,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:16:38,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:16:38,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683849640] [2021-09-13 14:16:38,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2021-09-13 14:16:38,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:16:38,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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:16:38,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:38,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:16:38,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:16:38,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:16:38,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:16:38,418 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.6) internal successors, (24), 18 states have internal predecessors, (24), 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.25) internal successors, (5), 4 states have internal predecessors, (5), 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:16:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:38,557 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2021-09-13 14:16:38,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:16:38,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2021-09-13 14:16:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:16:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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:16:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2021-09-13 14:16:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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:16:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2021-09-13 14:16:38,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2021-09-13 14:16:38,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:38,624 INFO L225 Difference]: With dead ends: 48 [2021-09-13 14:16:38,624 INFO L226 Difference]: Without dead ends: 19 [2021-09-13 14:16:38,626 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.35ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:16:38,630 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.19ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.68ms IncrementalHoareTripleChecker+Time [2021-09-13 14:16:38,631 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 1.19ms Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 45.68ms Time] [2021-09-13 14:16:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-09-13 14:16:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-09-13 14:16:38,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:16:38,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 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:16:38,655 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 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:16:38,656 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 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:16:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:38,660 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2021-09-13 14:16:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2021-09-13 14:16:38,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:38,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:38,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 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 19 states. [2021-09-13 14:16:38,661 INFO L87 Difference]: Start difference. First operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 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 19 states. [2021-09-13 14:16:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:38,663 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2021-09-13 14:16:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2021-09-13 14:16:38,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:38,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:38,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:16:38,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:16:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 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:16:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2021-09-13 14:16:38,667 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 5 [2021-09-13 14:16:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:16:38,667 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2021-09-13 14:16:38,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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:16:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2021-09-13 14:16:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-09-13 14:16:38,668 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:16:38,668 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2021-09-13 14:16:38,690 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:16:38,879 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:16:38,879 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:16:38,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:16:38,880 INFO L82 PathProgramCache]: Analyzing trace with hash 300806046, now seen corresponding path program 1 times [2021-09-13 14:16:38,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:16:38,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889717945] [2021-09-13 14:16:38,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:38,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:16:38,888 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:16:38,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [332316534] [2021-09-13 14:16:38,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:38,888 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:16:38,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:16:38,889 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:16:38,890 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:16:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:38,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:16:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:38,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:16:39,105 INFO L281 TraceCheckUtils]: 0: Hoare triple {167#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(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {167#true} is VALID [2021-09-13 14:16:39,106 INFO L281 TraceCheckUtils]: 1: Hoare triple {167#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {175#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} is VALID [2021-09-13 14:16:39,107 INFO L281 TraceCheckUtils]: 2: Hoare triple {175#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {175#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} is VALID [2021-09-13 14:16:39,107 INFO L281 TraceCheckUtils]: 3: Hoare triple {175#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} assume !(0 == __VERIFIER_assert_~cond); {175#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} is VALID [2021-09-13 14:16:39,108 INFO L281 TraceCheckUtils]: 4: Hoare triple {175#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {185#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:16:39,108 INFO L281 TraceCheckUtils]: 5: Hoare triple {185#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {189#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:16:39,109 INFO L281 TraceCheckUtils]: 6: Hoare triple {189#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {168#false} is VALID [2021-09-13 14:16:39,109 INFO L281 TraceCheckUtils]: 7: Hoare triple {168#false} assume !false; {168#false} is VALID [2021-09-13 14:16:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:16:39,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:16:39,586 INFO L281 TraceCheckUtils]: 7: Hoare triple {168#false} assume !false; {168#false} is VALID [2021-09-13 14:16:39,587 INFO L281 TraceCheckUtils]: 6: Hoare triple {189#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {168#false} is VALID [2021-09-13 14:16:39,588 INFO L281 TraceCheckUtils]: 5: Hoare triple {202#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {189#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:16:39,622 INFO L281 TraceCheckUtils]: 4: Hoare triple {202#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {202#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:16:39,623 INFO L281 TraceCheckUtils]: 3: Hoare triple {202#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {202#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:16:39,623 INFO L281 TraceCheckUtils]: 2: Hoare triple {202#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {202#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:16:39,624 INFO L281 TraceCheckUtils]: 1: Hoare triple {167#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {202#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:16:39,624 INFO L281 TraceCheckUtils]: 0: Hoare triple {167#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(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {167#true} is VALID [2021-09-13 14:16:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-09-13 14:16:39,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:16:39,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889717945] [2021-09-13 14:16:39,624 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:16:39,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332316534] [2021-09-13 14:16:39,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332316534] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:16:39,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:16:39,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2021-09-13 14:16:39,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32156520] [2021-09-13 14:16:39,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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 8 [2021-09-13 14:16:39,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:16:39,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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:16:39,644 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:16:39,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:16:39,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:16:39,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:16:39,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:16:39,645 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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:16:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:39,786 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2021-09-13 14:16:39,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:16:39,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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 8 [2021-09-13 14:16:39,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:16:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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:16:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2021-09-13 14:16:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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:16:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2021-09-13 14:16:39,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2021-09-13 14:16:39,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:39,832 INFO L225 Difference]: With dead ends: 27 [2021-09-13 14:16:39,832 INFO L226 Difference]: Without dead ends: 19 [2021-09-13 14:16:39,832 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 395.60ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:16:39,833 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.61ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.31ms IncrementalHoareTripleChecker+Time [2021-09-13 14:16:39,833 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 54 Unknown, 0 Unchecked, 0.61ms Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 55.31ms Time] [2021-09-13 14:16:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-09-13 14:16:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2021-09-13 14:16:39,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:16:39,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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:16:39,842 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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:16:39,842 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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:16:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:39,843 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2021-09-13 14:16:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2021-09-13 14:16:39,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:39,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:39,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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) Second operand 19 states. [2021-09-13 14:16:39,843 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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) Second operand 19 states. [2021-09-13 14:16:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:39,844 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2021-09-13 14:16:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2021-09-13 14:16:39,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:39,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:39,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:16:39,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:16:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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:16:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2021-09-13 14:16:39,845 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2021-09-13 14:16:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:16:39,845 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2021-09-13 14:16:39,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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:16:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2021-09-13 14:16:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 14:16:39,851 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:16:39,851 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:16:39,870 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:16:40,064 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:16:40,065 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:16:40,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:16:40,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2016022751, now seen corresponding path program 1 times [2021-09-13 14:16:40,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:16:40,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594841703] [2021-09-13 14:16:40,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:40,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:16:40,076 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:16:40,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579968402] [2021-09-13 14:16:40,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:40,077 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:16:40,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:16:40,078 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:16:40,080 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:16:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:40,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2021-09-13 14:16:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:40,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:16:40,443 INFO L281 TraceCheckUtils]: 0: Hoare triple {312#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(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {312#true} is VALID [2021-09-13 14:16:40,444 INFO L281 TraceCheckUtils]: 1: Hoare triple {312#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {320#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:16:40,445 INFO L281 TraceCheckUtils]: 2: Hoare triple {320#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {320#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:16:40,445 INFO L281 TraceCheckUtils]: 3: Hoare triple {320#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {320#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:16:40,446 INFO L281 TraceCheckUtils]: 4: Hoare triple {320#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {330#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:16:40,447 INFO L281 TraceCheckUtils]: 5: Hoare triple {330#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {330#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:16:40,447 INFO L281 TraceCheckUtils]: 6: Hoare triple {330#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} assume !(0 == __VERIFIER_assert_~cond); {330#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:16:40,448 INFO L281 TraceCheckUtils]: 7: Hoare triple {330#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} assume !(main_~c~0 < main_~k~0); {340#(and (< 0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~y~0 1))} is VALID [2021-09-13 14:16:40,448 INFO L281 TraceCheckUtils]: 8: Hoare triple {340#(and (< 0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~y~0 1))} __VERIFIER_assert_#in~cond := (if 0 == main_~k~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {344#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:16:40,449 INFO L281 TraceCheckUtils]: 9: Hoare triple {344#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {313#false} is VALID [2021-09-13 14:16:40,449 INFO L281 TraceCheckUtils]: 10: Hoare triple {313#false} assume !false; {313#false} is VALID [2021-09-13 14:16:40,449 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:16:40,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:16:40,928 INFO L281 TraceCheckUtils]: 10: Hoare triple {313#false} assume !false; {313#false} is VALID [2021-09-13 14:16:40,929 INFO L281 TraceCheckUtils]: 9: Hoare triple {344#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {313#false} is VALID [2021-09-13 14:16:40,930 INFO L281 TraceCheckUtils]: 8: Hoare triple {357#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~k~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {344#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:16:40,930 INFO L281 TraceCheckUtils]: 7: Hoare triple {361#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(main_~c~0 < main_~k~0); {357#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:16:40,931 INFO L281 TraceCheckUtils]: 6: Hoare triple {361#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(0 == __VERIFIER_assert_~cond); {361#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:40,932 INFO L281 TraceCheckUtils]: 5: Hoare triple {361#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {361#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:40,944 INFO L281 TraceCheckUtils]: 4: Hoare triple {371#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {361#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:40,944 INFO L281 TraceCheckUtils]: 3: Hoare triple {371#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !(0 == __VERIFIER_assert_~cond); {371#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:16:40,945 INFO L281 TraceCheckUtils]: 2: Hoare triple {371#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {371#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:16:40,949 INFO L281 TraceCheckUtils]: 1: Hoare triple {312#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {371#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:16:40,949 INFO L281 TraceCheckUtils]: 0: Hoare triple {312#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(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {312#true} is VALID [2021-09-13 14:16:40,950 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:16:40,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:16:40,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594841703] [2021-09-13 14:16:40,950 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:16:40,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579968402] [2021-09-13 14:16:40,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579968402] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:16:40,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:16:40,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-09-13 14:16:40,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98262008] [2021-09-13 14:16:40,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 11 [2021-09-13 14:16:40,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:16:40,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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:16:40,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:40,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:16:40,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:16:40,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:16:40,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:16:40,982 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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:16:41,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:41,097 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2021-09-13 14:16:41,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:16:41,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 11 [2021-09-13 14:16:41,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:16:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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:16:41,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2021-09-13 14:16:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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:16:41,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2021-09-13 14:16:41,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 19 transitions. [2021-09-13 14:16:41,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:41,112 INFO L225 Difference]: With dead ends: 19 [2021-09-13 14:16:41,112 INFO L226 Difference]: Without dead ends: 15 [2021-09-13 14:16:41,112 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 81.87ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:16:41,113 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.54ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 44.91ms IncrementalHoareTripleChecker+Time [2021-09-13 14:16:41,113 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 58 Unknown, 0 Unchecked, 0.54ms Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 10 Unchecked, 44.91ms Time] [2021-09-13 14:16:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-09-13 14:16:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-09-13 14:16:41,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:16:41,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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:16:41,138 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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:16:41,138 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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:16:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:41,139 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2021-09-13 14:16:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2021-09-13 14:16:41,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:41,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:41,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 15 states. [2021-09-13 14:16:41,139 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 15 states. [2021-09-13 14:16:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:41,140 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2021-09-13 14:16:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2021-09-13 14:16:41,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:41,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:41,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:16:41,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:16:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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:16:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2021-09-13 14:16:41,153 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2021-09-13 14:16:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:16:41,153 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2021-09-13 14:16:41,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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:16:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2021-09-13 14:16:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:16:41,154 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:16:41,154 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2021-09-13 14:16:41,172 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:16:41,360 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:16:41,361 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:16:41,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:16:41,362 INFO L82 PathProgramCache]: Analyzing trace with hash -271065837, now seen corresponding path program 2 times [2021-09-13 14:16:41,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:16:41,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447568770] [2021-09-13 14:16:41,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:41,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:16:41,369 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:16:41,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629057863] [2021-09-13 14:16:41,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:16:41,370 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:16:41,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:16:41,371 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:16:41,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-09-13 14:16:41,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:16:41,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:16:41,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 16 conjunts are in the unsatisfiable core [2021-09-13 14:16:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:41,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:16:41,746 INFO L281 TraceCheckUtils]: 0: Hoare triple {463#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(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {463#true} is VALID [2021-09-13 14:16:41,747 INFO L281 TraceCheckUtils]: 1: Hoare triple {463#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {471#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:16:41,747 INFO L281 TraceCheckUtils]: 2: Hoare triple {471#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {471#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:16:41,748 INFO L281 TraceCheckUtils]: 3: Hoare triple {471#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {471#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:16:41,748 INFO L281 TraceCheckUtils]: 4: Hoare triple {471#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {481#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:16:41,749 INFO L281 TraceCheckUtils]: 5: Hoare triple {481#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {481#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:16:41,749 INFO L281 TraceCheckUtils]: 6: Hoare triple {481#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} assume !(0 == __VERIFIER_assert_~cond); {481#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:16:41,753 INFO L281 TraceCheckUtils]: 7: Hoare triple {481#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {491#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:16:41,754 INFO L281 TraceCheckUtils]: 8: Hoare triple {491#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {491#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:16:41,754 INFO L281 TraceCheckUtils]: 9: Hoare triple {491#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} assume !(0 == __VERIFIER_assert_~cond); {491#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:16:41,756 INFO L281 TraceCheckUtils]: 10: Hoare triple {491#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} assume !(main_~c~0 < main_~k~0); {501#(and (<= ULTIMATE.start_main_~k~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:16:41,757 INFO L281 TraceCheckUtils]: 11: Hoare triple {501#(and (<= ULTIMATE.start_main_~k~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} __VERIFIER_assert_#in~cond := (if 0 == main_~k~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {505#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:16:41,757 INFO L281 TraceCheckUtils]: 12: Hoare triple {505#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {464#false} is VALID [2021-09-13 14:16:41,757 INFO L281 TraceCheckUtils]: 13: Hoare triple {464#false} assume !false; {464#false} is VALID [2021-09-13 14:16:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:16:41,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:16:42,502 INFO L281 TraceCheckUtils]: 13: Hoare triple {464#false} assume !false; {464#false} is VALID [2021-09-13 14:16:42,502 INFO L281 TraceCheckUtils]: 12: Hoare triple {505#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {464#false} is VALID [2021-09-13 14:16:42,503 INFO L281 TraceCheckUtils]: 11: Hoare triple {518#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~k~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {505#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:16:42,504 INFO L281 TraceCheckUtils]: 10: Hoare triple {522#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(main_~c~0 < main_~k~0); {518#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:16:42,504 INFO L281 TraceCheckUtils]: 9: Hoare triple {522#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(0 == __VERIFIER_assert_~cond); {522#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:42,504 INFO L281 TraceCheckUtils]: 8: Hoare triple {522#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {522#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:42,527 INFO L281 TraceCheckUtils]: 7: Hoare triple {532#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {522#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:42,528 INFO L281 TraceCheckUtils]: 6: Hoare triple {532#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !(0 == __VERIFIER_assert_~cond); {532#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:16:42,528 INFO L281 TraceCheckUtils]: 5: Hoare triple {532#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {532#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:16:42,532 INFO L281 TraceCheckUtils]: 4: Hoare triple {542#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {532#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:16:42,533 INFO L281 TraceCheckUtils]: 3: Hoare triple {542#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} assume !(0 == __VERIFIER_assert_~cond); {542#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:16:42,534 INFO L281 TraceCheckUtils]: 2: Hoare triple {542#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {542#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:16:42,534 INFO L281 TraceCheckUtils]: 1: Hoare triple {463#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {542#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:16:42,534 INFO L281 TraceCheckUtils]: 0: Hoare triple {463#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(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {463#true} is VALID [2021-09-13 14:16:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:16:42,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:16:42,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447568770] [2021-09-13 14:16:42,535 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:16:42,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629057863] [2021-09-13 14:16:42,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629057863] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:16:42,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:16:42,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-09-13 14:16:42,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387536620] [2021-09-13 14:16:42,536 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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 14 [2021-09-13 14:16:42,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:16:42,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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:16:42,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:42,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-09-13 14:16:42,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:16:42,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-09-13 14:16:42,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:16:42,572 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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:16:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:42,858 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2021-09-13 14:16:42,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 14:16:42,858 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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 14 [2021-09-13 14:16:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:16:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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:16:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2021-09-13 14:16:42,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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:16:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2021-09-13 14:16:42,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 32 transitions. [2021-09-13 14:16:42,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:42,907 INFO L225 Difference]: With dead ends: 30 [2021-09-13 14:16:42,907 INFO L226 Difference]: Without dead ends: 24 [2021-09-13 14:16:42,907 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 235.36ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:16:42,908 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.03ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 57.60ms IncrementalHoareTripleChecker+Time [2021-09-13 14:16:42,909 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 1.03ms Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 21 Unchecked, 57.60ms Time] [2021-09-13 14:16:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-09-13 14:16:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-09-13 14:16:42,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:16:42,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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:16:42,965 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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:16:42,966 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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:16:42,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:42,966 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2021-09-13 14:16:42,966 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2021-09-13 14:16:42,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:42,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:42,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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 24 states. [2021-09-13 14:16:42,967 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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 24 states. [2021-09-13 14:16:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:42,968 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2021-09-13 14:16:42,968 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2021-09-13 14:16:42,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:42,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:42,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:16:42,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:16:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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:16:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2021-09-13 14:16:42,969 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 14 [2021-09-13 14:16:42,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:16:42,969 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2021-09-13 14:16:42,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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:16:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2021-09-13 14:16:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-13 14:16:42,970 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:16:42,970 INFO L513 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1] [2021-09-13 14:16:42,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:16:43,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:16:43,185 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:16:43,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:16:43,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1849051169, now seen corresponding path program 3 times [2021-09-13 14:16:43,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:16:43,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863466303] [2021-09-13 14:16:43,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:43,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:16:43,192 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:16:43,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311295060] [2021-09-13 14:16:43,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-09-13 14:16:43,192 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:16:43,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:16:43,195 INFO L229 MonitoredProcess]: Starting monitored process 6 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:16:43,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-09-13 14:16:43,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-09-13 14:16:43,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:16:43,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 28 conjunts are in the unsatisfiable core [2021-09-13 14:16:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:43,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:16:43,724 INFO L281 TraceCheckUtils]: 0: Hoare triple {692#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(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {692#true} is VALID [2021-09-13 14:16:43,725 INFO L281 TraceCheckUtils]: 1: Hoare triple {692#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {700#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:16:43,726 INFO L281 TraceCheckUtils]: 2: Hoare triple {700#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {700#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:16:43,726 INFO L281 TraceCheckUtils]: 3: Hoare triple {700#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {700#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:16:43,727 INFO L281 TraceCheckUtils]: 4: Hoare triple {700#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {710#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:16:43,727 INFO L281 TraceCheckUtils]: 5: Hoare triple {710#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {710#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:16:43,727 INFO L281 TraceCheckUtils]: 6: Hoare triple {710#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} assume !(0 == __VERIFIER_assert_~cond); {710#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:16:43,728 INFO L281 TraceCheckUtils]: 7: Hoare triple {710#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {720#(and (= ULTIMATE.start_main_~c~0 2) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:16:43,728 INFO L281 TraceCheckUtils]: 8: Hoare triple {720#(and (= ULTIMATE.start_main_~c~0 2) (= ULTIMATE.start_main_~y~0 2))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {720#(and (= ULTIMATE.start_main_~c~0 2) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:16:43,729 INFO L281 TraceCheckUtils]: 9: Hoare triple {720#(and (= ULTIMATE.start_main_~c~0 2) (= ULTIMATE.start_main_~y~0 2))} assume !(0 == __VERIFIER_assert_~cond); {720#(and (= ULTIMATE.start_main_~c~0 2) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:16:43,729 INFO L281 TraceCheckUtils]: 10: Hoare triple {720#(and (= ULTIMATE.start_main_~c~0 2) (= ULTIMATE.start_main_~y~0 2))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {730#(and (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} is VALID [2021-09-13 14:16:43,730 INFO L281 TraceCheckUtils]: 11: Hoare triple {730#(and (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {730#(and (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} is VALID [2021-09-13 14:16:43,730 INFO L281 TraceCheckUtils]: 12: Hoare triple {730#(and (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} assume !(0 == __VERIFIER_assert_~cond); {730#(and (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} is VALID [2021-09-13 14:16:43,731 INFO L281 TraceCheckUtils]: 13: Hoare triple {730#(and (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {740#(and (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} is VALID [2021-09-13 14:16:43,731 INFO L281 TraceCheckUtils]: 14: Hoare triple {740#(and (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {740#(and (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} is VALID [2021-09-13 14:16:43,731 INFO L281 TraceCheckUtils]: 15: Hoare triple {740#(and (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} assume !(0 == __VERIFIER_assert_~cond); {740#(and (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} is VALID [2021-09-13 14:16:43,732 INFO L281 TraceCheckUtils]: 16: Hoare triple {740#(and (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {750#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5))} is VALID [2021-09-13 14:16:43,732 INFO L281 TraceCheckUtils]: 17: Hoare triple {750#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {750#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5))} is VALID [2021-09-13 14:16:43,733 INFO L281 TraceCheckUtils]: 18: Hoare triple {750#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5))} assume !(0 == __VERIFIER_assert_~cond); {750#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5))} is VALID [2021-09-13 14:16:43,734 INFO L281 TraceCheckUtils]: 19: Hoare triple {750#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5))} assume !(main_~c~0 < main_~k~0); {760#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~k~0 5))} is VALID [2021-09-13 14:16:43,734 INFO L281 TraceCheckUtils]: 20: Hoare triple {760#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~k~0 5))} __VERIFIER_assert_#in~cond := (if 0 == main_~k~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {764#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:16:43,734 INFO L281 TraceCheckUtils]: 21: Hoare triple {764#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {693#false} is VALID [2021-09-13 14:16:43,735 INFO L281 TraceCheckUtils]: 22: Hoare triple {693#false} assume !false; {693#false} is VALID [2021-09-13 14:16:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:16:43,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:16:45,422 INFO L281 TraceCheckUtils]: 22: Hoare triple {693#false} assume !false; {693#false} is VALID [2021-09-13 14:16:45,423 INFO L281 TraceCheckUtils]: 21: Hoare triple {764#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {693#false} is VALID [2021-09-13 14:16:45,423 INFO L281 TraceCheckUtils]: 20: Hoare triple {777#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~k~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {764#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:16:45,424 INFO L281 TraceCheckUtils]: 19: Hoare triple {781#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(main_~c~0 < main_~k~0); {777#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:16:45,424 INFO L281 TraceCheckUtils]: 18: Hoare triple {781#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(0 == __VERIFIER_assert_~cond); {781#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:45,424 INFO L281 TraceCheckUtils]: 17: Hoare triple {781#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {781#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:45,432 INFO L281 TraceCheckUtils]: 16: Hoare triple {791#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {781#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:45,437 INFO L281 TraceCheckUtils]: 15: Hoare triple {791#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !(0 == __VERIFIER_assert_~cond); {791#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:16:45,437 INFO L281 TraceCheckUtils]: 14: Hoare triple {791#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {791#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:16:45,441 INFO L281 TraceCheckUtils]: 13: Hoare triple {801#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {791#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:16:45,442 INFO L281 TraceCheckUtils]: 12: Hoare triple {801#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} assume !(0 == __VERIFIER_assert_~cond); {801#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:16:45,442 INFO L281 TraceCheckUtils]: 11: Hoare triple {801#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {801#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:16:45,448 INFO L281 TraceCheckUtils]: 10: Hoare triple {811#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {801#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:16:45,448 INFO L281 TraceCheckUtils]: 9: Hoare triple {811#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2))))} assume !(0 == __VERIFIER_assert_~cond); {811#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2))))} is VALID [2021-09-13 14:16:45,449 INFO L281 TraceCheckUtils]: 8: Hoare triple {811#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {811#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2))))} is VALID [2021-09-13 14:16:45,454 INFO L281 TraceCheckUtils]: 7: Hoare triple {821#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0)))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {811#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2))))} is VALID [2021-09-13 14:16:45,455 INFO L281 TraceCheckUtils]: 6: Hoare triple {821#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0)))))} assume !(0 == __VERIFIER_assert_~cond); {821#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:16:45,455 INFO L281 TraceCheckUtils]: 5: Hoare triple {821#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0)))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {821#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:16:45,460 INFO L281 TraceCheckUtils]: 4: Hoare triple {831#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0)))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {821#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:16:45,461 INFO L281 TraceCheckUtils]: 3: Hoare triple {831#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0)))} assume !(0 == __VERIFIER_assert_~cond); {831#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0)))} is VALID [2021-09-13 14:16:45,461 INFO L281 TraceCheckUtils]: 2: Hoare triple {831#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0)))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {831#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0)))} is VALID [2021-09-13 14:16:45,463 INFO L281 TraceCheckUtils]: 1: Hoare triple {692#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {831#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0)))} is VALID [2021-09-13 14:16:45,463 INFO L281 TraceCheckUtils]: 0: Hoare triple {692#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(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {692#true} is VALID [2021-09-13 14:16:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:16:45,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:16:45,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863466303] [2021-09-13 14:16:45,464 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:16:45,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311295060] [2021-09-13 14:16:45,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311295060] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:16:45,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:16:45,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-09-13 14:16:45,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656260670] [2021-09-13 14:16:45,464 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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 23 [2021-09-13 14:16:45,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:16:45,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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:16:45,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:45,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-09-13 14:16:45,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:16:45,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-09-13 14:16:45,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-09-13 14:16:45,538 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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:16:46,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:46,362 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2021-09-13 14:16:46,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-09-13 14:16:46,362 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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 23 [2021-09-13 14:16:46,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:16:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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:16:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 30 transitions. [2021-09-13 14:16:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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:16:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 30 transitions. [2021-09-13 14:16:46,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 30 transitions. [2021-09-13 14:16:46,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:46,421 INFO L225 Difference]: With dead ends: 29 [2021-09-13 14:16:46,421 INFO L226 Difference]: Without dead ends: 0 [2021-09-13 14:16:46,421 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 632.13ms TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2021-09-13 14:16:46,422 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 311.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.90ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 312.64ms IncrementalHoareTripleChecker+Time [2021-09-13 14:16:46,422 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 122 Unknown, 0 Unchecked, 0.90ms Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 18 Unchecked, 312.64ms Time] [2021-09-13 14:16:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-09-13 14:16:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-09-13 14:16:46,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:16:46,422 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:16:46,422 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:16:46,422 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:16:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:46,423 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:16:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:16:46,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:46,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:46,423 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:16:46,423 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:16:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:46,423 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:16:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:16:46,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:46,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:46,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:16:46,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:16:46,423 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:16:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-09-13 14:16:46,423 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2021-09-13 14:16:46,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:16:46,424 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-09-13 14:16:46,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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:16:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:16:46,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:46,426 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2021-09-13 14:16:46,426 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2021-09-13 14:16:46,426 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2021-09-13 14:16:46,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-09-13 14:16:46,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:16:46,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-09-13 14:16:46,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:16:46,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:16:46,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:16:46,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:16:46,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:16:47,431 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-09-13 14:16:47,431 INFO L858 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2021-09-13 14:16:47,431 INFO L858 garLoopResultBuilder]: For program point L11-1(lines 11 12) no Hoare annotation was computed. [2021-09-13 14:16:47,431 INFO L858 garLoopResultBuilder]: For program point L11-2(lines 11 12) no Hoare annotation was computed. [2021-09-13 14:16:47,431 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-09-13 14:16:47,431 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-09-13 14:16:47,431 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-09-13 14:16:47,432 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-09-13 14:16:47,432 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-09-13 14:16:47,432 INFO L861 garLoopResultBuilder]: At program point L38(lines 17 39) the Hoare annotation is: true [2021-09-13 14:16:47,432 INFO L854 garLoopResultBuilder]: At program point L26-2(lines 26 35) the Hoare annotation is: (or (and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0)) (let ((.cse0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (and (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) .cse0) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0)) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0))))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))) (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse0 (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))))) [2021-09-13 14:16:47,432 INFO L858 garLoopResultBuilder]: For program point L26-3(lines 26 35) no Hoare annotation was computed. [2021-09-13 14:16:47,432 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-09-13 14:16:47,432 INFO L858 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2021-09-13 14:16:47,432 INFO L854 garLoopResultBuilder]: At program point L10-2(lines 29 30) the Hoare annotation is: (let ((.cse0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (and (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) .cse0) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0)) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0))))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))) (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse0 (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0)))) [2021-09-13 14:16:47,433 INFO L858 garLoopResultBuilder]: For program point L10-3(lines 10 13) no Hoare annotation was computed. [2021-09-13 14:16:47,433 INFO L854 garLoopResultBuilder]: At program point L10-5(lines 9 15) the Hoare annotation is: (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0)) [2021-09-13 14:16:47,433 INFO L858 garLoopResultBuilder]: For program point L10-6(lines 10 13) no Hoare annotation was computed. [2021-09-13 14:16:47,433 INFO L861 garLoopResultBuilder]: At program point L10-8(lines 9 15) the Hoare annotation is: true [2021-09-13 14:16:47,435 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:16:47,438 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:16:47,438 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:16:47,438 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2021-09-13 14:16:47,438 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2021-09-13 14:16:47,438 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:16:47,438 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2021-09-13 14:16:47,438 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:16:47,438 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:16:47,438 WARN L170 areAnnotationChecker]: L10-3 has no Hoare annotation [2021-09-13 14:16:47,438 WARN L170 areAnnotationChecker]: L10-3 has no Hoare annotation [2021-09-13 14:16:47,438 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:16:47,438 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:16:47,438 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2021-09-13 14:16:47,684 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2021-09-13 14:16:47,684 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2021-09-13 14:16:47,684 WARN L170 areAnnotationChecker]: L10-6 has no Hoare annotation [2021-09-13 14:16:47,684 WARN L170 areAnnotationChecker]: L10-6 has no Hoare annotation [2021-09-13 14:16:47,684 WARN L170 areAnnotationChecker]: L10-6 has no Hoare annotation [2021-09-13 14:16:47,684 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2021-09-13 14:16:47,684 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2021-09-13 14:16:47,684 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:16:47,684 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:16:47,684 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:16:47,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,700 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,702 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,702 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,702 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,702 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,703 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,703 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,705 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:16:47 BoogieIcfgContainer [2021-09-13 14:16:47,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:16:47,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:16:47,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:16:47,711 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:16:47,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:16:38" (3/4) ... [2021-09-13 14:16:47,713 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-09-13 14:16:47,719 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-09-13 14:16:47,720 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-09-13 14:16:47,720 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:16:47,720 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:16:47,744 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:16:47,745 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:16:47,745 INFO L158 Benchmark]: Toolchain (without parser) took 10140.69ms. Allocated memory was 60.8MB in the beginning and 107.0MB in the end (delta: 46.1MB). Free memory was 40.0MB in the beginning and 61.6MB in the end (delta: -21.7MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2021-09-13 14:16:47,746 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory was 43.2MB in the beginning and 43.2MB in the end (delta: 50.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:16:47,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 130.74ms. Allocated memory is still 60.8MB. Free memory was 39.8MB in the beginning and 29.6MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:16:47,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.81ms. Allocated memory is still 60.8MB. Free memory was 29.6MB in the beginning and 44.9MB in the end (delta: -15.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-09-13 14:16:47,746 INFO L158 Benchmark]: Boogie Preprocessor took 12.38ms. Allocated memory is still 60.8MB. Free memory was 44.9MB in the beginning and 43.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:16:47,747 INFO L158 Benchmark]: RCFGBuilder took 222.39ms. Allocated memory is still 60.8MB. Free memory was 43.7MB in the beginning and 34.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-09-13 14:16:47,747 INFO L158 Benchmark]: TraceAbstraction took 9684.58ms. Allocated memory was 60.8MB in the beginning and 107.0MB in the end (delta: 46.1MB). Free memory was 33.7MB in the beginning and 64.8MB in the end (delta: -31.1MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2021-09-13 14:16:47,747 INFO L158 Benchmark]: Witness Printer took 34.37ms. Allocated memory is still 107.0MB. Free memory was 64.8MB in the beginning and 61.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:16:47,749 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.16ms. Allocated memory is still 60.8MB. Free memory was 43.2MB in the beginning and 43.2MB in the end (delta: 50.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 130.74ms. Allocated memory is still 60.8MB. Free memory was 39.8MB in the beginning and 29.6MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.81ms. Allocated memory is still 60.8MB. Free memory was 29.6MB in the beginning and 44.9MB in the end (delta: -15.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.38ms. Allocated memory is still 60.8MB. Free memory was 44.9MB in the beginning and 43.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 222.39ms. Allocated memory is still 60.8MB. Free memory was 43.7MB in the beginning and 34.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9684.58ms. Allocated memory was 60.8MB in the beginning and 107.0MB in the end (delta: 46.1MB). Free memory was 33.7MB in the beginning and 64.8MB in the end (delta: -31.1MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Witness Printer took 34.37ms. Allocated memory is still 107.0MB. Free memory was 64.8MB in the beginning and 61.6MB in the end (delta: 3.1MB). 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_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~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: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: 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, 19 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 9376.86ms, OverallIterations: 5, TraceHistogramMax: 6, EmptinessCheckTime: 13.09ms, AutomataDifference: 1776.69ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 803.95ms, InitialAbstractionConstructionTime: 5.80ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 516.14ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 510.82ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 49 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 312 IncrementalHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 0 mSDtfsCounter, 312 mSolverCounterSat, 4.27ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1363.30ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=4, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 131.51ms AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 26 NumberOfFragments, 212 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 67.65ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 763 FormulaSimplificationTreeSizeReductionInter, 728.88ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 18.30ms SsaConstructionTime, 188.36ms SatisfiabilityAnalysisTime, 4944.91ms InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 108 ConstructedInterpolants, 24 QuantifiedInterpolants, 1203 SizeOfPredicates, 21 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 1/118 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 3 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant [2021-09-13 14:16:47,765 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,765 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,765 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,765 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,765 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,765 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,766 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,766 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] Derived loop invariant: (((1 <= cond && (y * k == y * y || c < k)) && (forall ULTIMATE.start_main_~k~0 : int :: (c + 4 < ULTIMATE.start_main_~k~0 || ULTIMATE.start_main_~k~0 <= c + 3) || 16 + 8 * y + y * y == y * ULTIMATE.start_main_~k~0 + 4 * ULTIMATE.start_main_~k~0)) && (forall ULTIMATE.start_main_~k~0 : int :: (c + 3 < ULTIMATE.start_main_~k~0 || 3 * ULTIMATE.start_main_~k~0 + y * ULTIMATE.start_main_~k~0 == 9 + 6 * y + y * y) || ULTIMATE.start_main_~k~0 <= c + 2)) && y * y * y * y + y * y + 2 * (y * y * y) == 4 * x - InvariantResult [Line: 26]: Loop Invariant [2021-09-13 14:16:47,770 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,770 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,770 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,770 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,772 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,772 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,772 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,774 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,774 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:16:47,774 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] Derived loop invariant: ((y == 0 && x == 0) && c == 0) || ((((1 <= cond && (y * k == y * y || c < k)) && (forall ULTIMATE.start_main_~k~0 : int :: (c + 4 < ULTIMATE.start_main_~k~0 || ULTIMATE.start_main_~k~0 <= c + 3) || 16 + 8 * y + y * y == y * ULTIMATE.start_main_~k~0 + 4 * ULTIMATE.start_main_~k~0)) && (forall ULTIMATE.start_main_~k~0 : int :: (c + 3 < ULTIMATE.start_main_~k~0 || 3 * ULTIMATE.start_main_~k~0 + y * ULTIMATE.start_main_~k~0 == 9 + 6 * y + y * y) || ULTIMATE.start_main_~k~0 <= c + 2)) && y * y * y * y + y * y + 2 * (y * y * y) == 4 * x) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: y * y * y * y + y * y + 2 * (y * y * y) == 4 * x RESULT: Ultimate proved your program to be correct! [2021-09-13 14:16:47,798 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...