./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.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/ps6-ll_valuebound2.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 dbc7fc96c6d4708331280184201322c719c7fb1504d84fafd0b9583653597d2e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:43:56,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:43:56,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:43:56,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:43:56,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:43:56,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:43:56,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:43:56,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:43:56,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:43:56,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:43:56,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:43:56,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:43:56,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:43:56,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:43:56,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:43:56,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:43:56,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:43:56,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:43:56,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:43:56,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:43:56,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:43:56,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:43:56,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:43:56,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:43:56,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:43:56,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:43:56,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:43:56,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:43:56,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:43:56,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:43:56,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:43:56,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:43:56,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:43:56,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:43:56,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:43:56,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:43:56,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:43:56,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:43:56,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:43:56,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:43:56,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:43:56,878 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:43:56,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:43:56,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:43:56,913 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:43:56,913 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:43:56,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:43:56,914 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:43:56,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:43:56,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:43:56,915 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:43:56,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:43:56,916 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:43:56,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:43:56,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:43:56,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:43:56,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:43:56,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:43:56,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:43:56,917 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:43:56,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:43:56,917 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:43:56,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:43:56,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:43:56,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:43:56,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:43:56,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:43:56,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:43:56,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:43:56,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:43:56,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:43:56,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:43:56,918 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:43:56,918 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:43:56,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:43:56,919 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 -> dbc7fc96c6d4708331280184201322c719c7fb1504d84fafd0b9583653597d2e [2022-02-20 17:43:57,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:43:57,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:43:57,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:43:57,142 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:43:57,143 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:43:57,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c [2022-02-20 17:43:57,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4ae7ed8/5fd4c9f424404a979a1f75f4322d1c50/FLAG1678f5094 [2022-02-20 17:43:57,553 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:43:57,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c [2022-02-20 17:43:57,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4ae7ed8/5fd4c9f424404a979a1f75f4322d1c50/FLAG1678f5094 [2022-02-20 17:43:57,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4ae7ed8/5fd4c9f424404a979a1f75f4322d1c50 [2022-02-20 17:43:57,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:43:57,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:43:57,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:43:57,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:43:57,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:43:57,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:43:57" (1/1) ... [2022-02-20 17:43:57,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6a0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:57, skipping insertion in model container [2022-02-20 17:43:57,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:43:57" (1/1) ... [2022-02-20 17:43:57,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:43:57,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:43:57,666 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/ps6-ll_valuebound2.c[458,471] [2022-02-20 17:43:57,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:43:57,684 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:43:57,692 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/ps6-ll_valuebound2.c[458,471] [2022-02-20 17:43:57,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:43:57,708 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:43:57,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:57 WrapperNode [2022-02-20 17:43:57,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:43:57,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:43:57,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:43:57,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:43:57,724 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:43:57" (1/1) ... [2022-02-20 17:43:57,728 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:43:57" (1/1) ... [2022-02-20 17:43:57,740 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2022-02-20 17:43:57,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:43:57,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:43:57,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:43:57,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:43:57,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:57" (1/1) ... [2022-02-20 17:43:57,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:57" (1/1) ... [2022-02-20 17:43:57,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:57" (1/1) ... [2022-02-20 17:43:57,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:57" (1/1) ... [2022-02-20 17:43:57,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:57" (1/1) ... [2022-02-20 17:43:57,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:57" (1/1) ... [2022-02-20 17:43:57,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:57" (1/1) ... [2022-02-20 17:43:57,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:43:57,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:43:57,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:43:57,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:43:57,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:57" (1/1) ... [2022-02-20 17:43:57,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:43:57,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:57,797 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:43:57,801 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:43:57,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:43:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:43:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:43:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:43:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:43:57,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:43:57,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:43:57,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:43:57,904 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:43:57,905 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:43:57,999 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:43:58,004 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:43:58,004 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:43:58,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:43:58 BoogieIcfgContainer [2022-02-20 17:43:58,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:43:58,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:43:58,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:43:58,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:43:58,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:43:57" (1/3) ... [2022-02-20 17:43:58,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d485464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:43:58, skipping insertion in model container [2022-02-20 17:43:58,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:57" (2/3) ... [2022-02-20 17:43:58,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d485464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:43:58, skipping insertion in model container [2022-02-20 17:43:58,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:43:58" (3/3) ... [2022-02-20 17:43:58,011 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound2.c [2022-02-20 17:43:58,014 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:43:58,014 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:43:58,073 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:43:58,078 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:43:58,078 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:43:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:58,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:43:58,125 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:58,125 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:58,126 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:58,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:58,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1845349065, now seen corresponding path program 1 times [2022-02-20 17:43:58,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:58,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133703098] [2022-02-20 17:43:58,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:58,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:58,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:43:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:58,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:43:58,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:43:58,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:43:58,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#false} {27#true} #50#return; {28#false} is VALID [2022-02-20 17:43:58,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:43:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:58,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:43:58,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:43:58,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:43:58,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#false} {28#false} #52#return; {28#false} is VALID [2022-02-20 17:43:58,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#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); {27#true} is VALID [2022-02-20 17:43:58,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#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 -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {27#true} is VALID [2022-02-20 17:43:58,324 INFO L272 TraceCheckUtils]: 2: Hoare triple {27#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0)); {27#true} is VALID [2022-02-20 17:43:58,324 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:43:58,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:43:58,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:43:58,326 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28#false} {27#true} #50#return; {28#false} is VALID [2022-02-20 17:43:58,326 INFO L272 TraceCheckUtils]: 7: Hoare triple {28#false} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {27#true} is VALID [2022-02-20 17:43:58,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:43:58,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:43:58,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:43:58,327 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {28#false} {28#false} #52#return; {28#false} is VALID [2022-02-20 17:43:58,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {28#false} is VALID [2022-02-20 17:43:58,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-02-20 17:43:58,328 INFO L272 TraceCheckUtils]: 14: Hoare triple {28#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {28#false} is VALID [2022-02-20 17:43:58,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-02-20 17:43:58,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-02-20 17:43:58,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-02-20 17:43:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:43:58,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:58,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133703098] [2022-02-20 17:43:58,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133703098] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:43:58,332 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:43:58,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:43:58,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546715200] [2022-02-20 17:43:58,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:58,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:43:58,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:58,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:58,372 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:43:58,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:43:58,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:58,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:43:58,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:43:58,399 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:58,476 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2022-02-20 17:43:58,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:43:58,477 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:43:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2022-02-20 17:43:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2022-02-20 17:43:58,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 63 transitions. [2022-02-20 17:43:58,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:58,592 INFO L225 Difference]: With dead ends: 45 [2022-02-20 17:43:58,593 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 17:43:58,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:43:58,598 INFO L933 BasicCegarLoop]: 27 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, 27 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:43:58,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:58,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 17:43:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 17:43:58,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:58,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:43:58,629 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:43:58,629 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:43:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:58,633 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 17:43:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:43:58,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:58,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:58,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 20 states. [2022-02-20 17:43:58,634 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 20 states. [2022-02-20 17:43:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:58,637 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 17:43:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:43:58,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:58,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:58,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:58,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:43:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-02-20 17:43:58,641 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2022-02-20 17:43:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:58,641 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-20 17:43:58,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:43:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:43:58,643 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:58,643 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:58,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:43:58,643 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:58,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1506842435, now seen corresponding path program 1 times [2022-02-20 17:43:58,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:58,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33672190] [2022-02-20 17:43:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:58,658 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:58,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1114103210] [2022-02-20 17:43:58,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:58,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:58,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:58,673 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:43:58,674 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:43:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:58,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:43:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:58,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:58,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#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); {169#true} is VALID [2022-02-20 17:43:58,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#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 -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {169#true} is VALID [2022-02-20 17:43:58,876 INFO L272 TraceCheckUtils]: 2: Hoare triple {169#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0)); {169#true} is VALID [2022-02-20 17:43:58,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {169#true} ~cond := #in~cond; {169#true} is VALID [2022-02-20 17:43:58,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {169#true} assume !(0 == ~cond); {169#true} is VALID [2022-02-20 17:43:58,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} assume true; {169#true} is VALID [2022-02-20 17:43:58,877 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {169#true} {169#true} #50#return; {169#true} is VALID [2022-02-20 17:43:58,877 INFO L272 TraceCheckUtils]: 7: Hoare triple {169#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {169#true} is VALID [2022-02-20 17:43:58,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {169#true} ~cond := #in~cond; {169#true} is VALID [2022-02-20 17:43:58,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#true} assume !(0 == ~cond); {169#true} is VALID [2022-02-20 17:43:58,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {169#true} assume true; {169#true} is VALID [2022-02-20 17:43:58,878 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {169#true} {169#true} #52#return; {169#true} is VALID [2022-02-20 17:43:58,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {169#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {210#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:58,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {210#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {210#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:58,880 INFO L272 TraceCheckUtils]: 14: Hoare triple {210#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:58,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:58,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {170#false} is VALID [2022-02-20 17:43:58,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-02-20 17:43:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:43:58,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:43:58,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:58,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33672190] [2022-02-20 17:43:58,882 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:58,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114103210] [2022-02-20 17:43:58,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114103210] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:43:58,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:43:58,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:43:58,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961489566] [2022-02-20 17:43:58,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:58,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:43:58,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:58,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:58,896 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:43:58,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:43:58,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:58,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:43:58,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:43:58,898 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:59,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:59,068 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-20 17:43:59,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:43:59,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:43:59,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:43:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:43:59,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-02-20 17:43:59,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:59,103 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:43:59,103 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 17:43:59,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:43:59,104 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:59,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 17:43:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 17:43:59,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:59,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:59,109 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:59,109 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:59,111 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-20 17:43:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 17:43:59,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:59,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:59,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-02-20 17:43:59,112 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-02-20 17:43:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:59,114 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-20 17:43:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 17:43:59,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:59,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:59,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:59,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-02-20 17:43:59,117 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2022-02-20 17:43:59,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:59,117 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-20 17:43:59,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 17:43:59,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:43:59,118 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:59,118 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:59,138 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:43:59,334 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:43:59,334 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:59,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:59,335 INFO L85 PathProgramCache]: Analyzing trace with hash 903983968, now seen corresponding path program 1 times [2022-02-20 17:43:59,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:59,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771303508] [2022-02-20 17:43:59,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:59,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:59,348 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:59,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386198954] [2022-02-20 17:43:59,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:59,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:59,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:59,364 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:43:59,378 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:43:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:59,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:43:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:59,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:59,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#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); {365#true} is VALID [2022-02-20 17:43:59,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#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 -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {365#true} is VALID [2022-02-20 17:43:59,601 INFO L272 TraceCheckUtils]: 2: Hoare triple {365#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:59,602 INFO L290 TraceCheckUtils]: 3: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:59,602 INFO L290 TraceCheckUtils]: 4: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:59,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:59,602 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {365#true} {365#true} #50#return; {365#true} is VALID [2022-02-20 17:43:59,602 INFO L272 TraceCheckUtils]: 7: Hoare triple {365#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:59,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:59,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:59,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:59,603 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {365#true} {365#true} #52#return; {365#true} is VALID [2022-02-20 17:43:59,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:59,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:59,604 INFO L272 TraceCheckUtils]: 14: Hoare triple {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:59,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:59,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:59,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:59,606 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {365#true} {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #54#return; {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:59,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {406#(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_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {428#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} is VALID [2022-02-20 17:43:59,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {428#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} assume !false; {428#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} is VALID [2022-02-20 17:43:59,607 INFO L272 TraceCheckUtils]: 21: Hoare triple {428#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {435#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:59,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {435#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {439#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:59,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {439#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-02-20 17:43:59,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 17:43:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:43:59,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:08,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 17:44:08,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {439#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-02-20 17:44:08,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {435#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {439#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:08,568 INFO L272 TraceCheckUtils]: 21: Hoare triple {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {435#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:08,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !false; {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:44:12,575 WARN L290 TraceCheckUtils]: 19: Hoare triple {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |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_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is UNKNOWN [2022-02-20 17:44:12,577 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {365#true} {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} #54#return; {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:44:12,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:44:12,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:44:12,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:44:12,577 INFO L272 TraceCheckUtils]: 14: Hoare triple {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {365#true} is VALID [2022-02-20 17:44:12,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !false; {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:44:12,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:44:12,578 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {365#true} {365#true} #52#return; {365#true} is VALID [2022-02-20 17:44:12,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:44:12,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:44:12,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:44:12,579 INFO L272 TraceCheckUtils]: 7: Hoare triple {365#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {365#true} is VALID [2022-02-20 17:44:12,579 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {365#true} {365#true} #50#return; {365#true} is VALID [2022-02-20 17:44:12,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:44:12,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:44:12,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:44:12,579 INFO L272 TraceCheckUtils]: 2: Hoare triple {365#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0)); {365#true} is VALID [2022-02-20 17:44:12,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#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 -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {365#true} is VALID [2022-02-20 17:44:12,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#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); {365#true} is VALID [2022-02-20 17:44:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:44:12,580 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:12,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771303508] [2022-02-20 17:44:12,580 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:12,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386198954] [2022-02-20 17:44:12,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386198954] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:12,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:12,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:44:12,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380345595] [2022-02-20 17:44:12,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:44:12,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 17:44:12,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:12,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:44:16,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 20 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:16,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:44:16,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:16,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:44:16,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2022-02-20 17:44:16,346 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:44:16,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:16,426 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-02-20 17:44:16,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:44:16,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 17:44:16,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:44:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:44:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:44:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:44:16,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-02-20 17:44:20,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:20,268 INFO L225 Difference]: With dead ends: 33 [2022-02-20 17:44:20,268 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:44:20,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2022-02-20 17:44:20,269 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:20,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 65 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:44:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:44:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 17:44:20,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:20,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:20,276 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:20,277 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:20,280 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 17:44:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:44:20,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:20,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:20,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 29 states. [2022-02-20 17:44:20,282 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 29 states. [2022-02-20 17:44:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:20,286 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 17:44:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:44:20,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:20,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:20,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:20,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:44:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-02-20 17:44:20,290 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-02-20 17:44:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:20,293 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-02-20 17:44:20,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:44:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:44:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:44:20,295 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:20,298 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:20,322 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:44:20,498 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:44:20,498 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:20,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:20,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1648043046, now seen corresponding path program 1 times [2022-02-20 17:44:20,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:20,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554070174] [2022-02-20 17:44:20,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:20,513 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:20,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1897496364] [2022-02-20 17:44:20,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:20,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:20,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:20,517 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:20,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:44:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:20,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:44:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:20,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:20,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {664#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); {664#true} is VALID [2022-02-20 17:44:20,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {664#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 -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {664#true} is VALID [2022-02-20 17:44:20,960 INFO L272 TraceCheckUtils]: 2: Hoare triple {664#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0)); {664#true} is VALID [2022-02-20 17:44:20,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:44:20,960 INFO L290 TraceCheckUtils]: 4: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:44:20,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:44:20,964 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {664#true} {664#true} #50#return; {664#true} is VALID [2022-02-20 17:44:20,965 INFO L272 TraceCheckUtils]: 7: Hoare triple {664#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {664#true} is VALID [2022-02-20 17:44:20,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:44:20,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:44:20,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:44:20,970 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {664#true} {664#true} #52#return; {664#true} is VALID [2022-02-20 17:44:20,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:20,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:20,971 INFO L272 TraceCheckUtils]: 14: Hoare triple {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {664#true} is VALID [2022-02-20 17:44:20,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:44:20,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:44:20,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:44:20,973 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {664#true} {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #54#return; {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:20,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~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_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:20,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !false; {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:20,975 INFO L272 TraceCheckUtils]: 21: Hoare triple {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {664#true} is VALID [2022-02-20 17:44:20,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:44:20,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:44:20,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:44:20,985 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {664#true} {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #54#return; {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:20,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {749#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:20,989 INFO L272 TraceCheckUtils]: 27: Hoare triple {749#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {664#true} is VALID [2022-02-20 17:44:20,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:44:20,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:44:20,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:44:20,990 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {664#true} {749#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #56#return; {749#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:20,991 INFO L272 TraceCheckUtils]: 32: Hoare triple {749#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {768#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:20,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {768#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {772#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:20,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {772#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {665#false} is VALID [2022-02-20 17:44:20,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {665#false} assume !false; {665#false} is VALID [2022-02-20 17:44:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 17:44:20,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:21,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:21,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554070174] [2022-02-20 17:44:21,333 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:21,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897496364] [2022-02-20 17:44:21,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897496364] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:21,333 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:21,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:44:21,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083835974] [2022-02-20 17:44:21,334 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:21,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2022-02-20 17:44:21,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:21,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:44:21,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:21,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:44:21,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:21,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:44:21,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:44:21,358 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:44:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:21,510 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-02-20 17:44:21,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:44:21,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2022-02-20 17:44:21,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:44:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-02-20 17:44:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:44:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-02-20 17:44:21,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-02-20 17:44:21,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:21,542 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:44:21,542 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:44:21,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:44:21,545 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:21,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:44:21,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:44:21,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 17:44:21,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:21,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:21,552 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:21,552 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:21,554 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 17:44:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 17:44:21,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:21,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:21,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-02-20 17:44:21,555 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-02-20 17:44:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:21,556 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 17:44:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 17:44:21,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:21,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:21,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:21,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:44:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-02-20 17:44:21,559 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2022-02-20 17:44:21,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:21,559 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-02-20 17:44:21,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:44:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 17:44:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 17:44:21,560 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:21,560 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:21,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:21,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:21,778 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:21,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash -426505545, now seen corresponding path program 2 times [2022-02-20 17:44:21,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:21,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837558087] [2022-02-20 17:44:21,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:21,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:21,789 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:21,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1118093657] [2022-02-20 17:44:21,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:44:21,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:21,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:21,791 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:21,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:44:21,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:44:21,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:21,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:44:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:21,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:22,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {1004#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); {1004#true} is VALID [2022-02-20 17:44:22,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {1004#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 -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1004#true} is VALID [2022-02-20 17:44:22,175 INFO L272 TraceCheckUtils]: 2: Hoare triple {1004#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:44:22,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:44:22,175 INFO L290 TraceCheckUtils]: 4: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:44:22,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:44:22,175 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1004#true} {1004#true} #50#return; {1004#true} is VALID [2022-02-20 17:44:22,175 INFO L272 TraceCheckUtils]: 7: Hoare triple {1004#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:44:22,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:44:22,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:44:22,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:44:22,176 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1004#true} {1004#true} #52#return; {1004#true} is VALID [2022-02-20 17:44:22,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {1004#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1045#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:22,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {1045#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:22,177 INFO L272 TraceCheckUtils]: 14: Hoare triple {1045#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:44:22,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:44:22,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:44:22,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:44:22,178 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1004#true} {1045#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #54#return; {1045#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:22,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {1045#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~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_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1067#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:22,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {1067#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {1067#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:22,179 INFO L272 TraceCheckUtils]: 21: Hoare triple {1067#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:44:22,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:44:22,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:44:22,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:44:22,180 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1004#true} {1067#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #54#return; {1067#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:22,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {1067#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~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_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1089#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:44:22,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {1089#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !false; {1089#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:44:22,181 INFO L272 TraceCheckUtils]: 28: Hoare triple {1089#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:44:22,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:44:22,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:44:22,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:44:22,182 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1004#true} {1089#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} #54#return; {1089#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:44:22,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {1089#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !(main_~c~0#1 < main_~k~0#1); {1111#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:22,183 INFO L272 TraceCheckUtils]: 34: Hoare triple {1111#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:44:22,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:44:22,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:44:22,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:44:22,184 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1004#true} {1111#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} #56#return; {1111#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:22,185 INFO L272 TraceCheckUtils]: 39: Hoare triple {1111#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1130#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:22,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {1130#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1134#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:22,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {1134#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1005#false} is VALID [2022-02-20 17:44:22,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {1005#false} assume !false; {1005#false} is VALID [2022-02-20 17:44:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 17:44:22,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:22,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:22,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837558087] [2022-02-20 17:44:22,418 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:22,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118093657] [2022-02-20 17:44:22,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118093657] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:22,419 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:22,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:44:22,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928156002] [2022-02-20 17:44:22,419 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:22,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-02-20 17:44:22,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:22,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 17:44:22,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:22,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:44:22,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:22,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:44:22,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:44:22,447 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 17:44:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:22,656 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-20 17:44:22,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:44:22,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-02-20 17:44:22,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 17:44:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-02-20 17:44:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 17:44:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-02-20 17:44:22,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-02-20 17:44:22,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:22,691 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:44:22,691 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 17:44:22,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:44:22,692 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:22,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 167 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:44:22,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 17:44:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-02-20 17:44:22,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:22,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:44:22,716 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:44:22,716 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:44:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:22,718 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-02-20 17:44:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-02-20 17:44:22,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:22,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:22,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-02-20 17:44:22,722 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-02-20 17:44:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:22,727 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-02-20 17:44:22,727 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-02-20 17:44:22,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:22,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:22,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:22,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:44:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-02-20 17:44:22,730 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 43 [2022-02-20 17:44:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:22,731 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-02-20 17:44:22,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 17:44:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-02-20 17:44:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 17:44:22,734 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:22,734 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:22,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:22,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:22,939 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:22,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:22,940 INFO L85 PathProgramCache]: Analyzing trace with hash 173594938, now seen corresponding path program 3 times [2022-02-20 17:44:22,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:22,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598175364] [2022-02-20 17:44:22,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:22,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:22,977 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:22,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385313857] [2022-02-20 17:44:22,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:44:22,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:22,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:22,987 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:23,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:44:23,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 17:44:23,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:23,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:44:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:23,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:23,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {1382#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); {1382#true} is VALID [2022-02-20 17:44:23,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {1382#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 -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1382#true} is VALID [2022-02-20 17:44:23,743 INFO L272 TraceCheckUtils]: 2: Hoare triple {1382#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:44:23,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {1382#true} ~cond := #in~cond; {1396#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:44:23,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {1396#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1400#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:44:23,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {1400#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1400#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:44:23,744 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1400#(not (= |assume_abort_if_not_#in~cond| 0))} {1382#true} #50#return; {1407#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} is VALID [2022-02-20 17:44:23,744 INFO L272 TraceCheckUtils]: 7: Hoare triple {1407#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:44:23,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:44:23,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:44:23,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:44:23,745 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1382#true} {1407#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} #52#return; {1407#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} is VALID [2022-02-20 17:44:23,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {1407#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1426#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 0 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:23,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {1426#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 0 |ULTIMATE.start_main_~c~0#1|))} assume !false; {1426#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 0 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:23,746 INFO L272 TraceCheckUtils]: 14: Hoare triple {1426#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 0 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:44:23,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:44:23,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:44:23,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:44:23,747 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1382#true} {1426#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 0 |ULTIMATE.start_main_~c~0#1|))} #54#return; {1426#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 0 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:23,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {1426#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 0 |ULTIMATE.start_main_~c~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_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1448#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 1 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:23,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {1448#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 1 |ULTIMATE.start_main_~c~0#1|))} assume !false; {1448#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 1 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:23,748 INFO L272 TraceCheckUtils]: 21: Hoare triple {1448#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 1 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:44:23,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:44:23,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:44:23,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:44:23,749 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1382#true} {1448#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 1 |ULTIMATE.start_main_~c~0#1|))} #54#return; {1448#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 1 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:23,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {1448#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 1 |ULTIMATE.start_main_~c~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_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1470#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} is VALID [2022-02-20 17:44:23,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {1470#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} assume !false; {1470#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} is VALID [2022-02-20 17:44:23,753 INFO L272 TraceCheckUtils]: 28: Hoare triple {1470#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:44:23,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:44:23,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:44:23,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:44:23,754 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1382#true} {1470#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} #54#return; {1470#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} is VALID [2022-02-20 17:44:23,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {1470#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} 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_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1383#false} is VALID [2022-02-20 17:44:23,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {1383#false} assume !false; {1383#false} is VALID [2022-02-20 17:44:23,754 INFO L272 TraceCheckUtils]: 35: Hoare triple {1383#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1383#false} is VALID [2022-02-20 17:44:23,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {1383#false} ~cond := #in~cond; {1383#false} is VALID [2022-02-20 17:44:23,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {1383#false} assume !(0 == ~cond); {1383#false} is VALID [2022-02-20 17:44:23,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {1383#false} assume true; {1383#false} is VALID [2022-02-20 17:44:23,755 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1383#false} {1383#false} #54#return; {1383#false} is VALID [2022-02-20 17:44:23,755 INFO L290 TraceCheckUtils]: 40: Hoare triple {1383#false} assume !(main_~c~0#1 < main_~k~0#1); {1383#false} is VALID [2022-02-20 17:44:23,755 INFO L272 TraceCheckUtils]: 41: Hoare triple {1383#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1383#false} is VALID [2022-02-20 17:44:23,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {1383#false} ~cond := #in~cond; {1383#false} is VALID [2022-02-20 17:44:23,755 INFO L290 TraceCheckUtils]: 43: Hoare triple {1383#false} assume !(0 == ~cond); {1383#false} is VALID [2022-02-20 17:44:23,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {1383#false} assume true; {1383#false} is VALID [2022-02-20 17:44:23,756 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1383#false} {1383#false} #56#return; {1383#false} is VALID [2022-02-20 17:44:23,756 INFO L272 TraceCheckUtils]: 46: Hoare triple {1383#false} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1383#false} is VALID [2022-02-20 17:44:23,756 INFO L290 TraceCheckUtils]: 47: Hoare triple {1383#false} ~cond := #in~cond; {1383#false} is VALID [2022-02-20 17:44:23,756 INFO L290 TraceCheckUtils]: 48: Hoare triple {1383#false} assume 0 == ~cond; {1383#false} is VALID [2022-02-20 17:44:23,756 INFO L290 TraceCheckUtils]: 49: Hoare triple {1383#false} assume !false; {1383#false} is VALID [2022-02-20 17:44:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 17:44:23,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:24,029 INFO L290 TraceCheckUtils]: 49: Hoare triple {1383#false} assume !false; {1383#false} is VALID [2022-02-20 17:44:24,029 INFO L290 TraceCheckUtils]: 48: Hoare triple {1383#false} assume 0 == ~cond; {1383#false} is VALID [2022-02-20 17:44:24,030 INFO L290 TraceCheckUtils]: 47: Hoare triple {1383#false} ~cond := #in~cond; {1383#false} is VALID [2022-02-20 17:44:24,030 INFO L272 TraceCheckUtils]: 46: Hoare triple {1383#false} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1383#false} is VALID [2022-02-20 17:44:24,030 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1382#true} {1383#false} #56#return; {1383#false} is VALID [2022-02-20 17:44:24,030 INFO L290 TraceCheckUtils]: 44: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:44:24,030 INFO L290 TraceCheckUtils]: 43: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:44:24,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:44:24,030 INFO L272 TraceCheckUtils]: 41: Hoare triple {1383#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:44:24,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {1383#false} assume !(main_~c~0#1 < main_~k~0#1); {1383#false} is VALID [2022-02-20 17:44:24,031 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1382#true} {1383#false} #54#return; {1383#false} is VALID [2022-02-20 17:44:24,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:44:24,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:44:24,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:44:24,031 INFO L272 TraceCheckUtils]: 35: Hoare triple {1383#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:44:24,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {1383#false} assume !false; {1383#false} is VALID [2022-02-20 17:44:24,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {1588#(not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~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_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1383#false} is VALID [2022-02-20 17:44:24,032 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1382#true} {1588#(not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))} #54#return; {1588#(not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:24,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:44:24,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:44:24,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:44:24,033 INFO L272 TraceCheckUtils]: 28: Hoare triple {1588#(not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:44:24,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {1588#(not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))} assume !false; {1588#(not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:24,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {1610#(<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~c~0#1| 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_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1588#(not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:24,034 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1382#true} {1610#(<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~c~0#1| 1))} #54#return; {1610#(<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~c~0#1| 1))} is VALID [2022-02-20 17:44:24,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:44:24,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:44:24,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:44:24,035 INFO L272 TraceCheckUtils]: 21: Hoare triple {1610#(<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~c~0#1| 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:44:24,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {1610#(<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~c~0#1| 1))} assume !false; {1610#(<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~c~0#1| 1))} is VALID [2022-02-20 17:44:24,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {1632#(<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~c~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_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1610#(<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~c~0#1| 1))} is VALID [2022-02-20 17:44:24,036 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1382#true} {1632#(<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~c~0#1|))} #54#return; {1632#(<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:24,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:44:24,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:44:24,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:44:24,037 INFO L272 TraceCheckUtils]: 14: Hoare triple {1632#(<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:44:24,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {1632#(<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~c~0#1|))} assume !false; {1632#(<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:24,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#(<= |ULTIMATE.start_main_~k~0#1| 2)} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1632#(<= |ULTIMATE.start_main_~k~0#1| (+ 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:24,038 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1382#true} {1654#(<= |ULTIMATE.start_main_~k~0#1| 2)} #52#return; {1654#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-20 17:44:24,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:44:24,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:44:24,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:44:24,039 INFO L272 TraceCheckUtils]: 7: Hoare triple {1654#(<= |ULTIMATE.start_main_~k~0#1| 2)} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:44:24,039 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1400#(not (= |assume_abort_if_not_#in~cond| 0))} {1382#true} #50#return; {1654#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-20 17:44:24,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {1400#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1400#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:44:24,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {1682#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1400#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:44:24,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {1382#true} ~cond := #in~cond; {1682#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-02-20 17:44:24,040 INFO L272 TraceCheckUtils]: 2: Hoare triple {1382#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:44:24,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {1382#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 -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1382#true} is VALID [2022-02-20 17:44:24,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {1382#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); {1382#true} is VALID [2022-02-20 17:44:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-02-20 17:44:24,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:24,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598175364] [2022-02-20 17:44:24,041 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:24,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385313857] [2022-02-20 17:44:24,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385313857] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:44:24,041 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:44:24,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-02-20 17:44:24,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603350182] [2022-02-20 17:44:24,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:24,044 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 10 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) Word has length 50 [2022-02-20 17:44:24,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:24,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 10 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-20 17:44:24,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:24,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:44:24,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:24,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:44:24,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:44:24,103 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 10 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-20 17:44:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:24,279 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-02-20 17:44:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:44:24,279 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 10 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) Word has length 50 [2022-02-20 17:44:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 10 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-20 17:44:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-02-20 17:44:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 10 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-20 17:44:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-02-20 17:44:24,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-02-20 17:44:24,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:24,310 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:44:24,310 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:44:24,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:44:24,310 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:24,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 111 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:44:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:44:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:44:24,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:24,311 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:44:24,311 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:44:24,311 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:44:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:24,311 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:44:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:44:24,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:24,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:24,312 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:44:24,312 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:44:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:24,312 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:44:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:44:24,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:24,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:24,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:24,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:24,312 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:44:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:44:24,312 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2022-02-20 17:44:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:24,313 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:44:24,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 10 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-20 17:44:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:44:24,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:24,315 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:44:24,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:24,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:24,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:44:24,723 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:44:24,723 INFO L854 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse1 (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (.cse0 (<= |ULTIMATE.start_main_~k~0#1| 2))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) .cse1 (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (<= 2 |ULTIMATE.start_main_~c~0#1|) .cse0 (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2) .cse1) (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)))) [2022-02-20 17:44:24,723 INFO L858 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2022-02-20 17:44:24,724 INFO L861 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-02-20 17:44:24,724 INFO L854 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2)) [2022-02-20 17:44:24,724 INFO L858 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-02-20 17:44:24,724 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:44:24,724 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:44:24,724 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:44:24,724 INFO L854 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse1 (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (.cse0 (<= |ULTIMATE.start_main_~k~0#1| 2))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) .cse1 (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (<= 2 |ULTIMATE.start_main_~c~0#1|) .cse0 (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2) .cse1) (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)))) [2022-02-20 17:44:24,724 INFO L854 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse0 (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (or (and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2) .cse0) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) (and (<= |ULTIMATE.start_main_~k~0#1| 1) (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) .cse0 (< 0 |ULTIMATE.start_main_~k~0#1|)))) [2022-02-20 17:44:24,724 INFO L858 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-02-20 17:44:24,725 INFO L861 garLoopResultBuilder]: At program point L41(lines 17 42) the Hoare annotation is: true [2022-02-20 17:44:24,725 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (or (and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2) .cse0) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) (and (<= |ULTIMATE.start_main_~k~0#1| 1) (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) .cse0 (< 0 |ULTIMATE.start_main_~k~0#1|)))) [2022-02-20 17:44:24,725 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-02-20 17:44:24,725 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-02-20 17:44:24,725 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-02-20 17:44:24,725 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-02-20 17:44:24,725 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-02-20 17:44:24,725 INFO L858 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-02-20 17:44:24,725 INFO L858 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-02-20 17:44:24,725 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-02-20 17:44:24,726 INFO L858 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-02-20 17:44:24,726 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-02-20 17:44:24,728 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-02-20 17:44:24,729 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:44:24,731 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:44:24,731 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:44:24,731 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:44:24,731 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:44:24,731 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:44:24,731 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:44:24,731 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:44:24,731 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:44:24,731 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-02-20 17:44:24,732 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 17:44:24,732 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 17:44:24,732 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-02-20 17:44:24,732 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 17:44:24,732 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:44:24,732 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:44:24,732 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:24,732 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:24,732 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:24,732 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 17:44:24,732 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 17:44:24,732 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 17:44:24,733 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:44:24,733 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:44:24,750 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:44:24,750 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 17:44:24,750 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:44:24,750 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:44:24,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:44:24 BoogieIcfgContainer [2022-02-20 17:44:24,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:44:24,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:44:24,759 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:44:24,760 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:44:24,760 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:43:58" (3/4) ... [2022-02-20 17:44:24,762 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:44:24,765 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 17:44:24,765 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:44:24,767 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 17:44:24,767 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:44:24,768 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:44:24,768 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:44:24,789 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:44:24,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:44:24,790 INFO L158 Benchmark]: Toolchain (without parser) took 27221.88ms. Allocated memory was 90.2MB in the beginning and 130.0MB in the end (delta: 39.8MB). Free memory was 62.3MB in the beginning and 58.7MB in the end (delta: 3.6MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2022-02-20 17:44:24,790 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 90.2MB. Free memory is still 60.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:44:24,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 137.70ms. Allocated memory is still 90.2MB. Free memory was 62.0MB in the beginning and 51.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:44:24,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.55ms. Allocated memory is still 90.2MB. Free memory was 51.1MB in the beginning and 49.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:44:24,791 INFO L158 Benchmark]: Boogie Preprocessor took 24.51ms. Allocated memory is still 90.2MB. Free memory was 49.4MB in the beginning and 48.4MB in the end (delta: 997.9kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 17:44:24,791 INFO L158 Benchmark]: RCFGBuilder took 239.33ms. Allocated memory is still 90.2MB. Free memory was 48.4MB in the beginning and 37.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:44:24,791 INFO L158 Benchmark]: TraceAbstraction took 26752.42ms. Allocated memory was 90.2MB in the beginning and 130.0MB in the end (delta: 39.8MB). Free memory was 37.5MB in the beginning and 61.8MB in the end (delta: -24.4MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2022-02-20 17:44:24,792 INFO L158 Benchmark]: Witness Printer took 29.88ms. Allocated memory is still 130.0MB. Free memory was 61.8MB in the beginning and 58.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:44:24,793 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 90.2MB. Free memory is still 60.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 137.70ms. Allocated memory is still 90.2MB. Free memory was 62.0MB in the beginning and 51.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.55ms. Allocated memory is still 90.2MB. Free memory was 51.1MB in the beginning and 49.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.51ms. Allocated memory is still 90.2MB. Free memory was 49.4MB in the beginning and 48.4MB in the end (delta: 997.9kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 239.33ms. Allocated memory is still 90.2MB. Free memory was 48.4MB in the beginning and 37.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 26752.42ms. Allocated memory was 90.2MB in the beginning and 130.0MB in the end (delta: 39.8MB). Free memory was 37.5MB in the beginning and 61.8MB in the end (delta: -24.4MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Witness Printer took 29.88ms. Allocated memory is still 130.0MB. Free memory was 61.8MB in the beginning and 58.7MB in the end (delta: 3.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 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 576 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 437 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 190 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 139 mSDtfsCounter, 190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 244 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 25 PreInvPairs, 39 NumberOfFragments, 443 HoareAnnotationTreeSize, 25 FomulaSimplifications, 42 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 66 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 822 SizeOfPredicates, 7 NumberOfNonLiveVariables, 481 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 218/238 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: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((k <= 2 && c == 1) && y == 1) && 6 * (y * y * y * y * y) + 2 * (y * y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && 0 < k) || (((((2 <= c && k <= 2) && 2 == y) && 1 < k) && c <= 2) && 6 * (y * y * y * y * y) + 2 * (y * y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y)) || ((((0 <= k && c == 0) && k <= 2) && y == 0) && x == 0) RESULT: Ultimate proved your program to be correct! [2022-02-20 17:44:24,809 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