./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound5.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 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-scaling/ps2-ll_valuebound5.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 1b50d522769b95768e9038f61a48a3b927d40a7b91b44cb14af45fcd08759b69 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:40:54,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:40:54,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:40:54,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:40:54,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:40:54,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:40:54,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:40:54,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:40:54,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:40:54,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:40:54,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:40:54,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:40:54,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:40:54,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:40:54,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:40:54,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:40:54,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:40:54,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:40:54,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:40:54,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:40:54,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:40:54,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:40:54,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:40:54,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:40:54,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:40:54,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:40:54,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:40:54,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:40:54,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:40:54,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:40:54,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:40:54,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:40:54,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:40:54,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:40:54,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:40:54,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:40:54,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:40:54,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:40:54,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:40:54,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:40:54,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:40:54,850 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:40:54,877 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:40:54,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:40:54,878 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:40:54,878 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:40:54,879 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:40:54,879 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:40:54,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:40:54,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:40:54,880 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:40:54,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:40:54,880 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:40:54,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:40:54,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:40:54,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:40:54,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:40:54,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:40:54,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:40:54,882 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:40:54,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:40:54,882 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:40:54,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:40:54,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:40:54,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:40:54,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:40:54,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:40:54,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:40:54,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:40:54,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:40:54,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:40:54,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:40:54,885 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:40:54,885 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:40:54,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:40:54,885 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 -> 1b50d522769b95768e9038f61a48a3b927d40a7b91b44cb14af45fcd08759b69 [2022-02-20 17:40:55,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:40:55,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:40:55,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:40:55,115 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:40:55,116 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:40:55,117 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound5.c [2022-02-20 17:40:55,154 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30cf3ceff/f84e8303889d4872a51c1cb5859c75d4/FLAGd9fa2921a [2022-02-20 17:40:55,470 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:40:55,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound5.c [2022-02-20 17:40:55,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30cf3ceff/f84e8303889d4872a51c1cb5859c75d4/FLAGd9fa2921a [2022-02-20 17:40:55,493 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30cf3ceff/f84e8303889d4872a51c1cb5859c75d4 [2022-02-20 17:40:55,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:40:55,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:40:55,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:40:55,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:40:55,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:40:55,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:40:55" (1/1) ... [2022-02-20 17:40:55,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2c5a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:40:55, skipping insertion in model container [2022-02-20 17:40:55,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:40:55" (1/1) ... [2022-02-20 17:40:55,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:40:55,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:40:55,659 WARN L230 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-scaling/ps2-ll_valuebound5.c[454,467] [2022-02-20 17:40:55,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:40:55,689 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:40:55,698 WARN L230 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-scaling/ps2-ll_valuebound5.c[454,467] [2022-02-20 17:40:55,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:40:55,718 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:40:55,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:40:55 WrapperNode [2022-02-20 17:40:55,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:40:55,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:40:55,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:40:55,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:40:55,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:40:55" (1/1) ... [2022-02-20 17:40:55,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:40:55" (1/1) ... [2022-02-20 17:40:55,745 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 37 [2022-02-20 17:40:55,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:40:55,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:40:55,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:40:55,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:40:55,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:40:55" (1/1) ... [2022-02-20 17:40:55,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:40:55" (1/1) ... [2022-02-20 17:40:55,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:40:55" (1/1) ... [2022-02-20 17:40:55,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:40:55" (1/1) ... [2022-02-20 17:40:55,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:40:55" (1/1) ... [2022-02-20 17:40:55,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:40:55" (1/1) ... [2022-02-20 17:40:55,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:40:55" (1/1) ... [2022-02-20 17:40:55,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:40:55,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:40:55,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:40:55,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:40:55,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:40:55" (1/1) ... [2022-02-20 17:40:55,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:40:55,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:40:55,804 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:40:55,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:40:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:40:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:40:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:40:55,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:40:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:40:55,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:40:55,877 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:40:55,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:40:56,003 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:40:56,009 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:40:56,009 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:40:56,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:40:56 BoogieIcfgContainer [2022-02-20 17:40:56,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:40:56,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:40:56,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:40:56,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:40:56,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:40:55" (1/3) ... [2022-02-20 17:40:56,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e30c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:40:56, skipping insertion in model container [2022-02-20 17:40:56,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:40:55" (2/3) ... [2022-02-20 17:40:56,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e30c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:40:56, skipping insertion in model container [2022-02-20 17:40:56,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:40:56" (3/3) ... [2022-02-20 17:40:56,016 INFO L111 eAbstractionObserver]: Analyzing ICFG ps2-ll_valuebound5.c [2022-02-20 17:40:56,019 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:40:56,019 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:40:56,044 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:40:56,047 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, mAutomataTypeConcurrency=PETRI_NET, 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 [2022-02-20 17:40:56,048 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:40:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:40:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:40:56,060 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:40:56,061 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:40:56,061 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:40:56,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:40:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2022-02-20 17:40:56,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:40:56,070 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904812447] [2022-02-20 17:40:56,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:40:56,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:40:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:40:56,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-02-20 17:40:56,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {21#true} is VALID [2022-02-20 17:40:56,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {22#false} is VALID [2022-02-20 17:40:56,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#false} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {22#false} is VALID [2022-02-20 17:40:56,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#false} assume false; {22#false} is VALID [2022-02-20 17:40:56,207 INFO L272 TraceCheckUtils]: 5: Hoare triple {22#false} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~y~0#1 - 2 * main_~x~0#1 + main_~y~0#1 then 1 else 0)); {22#false} is VALID [2022-02-20 17:40:56,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-02-20 17:40:56,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-02-20 17:40:56,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-02-20 17:40:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:40:56,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:40:56,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904812447] [2022-02-20 17:40:56,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904812447] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:40:56,224 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:40:56,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:40:56,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023175508] [2022-02-20 17:40:56,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:40:56,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:40:56,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:40:56,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:40:56,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:40:56,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:40:56,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:40:56,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:40:56,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:40:56,272 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:40:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:40:56,320 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-02-20 17:40:56,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:40:56,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:40:56,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:40:56,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:40:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2022-02-20 17:40:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:40:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2022-02-20 17:40:56,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 44 transitions. [2022-02-20 17:40:56,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:40:56,388 INFO L225 Difference]: With dead ends: 33 [2022-02-20 17:40:56,388 INFO L226 Difference]: Without dead ends: 14 [2022-02-20 17:40:56,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:40:56,392 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:40:56,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:40:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-20 17:40:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-20 17:40:56,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:40:56,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:40:56,412 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:40:56,412 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:40:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:40:56,420 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-20 17:40:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-20 17:40:56,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:40:56,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:40:56,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-02-20 17:40:56,423 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-02-20 17:40:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:40:56,426 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-20 17:40:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-20 17:40:56,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:40:56,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:40:56,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:40:56,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:40:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:40:56,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-02-20 17:40:56,431 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-02-20 17:40:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:40:56,432 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-02-20 17:40:56,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:40:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-20 17:40:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:40:56,434 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:40:56,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:40:56,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:40:56,435 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:40:56,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:40:56,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2022-02-20 17:40:56,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:40:56,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522401291] [2022-02-20 17:40:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:40:56,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:40:56,460 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:40:56,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [962256692] [2022-02-20 17:40:56,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:40:56,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:40:56,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:40:56,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:40:56,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:40:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:40:56,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:40:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:40:56,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:40:56,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {114#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {114#true} is VALID [2022-02-20 17:40:56,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {114#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {114#true} is VALID [2022-02-20 17:40:56,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {114#true} assume !(0 == assume_abort_if_not_~cond#1); {114#true} is VALID [2022-02-20 17:40:56,645 INFO L290 TraceCheckUtils]: 3: Hoare triple {114#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {128#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:40:56,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {128#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {128#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:40:56,647 INFO L272 TraceCheckUtils]: 5: Hoare triple {128#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~y~0#1 - 2 * main_~x~0#1 + main_~y~0#1 then 1 else 0)); {135#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:40:56,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {135#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {139#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:40:56,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {139#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {115#false} is VALID [2022-02-20 17:40:56,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {115#false} assume !false; {115#false} is VALID [2022-02-20 17:40:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:40:56,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:40:56,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:40:56,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522401291] [2022-02-20 17:40:56,650 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:40:56,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962256692] [2022-02-20 17:40:56,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962256692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:40:56,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:40:56,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:40:56,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335985171] [2022-02-20 17:40:56,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:40:56,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:40:56,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:40:56,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:40:56,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:40:56,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:40:56,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:40:56,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:40:56,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:40:56,678 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:40:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:40:56,768 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-20 17:40:56,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:40:56,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:40:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:40:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:40:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-02-20 17:40:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:40:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-02-20 17:40:56,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-02-20 17:40:56,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:40:56,797 INFO L225 Difference]: With dead ends: 24 [2022-02-20 17:40:56,797 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:40:56,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:40:56,798 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:40:56,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:40:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:40:56,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:40:56,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:40:56,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:40:56,802 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:40:56,803 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:40:56,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:40:56,804 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 17:40:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 17:40:56,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:40:56,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:40:56,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:40:56,805 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:40:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:40:56,806 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 17:40:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 17:40:56,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:40:56,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:40:56,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:40:56,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:40:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:40:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-02-20 17:40:56,808 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 9 [2022-02-20 17:40:56,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:40:56,809 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-02-20 17:40:56,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:40:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 17:40:56,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:40:56,809 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:40:56,809 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:40:56,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:40:57,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:40:57,026 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:40:57,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:40:57,027 INFO L85 PathProgramCache]: Analyzing trace with hash -610823942, now seen corresponding path program 1 times [2022-02-20 17:40:57,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:40:57,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590997017] [2022-02-20 17:40:57,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:40:57,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:40:57,042 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:40:57,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775390079] [2022-02-20 17:40:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:40:57,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:40:57,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:40:57,044 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:40:57,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:40:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:40:57,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:40:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:40:57,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:40:57,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {249#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {249#true} is VALID [2022-02-20 17:40:57,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {249#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {249#true} is VALID [2022-02-20 17:40:57,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#true} assume !(0 == assume_abort_if_not_~cond#1); {249#true} is VALID [2022-02-20 17:40:57,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {249#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {263#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:40:57,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {263#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {263#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:40:57,200 INFO L272 TraceCheckUtils]: 5: Hoare triple {263#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~y~0#1 - 2 * main_~x~0#1 + main_~y~0#1 then 1 else 0)); {249#true} is VALID [2022-02-20 17:40:57,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {249#true} ~cond := #in~cond; {249#true} is VALID [2022-02-20 17:40:57,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {249#true} assume !(0 == ~cond); {249#true} is VALID [2022-02-20 17:40:57,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {249#true} assume true; {249#true} is VALID [2022-02-20 17:40:57,201 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {249#true} {263#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #45#return; {263#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:40:57,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 + main_~x~0#1; {285#(and (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:40:57,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {285#(and (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !false; {285#(and (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:40:57,203 INFO L272 TraceCheckUtils]: 12: Hoare triple {285#(and (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~y~0#1 - 2 * main_~x~0#1 + main_~y~0#1 then 1 else 0)); {292#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:40:57,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {296#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:40:57,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {296#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {250#false} is VALID [2022-02-20 17:40:57,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {250#false} assume !false; {250#false} is VALID [2022-02-20 17:40:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:40:57,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:40:57,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {250#false} assume !false; {250#false} is VALID [2022-02-20 17:40:57,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {296#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {250#false} is VALID [2022-02-20 17:40:57,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {296#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:40:57,365 INFO L272 TraceCheckUtils]: 12: Hoare triple {312#(= (* 2 |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~y~0#1 - 2 * main_~x~0#1 + main_~y~0#1 then 1 else 0)); {292#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:40:57,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {312#(= (* 2 |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !false; {312#(= (* 2 |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:40:57,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {312#(= (* 2 |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 + main_~x~0#1; {312#(= (* 2 |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:40:57,367 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {249#true} {312#(= (* 2 |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} #45#return; {312#(= (* 2 |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:40:57,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {249#true} assume true; {249#true} is VALID [2022-02-20 17:40:57,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {249#true} assume !(0 == ~cond); {249#true} is VALID [2022-02-20 17:40:57,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {249#true} ~cond := #in~cond; {249#true} is VALID [2022-02-20 17:40:57,368 INFO L272 TraceCheckUtils]: 5: Hoare triple {312#(= (* 2 |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~y~0#1 - 2 * main_~x~0#1 + main_~y~0#1 then 1 else 0)); {249#true} is VALID [2022-02-20 17:40:57,369 INFO L290 TraceCheckUtils]: 4: Hoare triple {312#(= (* 2 |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !false; {312#(= (* 2 |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:40:57,369 INFO L290 TraceCheckUtils]: 3: Hoare triple {249#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {312#(= (* 2 |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:40:57,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#true} assume !(0 == assume_abort_if_not_~cond#1); {249#true} is VALID [2022-02-20 17:40:57,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {249#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {249#true} is VALID [2022-02-20 17:40:57,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {249#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {249#true} is VALID [2022-02-20 17:40:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:40:57,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:40:57,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590997017] [2022-02-20 17:40:57,371 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:40:57,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775390079] [2022-02-20 17:40:57,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775390079] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:40:57,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:40:57,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:40:57,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574986641] [2022-02-20 17:40:57,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:40:57,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:40:57,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:40:57,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:40:57,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:40:57,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:40:57,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:40:57,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:40:57,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:40:57,388 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:40:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:40:57,443 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 17:40:57,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:40:57,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:40:57,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:40:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:40:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-02-20 17:40:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:40:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-02-20 17:40:57,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 15 transitions. [2022-02-20 17:40:57,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:40:57,460 INFO L225 Difference]: With dead ends: 21 [2022-02-20 17:40:57,460 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:40:57,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:40:57,461 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:40:57,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:40:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:40:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:40:57,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:40:57,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:40:57,463 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:40:57,463 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:40:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:40:57,463 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:40:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:40:57,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:40:57,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:40:57,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:40:57,464 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:40:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:40:57,465 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:40:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:40:57,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:40:57,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:40:57,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:40:57,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:40:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:40:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:40:57,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-02-20 17:40:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:40:57,466 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:40:57,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:40:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:40:57,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:40:57,469 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:40:57,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:40:57,683 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,SelfDestructingSolverStorable2 [2022-02-20 17:40:57,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:40:57,707 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:40:57,707 INFO L854 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (= (* 2 |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) [2022-02-20 17:40:57,707 INFO L854 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (= (* 2 |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) [2022-02-20 17:40:57,707 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-02-20 17:40:57,707 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:40:57,707 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:40:57,707 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:40:57,707 INFO L854 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (= (* 2 |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) [2022-02-20 17:40:57,708 INFO L858 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2022-02-20 17:40:57,708 INFO L861 garLoopResultBuilder]: At program point L39(lines 17 40) the Hoare annotation is: true [2022-02-20 17:40:57,708 INFO L858 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-02-20 17:40:57,708 INFO L858 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-02-20 17:40:57,708 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-02-20 17:40:57,708 INFO L858 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-02-20 17:40:57,708 INFO L858 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-02-20 17:40:57,708 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-02-20 17:40:57,708 INFO L858 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-02-20 17:40:57,708 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-02-20 17:40:57,710 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 17:40:57,711 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:40:57,713 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:40:57,713 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:40:57,713 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:40:57,713 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:40:57,713 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:40:57,713 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:40:57,713 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:40:57,714 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 17:40:57,714 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 17:40:57,714 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-02-20 17:40:57,714 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 17:40:57,714 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:40:57,714 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:40:57,715 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-20 17:40:57,715 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-20 17:40:57,715 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 17:40:57,715 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 17:40:57,715 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-20 17:40:57,715 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:40:57,715 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:40:57,715 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:40:57,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:40:57 BoogieIcfgContainer [2022-02-20 17:40:57,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:40:57,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:40:57,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:40:57,721 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:40:57,721 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:40:56" (3/4) ... [2022-02-20 17:40:57,725 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:40:57,728 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:40:57,731 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 17:40:57,731 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:40:57,731 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:40:57,731 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:40:57,757 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:40:57,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:40:57,758 INFO L158 Benchmark]: Toolchain (without parser) took 2261.35ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 65.6MB in the beginning and 64.9MB in the end (delta: 704.3kB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2022-02-20 17:40:57,758 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 53.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:40:57,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.77ms. Allocated memory is still 96.5MB. Free memory was 65.3MB in the beginning and 71.6MB in the end (delta: -6.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-02-20 17:40:57,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.65ms. Allocated memory is still 96.5MB. Free memory was 71.6MB in the beginning and 69.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:40:57,758 INFO L158 Benchmark]: Boogie Preprocessor took 28.19ms. Allocated memory is still 96.5MB. Free memory was 69.9MB in the beginning and 68.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:40:57,759 INFO L158 Benchmark]: RCFGBuilder took 235.81ms. Allocated memory is still 96.5MB. Free memory was 68.8MB in the beginning and 59.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:40:57,759 INFO L158 Benchmark]: TraceAbstraction took 1709.12ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 58.7MB in the beginning and 67.0MB in the end (delta: -8.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-02-20 17:40:57,759 INFO L158 Benchmark]: Witness Printer took 36.14ms. Allocated memory is still 127.9MB. Free memory was 67.0MB in the beginning and 64.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:40:57,760 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.15ms. Allocated memory is still 96.5MB. Free memory is still 53.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.77ms. Allocated memory is still 96.5MB. Free memory was 65.3MB in the beginning and 71.6MB in the end (delta: -6.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.65ms. Allocated memory is still 96.5MB. Free memory was 71.6MB in the beginning and 69.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.19ms. Allocated memory is still 96.5MB. Free memory was 69.9MB in the beginning and 68.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 235.81ms. Allocated memory is still 96.5MB. Free memory was 68.8MB in the beginning and 59.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1709.12ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 58.7MB in the beginning and 67.0MB in the end (delta: -8.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Witness Printer took 36.14ms. Allocated memory is still 127.9MB. Free memory was 67.0MB in the beginning and 64.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 40 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 29 HoareAnnotationTreeSize, 10 FomulaSimplifications, 34 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 140 SizeOfPredicates, 2 NumberOfNonLiveVariables, 113 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 2 * x == y + y * y - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:40:57,785 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE