./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound100.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/ps5-ll_valuebound100.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 2436c69c19f049d89ef519f7bd9d4cf3f7b648737fca21472b0299c532d84f11 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:42:30,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:42:30,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:42:30,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:42:30,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:42:30,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:42:30,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:42:30,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:42:30,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:42:30,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:42:30,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:42:30,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:42:30,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:42:30,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:42:30,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:42:30,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:42:30,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:42:30,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:42:30,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:42:30,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:42:30,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:42:30,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:42:30,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:42:30,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:42:30,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:42:30,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:42:30,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:42:30,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:42:30,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:42:30,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:42:30,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:42:30,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:42:30,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:42:30,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:42:30,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:42:30,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:42:30,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:42:30,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:42:30,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:42:30,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:42:30,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:42:30,835 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:42:30,857 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:42:30,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:42:30,858 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:42:30,858 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:42:30,858 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:42:30,859 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:42:30,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:42:30,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:42:30,859 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:42:30,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:42:30,860 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:42:30,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:42:30,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:42:30,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:42:30,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:42:30,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:42:30,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:42:30,861 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:42:30,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:42:30,862 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:42:30,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:42:30,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:42:30,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:42:30,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:42:30,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:42:30,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:42:30,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:42:30,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:42:30,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:42:30,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:42:30,864 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:42:30,864 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:42:30,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:42:30,865 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 -> 2436c69c19f049d89ef519f7bd9d4cf3f7b648737fca21472b0299c532d84f11 [2022-02-20 17:42:31,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:42:31,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:42:31,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:42:31,087 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:42:31,088 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:42:31,088 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound100.c [2022-02-20 17:42:31,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/543261700/7ec42a6d72bd43c2b8b57fcbe48031ef/FLAG2bbbe1b50 [2022-02-20 17:42:31,459 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:42:31,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound100.c [2022-02-20 17:42:31,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/543261700/7ec42a6d72bd43c2b8b57fcbe48031ef/FLAG2bbbe1b50 [2022-02-20 17:42:31,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/543261700/7ec42a6d72bd43c2b8b57fcbe48031ef [2022-02-20 17:42:31,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:42:31,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:42:31,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:42:31,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:42:31,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:42:31,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:42:31" (1/1) ... [2022-02-20 17:42:31,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a123607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:31, skipping insertion in model container [2022-02-20 17:42:31,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:42:31" (1/1) ... [2022-02-20 17:42:31,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:42:31,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:42:32,111 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/ps5-ll_valuebound100.c[458,471] [2022-02-20 17:42:32,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:42:32,148 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:42:32,156 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/ps5-ll_valuebound100.c[458,471] [2022-02-20 17:42:32,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:42:32,183 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:42:32,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:32 WrapperNode [2022-02-20 17:42:32,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:42:32,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:42:32,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:42:32,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:42:32,189 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:42:32" (1/1) ... [2022-02-20 17:42:32,194 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:42:32" (1/1) ... [2022-02-20 17:42:32,213 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2022-02-20 17:42:32,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:42:32,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:42:32,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:42:32,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:42:32,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:32" (1/1) ... [2022-02-20 17:42:32,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:32" (1/1) ... [2022-02-20 17:42:32,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:32" (1/1) ... [2022-02-20 17:42:32,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:32" (1/1) ... [2022-02-20 17:42:32,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:32" (1/1) ... [2022-02-20 17:42:32,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:32" (1/1) ... [2022-02-20 17:42:32,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:32" (1/1) ... [2022-02-20 17:42:32,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:42:32,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:42:32,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:42:32,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:42:32,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:32" (1/1) ... [2022-02-20 17:42:32,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:42:32,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:32,286 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:42:32,290 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:42:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:42:32,313 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:42:32,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:42:32,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:42:32,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:42:32,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:42:32,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:42:32,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:42:32,356 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:42:32,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:42:32,506 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:42:32,510 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:42:32,510 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:42:32,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:42:32 BoogieIcfgContainer [2022-02-20 17:42:32,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:42:32,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:42:32,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:42:32,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:42:32,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:42:31" (1/3) ... [2022-02-20 17:42:32,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f511af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:42:32, skipping insertion in model container [2022-02-20 17:42:32,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:32" (2/3) ... [2022-02-20 17:42:32,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f511af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:42:32, skipping insertion in model container [2022-02-20 17:42:32,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:42:32" (3/3) ... [2022-02-20 17:42:32,532 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound100.c [2022-02-20 17:42:32,535 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:42:32,536 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:42:32,580 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:42:32,590 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:42:32,590 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:42:32,610 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:42:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:42:32,616 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:32,616 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:32,617 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:32,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:32,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1845349065, now seen corresponding path program 1 times [2022-02-20 17:42:32,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:32,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699560239] [2022-02-20 17:42:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:32,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:42:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:32,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:42:32,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:42:32,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:42:32,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#false} {27#true} #50#return; {28#false} is VALID [2022-02-20 17:42:32,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:42:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:32,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:42:32,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:42:32,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:42:32,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#false} {28#false} #52#return; {28#false} is VALID [2022-02-20 17:42:32,754 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:42:32,754 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:42:32,754 INFO L272 TraceCheckUtils]: 2: Hoare triple {27#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {27#true} is VALID [2022-02-20 17:42:32,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:42:32,755 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:42:32,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:42:32,756 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28#false} {27#true} #50#return; {28#false} is VALID [2022-02-20 17:42:32,756 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:42:32,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:42:32,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:42:32,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:42:32,757 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {28#false} {28#false} #52#return; {28#false} is VALID [2022-02-20 17:42:32,757 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:42:32,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-02-20 17:42:32,758 INFO L272 TraceCheckUtils]: 14: Hoare triple {28#false} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {28#false} is VALID [2022-02-20 17:42:32,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-02-20 17:42:32,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-02-20 17:42:32,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-02-20 17:42:32,759 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:42:32,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:32,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699560239] [2022-02-20 17:42:32,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699560239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:42:32,761 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:42:32,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:42:32,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025738203] [2022-02-20 17:42:32,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:42:32,767 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:42:32,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:32,771 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:42:32,787 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:42:32,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:42:32,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:32,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:42:32,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:42:32,809 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:42:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:32,858 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2022-02-20 17:42:32,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:42:32,859 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:42:32,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:32,860 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:42:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2022-02-20 17:42:32,868 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:42:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2022-02-20 17:42:32,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 63 transitions. [2022-02-20 17:42:32,946 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:42:32,951 INFO L225 Difference]: With dead ends: 45 [2022-02-20 17:42:32,951 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 17:42:32,953 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:42:32,964 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:42:32,965 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:42:32,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 17:42:33,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 17:42:33,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:33,003 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:42:33,004 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:42:33,004 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:42:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:33,010 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 17:42:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:42:33,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:33,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:33,012 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:42:33,012 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:42:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:33,019 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 17:42:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:42:33,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:33,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:33,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:33,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:33,021 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:42:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-02-20 17:42:33,024 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2022-02-20 17:42:33,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:33,025 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-20 17:42:33,025 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:42:33,025 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:42:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:42:33,026 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:33,026 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:33,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:42:33,027 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:33,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1506842435, now seen corresponding path program 1 times [2022-02-20 17:42:33,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:33,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642992937] [2022-02-20 17:42:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:33,053 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:33,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [128023926] [2022-02-20 17:42:33,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:33,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:33,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:33,056 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:42:33,069 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:42:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:33,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:42:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:33,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:33,312 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:42:33,312 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:42:33,313 INFO L272 TraceCheckUtils]: 2: Hoare triple {169#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {169#true} is VALID [2022-02-20 17:42:33,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {169#true} ~cond := #in~cond; {169#true} is VALID [2022-02-20 17:42:33,313 INFO L290 TraceCheckUtils]: 4: Hoare triple {169#true} assume !(0 == ~cond); {169#true} is VALID [2022-02-20 17:42:33,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} assume true; {169#true} is VALID [2022-02-20 17:42:33,313 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {169#true} {169#true} #50#return; {169#true} is VALID [2022-02-20 17:42:33,314 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:42:33,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {169#true} ~cond := #in~cond; {169#true} is VALID [2022-02-20 17:42:33,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#true} assume !(0 == ~cond); {169#true} is VALID [2022-02-20 17:42:33,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {169#true} assume true; {169#true} is VALID [2022-02-20 17:42:33,314 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {169#true} {169#true} #52#return; {169#true} is VALID [2022-02-20 17:42:33,315 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:42:33,316 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:42:33,317 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 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:33,317 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:42:33,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {170#false} is VALID [2022-02-20 17:42:33,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-02-20 17:42:33,319 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:42:33,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:42:33,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:33,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642992937] [2022-02-20 17:42:33,320 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:33,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128023926] [2022-02-20 17:42:33,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128023926] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:42:33,320 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:42:33,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:42:33,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626637792] [2022-02-20 17:42:33,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:42:33,322 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:42:33,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:33,322 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:42:33,334 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:42:33,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:42:33,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:33,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:42:33,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:42:33,335 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:42:33,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:33,431 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-20 17:42:33,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:42:33,432 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:42:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:33,433 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:42:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:42:33,442 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:42:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:42:33,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-02-20 17:42:33,473 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:42:33,475 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:42:33,475 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 17:42:33,476 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:42:33,477 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:42:33,477 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:42:33,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 17:42:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 17:42:33,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:33,481 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:42:33,482 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:42:33,482 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:42:33,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:33,484 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-20 17:42:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 17:42:33,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:33,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:33,485 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:42:33,486 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:42:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:33,487 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-20 17:42:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 17:42:33,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:33,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:33,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:33,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:33,488 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:42:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-02-20 17:42:33,490 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2022-02-20 17:42:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:33,490 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-20 17:42:33,491 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:42:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 17:42:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:42:33,491 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:33,491 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:42:33,526 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:42:33,707 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:42:33,708 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:33,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash 903983968, now seen corresponding path program 1 times [2022-02-20 17:42:33,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:33,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425477096] [2022-02-20 17:42:33,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:33,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:33,740 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:33,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [515574362] [2022-02-20 17:42:33,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:33,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:33,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:33,756 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:42:33,757 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:42:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:33,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:42:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:33,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:33,913 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:42:33,914 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:42:33,914 INFO L272 TraceCheckUtils]: 2: Hoare triple {365#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {365#true} is VALID [2022-02-20 17:42:33,914 INFO L290 TraceCheckUtils]: 3: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:42:33,914 INFO L290 TraceCheckUtils]: 4: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:42:33,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:42:33,915 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {365#true} {365#true} #50#return; {365#true} is VALID [2022-02-20 17:42:33,915 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:42:33,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:42:33,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:42:33,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:42:33,916 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {365#true} {365#true} #52#return; {365#true} is VALID [2022-02-20 17:42:33,916 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:42:33,916 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:42:33,917 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 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {365#true} is VALID [2022-02-20 17:42:33,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:42:33,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:42:33,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:42:33,918 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:42:33,918 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_~x~0#1; {428#(and (= (* (* |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|) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:42:33,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {428#(and (= (* (* |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|) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !false; {428#(and (= (* (* |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|) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:42:33,920 INFO L272 TraceCheckUtils]: 21: Hoare triple {428#(and (= (* (* |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|) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {435#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:33,920 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:42:33,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {439#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-02-20 17:42:33,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 17:42:33,921 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:42:33,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:36,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 17:42:36,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {439#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-02-20 17:42:36,087 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:42:36,088 INFO L272 TraceCheckUtils]: 21: Hoare triple {455#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 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|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {435#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:36,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {455#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 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|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} assume !false; {455#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 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|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:42:37,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {455#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 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|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} 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_~x~0#1; {455#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 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|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:42:37,053 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {365#true} {455#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 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|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} #54#return; {455#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 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|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:42:37,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:42:37,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:42:37,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:42:37,054 INFO L272 TraceCheckUtils]: 14: Hoare triple {455#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 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|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {365#true} is VALID [2022-02-20 17:42:37,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 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|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} assume !false; {455#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 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|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:42:37,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {455#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 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|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:42:37,059 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {365#true} {365#true} #52#return; {365#true} is VALID [2022-02-20 17:42:37,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:42:37,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:42:37,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:42:37,059 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:42:37,059 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {365#true} {365#true} #50#return; {365#true} is VALID [2022-02-20 17:42:37,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:42:37,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:42:37,060 INFO L290 TraceCheckUtils]: 3: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:42:37,060 INFO L272 TraceCheckUtils]: 2: Hoare triple {365#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {365#true} is VALID [2022-02-20 17:42:37,060 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:42:37,060 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:42:37,060 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:42:37,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:37,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425477096] [2022-02-20 17:42:37,060 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:37,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515574362] [2022-02-20 17:42:37,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515574362] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:37,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:37,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:42:37,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775228298] [2022-02-20 17:42:37,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:42:37,061 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:42:37,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:37,062 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:42:38,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:38,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:42:38,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:38,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:42:38,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2022-02-20 17:42:38,455 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:42:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:38,546 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-02-20 17:42:38,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:42:38,547 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:42:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:38,547 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:42:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:42:38,548 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:42:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:42:38,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-02-20 17:42:38,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:38,938 INFO L225 Difference]: With dead ends: 33 [2022-02-20 17:42:38,938 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:42:38,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2022-02-20 17:42:38,939 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:42:38,940 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:42:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:42:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 17:42:38,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:38,945 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:42:38,945 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:42:38,945 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:42:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:38,949 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 17:42:38,949 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:42:38,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:38,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:38,951 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:42:38,951 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:42:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:38,955 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 17:42:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:42:38,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:38,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:38,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:38,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:38,956 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:42:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-02-20 17:42:38,960 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-02-20 17:42:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:38,960 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-02-20 17:42:38,961 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:42:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:42:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:42:38,962 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:38,965 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:42:38,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:42:39,186 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:42:39,187 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1648043046, now seen corresponding path program 1 times [2022-02-20 17:42:39,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:39,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301229548] [2022-02-20 17:42:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:39,204 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:39,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104694420] [2022-02-20 17:42:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:39,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:39,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:39,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:42:39,230 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:42:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:39,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:42:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:39,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:39,564 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:42:39,565 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:42:39,565 INFO L272 TraceCheckUtils]: 2: Hoare triple {664#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {664#true} is VALID [2022-02-20 17:42:39,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:42:39,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:42:39,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:42:39,566 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {664#true} {664#true} #50#return; {664#true} is VALID [2022-02-20 17:42:39,566 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:42:39,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:42:39,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:42:39,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:42:39,567 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {664#true} {664#true} #52#return; {664#true} is VALID [2022-02-20 17:42:39,567 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:42:39,568 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:42:39,568 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 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {664#true} is VALID [2022-02-20 17:42:39,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:42:39,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:42:39,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:42:39,569 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:42:39,570 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_~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:42:39,571 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:42:39,571 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 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {664#true} is VALID [2022-02-20 17:42:39,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:42:39,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:42:39,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:42:39,573 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:42:39,574 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:42:39,575 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 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {664#true} is VALID [2022-02-20 17:42:39,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:42:39,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:42:39,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:42:39,576 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:42:39,577 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:42:39,577 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:42:39,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {772#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {665#false} is VALID [2022-02-20 17:42:39,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {665#false} assume !false; {665#false} is VALID [2022-02-20 17:42:39,578 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:42:39,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:39,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:39,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301229548] [2022-02-20 17:42:39,894 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:39,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104694420] [2022-02-20 17:42:39,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104694420] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:39,894 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:39,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:42:39,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678771835] [2022-02-20 17:42:39,895 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:39,895 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:42:39,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:39,896 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:42:39,920 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:42:39,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:42:39,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:39,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:42:39,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:42:39,921 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:42:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:40,115 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-02-20 17:42:40,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:42:40,115 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:42:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:40,116 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:42:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-02-20 17:42:40,117 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:42:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-02-20 17:42:40,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-02-20 17:42:40,146 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:42:40,147 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:42:40,147 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:42:40,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:42:40,148 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:42:40,149 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:42:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:42:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 17:42:40,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:40,156 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:42:40,156 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:42:40,157 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:42:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:40,158 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 17:42:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 17:42:40,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:40,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:40,159 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:42:40,160 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:42:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:40,161 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 17:42:40,162 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 17:42:40,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:40,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:40,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:40,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:40,162 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:42:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-02-20 17:42:40,164 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2022-02-20 17:42:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:40,164 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-02-20 17:42:40,165 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:42:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 17:42:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 17:42:40,166 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:40,166 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:42:40,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 17:42:40,399 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:42:40,402 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:40,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:40,402 INFO L85 PathProgramCache]: Analyzing trace with hash -426505545, now seen corresponding path program 2 times [2022-02-20 17:42:40,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:40,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344563006] [2022-02-20 17:42:40,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:40,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:40,413 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:40,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923261248] [2022-02-20 17:42:40,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:42:40,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:40,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:40,418 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:42:40,431 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:42:40,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:42:40,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:40,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:42:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:40,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:40,827 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:42:40,827 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:42:40,827 INFO L272 TraceCheckUtils]: 2: Hoare triple {1004#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:42:40,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:42:40,828 INFO L290 TraceCheckUtils]: 4: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:42:40,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:42:40,828 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1004#true} {1004#true} #50#return; {1004#true} is VALID [2022-02-20 17:42:40,828 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:42:40,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:42:40,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:42:40,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:42:40,829 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1004#true} {1004#true} #52#return; {1004#true} is VALID [2022-02-20 17:42:40,829 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:42:40,830 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:42:40,830 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 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:42:40,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:42:40,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:42:40,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:42:40,831 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:42:40,831 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_~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:42:40,832 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:42:40,832 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 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:42:40,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:42:40,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:42:40,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:42:40,833 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:42:40,833 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_~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:42:40,834 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:42:40,834 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 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:42:40,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:42:40,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:42:40,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:42:40,835 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:42:40,836 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:42:40,836 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 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:42:40,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:42:40,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:42:40,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:42:40,837 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:42:40,837 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:42:40,838 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:42:40,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {1134#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1005#false} is VALID [2022-02-20 17:42:40,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {1005#false} assume !false; {1005#false} is VALID [2022-02-20 17:42:40,839 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:42:40,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:41,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:41,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344563006] [2022-02-20 17:42:41,117 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:41,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923261248] [2022-02-20 17:42:41,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923261248] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:41,118 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:41,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:42:41,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241159160] [2022-02-20 17:42:41,118 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:41,121 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:42:41,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:41,121 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:42:41,145 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:42:41,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:42:41,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:41,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:42:41,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:42:41,147 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:42:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:41,423 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-20 17:42:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:42:41,423 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:42:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:41,424 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:42:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-02-20 17:42:41,426 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:42:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-02-20 17:42:41,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-02-20 17:42:41,464 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:42:41,465 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:42:41,465 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 17:42:41,465 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:42:41,467 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:42:41,467 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:42:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 17:42:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-02-20 17:42:41,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:41,484 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:42:41,484 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:42:41,485 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:42:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:41,486 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-02-20 17:42:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-02-20 17:42:41,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:41,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:41,487 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:42:41,487 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:42:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:41,492 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-02-20 17:42:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-02-20 17:42:41,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:41,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:41,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:41,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:41,493 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:42:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-02-20 17:42:41,495 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 43 [2022-02-20 17:42:41,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:41,496 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-02-20 17:42:41,496 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:42:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-02-20 17:42:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 17:42:41,498 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:41,499 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:42:41,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 17:42:41,702 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:42:41,703 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:41,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:41,703 INFO L85 PathProgramCache]: Analyzing trace with hash 173594938, now seen corresponding path program 3 times [2022-02-20 17:42:41,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:41,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312487050] [2022-02-20 17:42:41,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:41,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:41,720 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:41,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2076144060] [2022-02-20 17:42:41,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:42:41,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:41,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:41,721 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:42:41,722 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:42:42,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 17:42:42,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:42,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 17:42:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:42,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:42,510 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:42:42,510 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:42:42,510 INFO L272 TraceCheckUtils]: 2: Hoare triple {1382#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:42:42,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:42:42,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:42:42,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:42:42,511 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1382#true} {1382#true} #50#return; {1382#true} is VALID [2022-02-20 17:42:42,511 INFO L272 TraceCheckUtils]: 7: Hoare triple {1382#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:42:42,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:42:42,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:42:42,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:42:42,511 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1382#true} {1382#true} #52#return; {1382#true} is VALID [2022-02-20 17:42:42,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {1382#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1423#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:42,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {1423#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {1423#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:42,512 INFO L272 TraceCheckUtils]: 14: Hoare triple {1423#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:42:42,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:42:42,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:42:42,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:42:42,516 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1382#true} {1423#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #54#return; {1423#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:42,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {1423#(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_~x~0#1; {1445#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:42,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {1445#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {1445#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:42,517 INFO L272 TraceCheckUtils]: 21: Hoare triple {1445#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:42:42,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:42:42,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:42:42,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:42:42,518 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1382#true} {1445#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #54#return; {1445#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:42,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {1445#(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_~x~0#1; {1467#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:42:42,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {1467#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !false; {1467#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:42:42,521 INFO L272 TraceCheckUtils]: 28: Hoare triple {1467#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:42:42,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:42:42,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:42:42,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:42:42,522 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1382#true} {1467#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} #54#return; {1467#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:42:42,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {1467#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~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_~x~0#1; {1489#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:42:42,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {1489#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3))} assume !false; {1489#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:42:42,523 INFO L272 TraceCheckUtils]: 35: Hoare triple {1489#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:42:42,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:42:42,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:42:42,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:42:42,524 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1382#true} {1489#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3))} #54#return; {1489#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:42:42,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {1489#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3))} assume !(main_~c~0#1 < main_~k~0#1); {1511#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:42:42,525 INFO L272 TraceCheckUtils]: 41: Hoare triple {1511#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1382#true} is VALID [2022-02-20 17:42:42,525 INFO L290 TraceCheckUtils]: 42: Hoare triple {1382#true} ~cond := #in~cond; {1382#true} is VALID [2022-02-20 17:42:42,525 INFO L290 TraceCheckUtils]: 43: Hoare triple {1382#true} assume !(0 == ~cond); {1382#true} is VALID [2022-02-20 17:42:42,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {1382#true} assume true; {1382#true} is VALID [2022-02-20 17:42:42,526 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1382#true} {1511#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|))} #56#return; {1511#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:42:42,527 INFO L272 TraceCheckUtils]: 46: Hoare triple {1511#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |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)); {1530#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:42,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {1530#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1534#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:42,527 INFO L290 TraceCheckUtils]: 48: Hoare triple {1534#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1383#false} is VALID [2022-02-20 17:42:42,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {1383#false} assume !false; {1383#false} is VALID [2022-02-20 17:42:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-02-20 17:42:42,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:42,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:42,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312487050] [2022-02-20 17:42:42,758 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:42,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076144060] [2022-02-20 17:42:42,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076144060] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:42,759 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:42,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-02-20 17:42:42,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833378010] [2022-02-20 17:42:42,759 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:42,759 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 50 [2022-02-20 17:42:42,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:42,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 17:42:42,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:42,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:42:42,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:42,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:42:42,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:42:42,785 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 17:42:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:43,064 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-02-20 17:42:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:42:43,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 50 [2022-02-20 17:42:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 17:42:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-02-20 17:42:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 17:42:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-02-20 17:42:43,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 46 transitions. [2022-02-20 17:42:43,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:43,108 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:42:43,108 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 17:42:43,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:42:43,109 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:43,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 207 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:42:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 17:42:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 17:42:43,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:43,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:42:43,120 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:42:43,120 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:42:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:43,122 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-02-20 17:42:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-20 17:42:43,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:43,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:43,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-02-20 17:42:43,123 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-02-20 17:42:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:43,124 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-02-20 17:42:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-20 17:42:43,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:43,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:43,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:43,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:42:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-02-20 17:42:43,126 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 50 [2022-02-20 17:42:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:43,126 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-02-20 17:42:43,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 17:42:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-20 17:42:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 17:42:43,127 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:43,127 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:43,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 17:42:43,331 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:42:43,332 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:43,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1013596503, now seen corresponding path program 4 times [2022-02-20 17:42:43,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:43,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913305877] [2022-02-20 17:42:43,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:43,346 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:43,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1231277429] [2022-02-20 17:42:43,347 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:42:43,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:43,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:43,354 INFO L229 MonitoredProcess]: Starting monitored process 7 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:42:43,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 17:42:43,388 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:42:43,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:43,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 17:42:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:43,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:43,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#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); {1798#true} is VALID [2022-02-20 17:42:43,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#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; {1798#true} is VALID [2022-02-20 17:42:43,692 INFO L272 TraceCheckUtils]: 2: Hoare triple {1798#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {1798#true} is VALID [2022-02-20 17:42:43,693 INFO L290 TraceCheckUtils]: 3: Hoare triple {1798#true} ~cond := #in~cond; {1798#true} is VALID [2022-02-20 17:42:43,693 INFO L290 TraceCheckUtils]: 4: Hoare triple {1798#true} assume !(0 == ~cond); {1798#true} is VALID [2022-02-20 17:42:43,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {1798#true} assume true; {1798#true} is VALID [2022-02-20 17:42:43,693 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1798#true} {1798#true} #50#return; {1798#true} is VALID [2022-02-20 17:42:43,693 INFO L272 TraceCheckUtils]: 7: Hoare triple {1798#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {1798#true} is VALID [2022-02-20 17:42:43,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {1798#true} ~cond := #in~cond; {1798#true} is VALID [2022-02-20 17:42:43,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {1798#true} assume !(0 == ~cond); {1798#true} is VALID [2022-02-20 17:42:43,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {1798#true} assume true; {1798#true} is VALID [2022-02-20 17:42:43,694 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1798#true} {1798#true} #52#return; {1798#true} is VALID [2022-02-20 17:42:43,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {1798#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1839#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:43,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {1839#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {1839#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:43,695 INFO L272 TraceCheckUtils]: 14: Hoare triple {1839#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1798#true} is VALID [2022-02-20 17:42:43,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {1798#true} ~cond := #in~cond; {1798#true} is VALID [2022-02-20 17:42:43,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {1798#true} assume !(0 == ~cond); {1798#true} is VALID [2022-02-20 17:42:43,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {1798#true} assume true; {1798#true} is VALID [2022-02-20 17:42:43,696 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1798#true} {1839#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #54#return; {1839#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:43,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {1839#(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_~x~0#1; {1861#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:42:43,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {1861#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !false; {1861#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:42:43,697 INFO L272 TraceCheckUtils]: 21: Hoare triple {1861#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1798#true} is VALID [2022-02-20 17:42:43,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {1798#true} ~cond := #in~cond; {1798#true} is VALID [2022-02-20 17:42:43,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {1798#true} assume !(0 == ~cond); {1798#true} is VALID [2022-02-20 17:42:43,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {1798#true} assume true; {1798#true} is VALID [2022-02-20 17:42:43,698 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1798#true} {1861#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} #54#return; {1861#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:42:43,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {1861#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~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_~x~0#1; {1883#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:43,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {1883#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !false; {1883#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:43,699 INFO L272 TraceCheckUtils]: 28: Hoare triple {1883#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1798#true} is VALID [2022-02-20 17:42:43,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {1798#true} ~cond := #in~cond; {1798#true} is VALID [2022-02-20 17:42:43,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {1798#true} assume !(0 == ~cond); {1798#true} is VALID [2022-02-20 17:42:43,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {1798#true} assume true; {1798#true} is VALID [2022-02-20 17:42:43,701 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1798#true} {1883#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} #54#return; {1883#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:43,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {1883#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= (+ (- 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_~x~0#1; {1905#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:43,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {1905#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !false; {1905#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:43,702 INFO L272 TraceCheckUtils]: 35: Hoare triple {1905#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1798#true} is VALID [2022-02-20 17:42:43,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {1798#true} ~cond := #in~cond; {1798#true} is VALID [2022-02-20 17:42:43,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {1798#true} assume !(0 == ~cond); {1798#true} is VALID [2022-02-20 17:42:43,703 INFO L290 TraceCheckUtils]: 38: Hoare triple {1798#true} assume true; {1798#true} is VALID [2022-02-20 17:42:43,703 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1798#true} {1905#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} #54#return; {1905#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:43,704 INFO L290 TraceCheckUtils]: 40: Hoare triple {1905#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |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_~x~0#1; {1927#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:42:43,704 INFO L290 TraceCheckUtils]: 41: Hoare triple {1927#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !false; {1927#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:42:43,704 INFO L272 TraceCheckUtils]: 42: Hoare triple {1927#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1798#true} is VALID [2022-02-20 17:42:43,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {1798#true} ~cond := #in~cond; {1798#true} is VALID [2022-02-20 17:42:43,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {1798#true} assume !(0 == ~cond); {1798#true} is VALID [2022-02-20 17:42:43,705 INFO L290 TraceCheckUtils]: 45: Hoare triple {1798#true} assume true; {1798#true} is VALID [2022-02-20 17:42:43,705 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1798#true} {1927#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} #54#return; {1927#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:42:43,706 INFO L290 TraceCheckUtils]: 47: Hoare triple {1927#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {1949#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:42:43,706 INFO L272 TraceCheckUtils]: 48: Hoare triple {1949#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1798#true} is VALID [2022-02-20 17:42:43,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {1798#true} ~cond := #in~cond; {1798#true} is VALID [2022-02-20 17:42:43,706 INFO L290 TraceCheckUtils]: 50: Hoare triple {1798#true} assume !(0 == ~cond); {1798#true} is VALID [2022-02-20 17:42:43,706 INFO L290 TraceCheckUtils]: 51: Hoare triple {1798#true} assume true; {1798#true} is VALID [2022-02-20 17:42:43,707 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1798#true} {1949#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} #56#return; {1949#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:42:43,707 INFO L272 TraceCheckUtils]: 53: Hoare triple {1949#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |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)); {1968#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:43,708 INFO L290 TraceCheckUtils]: 54: Hoare triple {1968#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1972#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:43,708 INFO L290 TraceCheckUtils]: 55: Hoare triple {1972#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1799#false} is VALID [2022-02-20 17:42:43,708 INFO L290 TraceCheckUtils]: 56: Hoare triple {1799#false} assume !false; {1799#false} is VALID [2022-02-20 17:42:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-02-20 17:42:43,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:43,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:43,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913305877] [2022-02-20 17:42:43,980 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:43,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231277429] [2022-02-20 17:42:43,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231277429] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:43,981 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:43,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-02-20 17:42:43,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062664787] [2022-02-20 17:42:43,981 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:43,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 57 [2022-02-20 17:42:43,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:43,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 17:42:44,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:44,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:42:44,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:44,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:42:44,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:42:44,026 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 17:42:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:44,392 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-02-20 17:42:44,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:42:44,393 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 57 [2022-02-20 17:42:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 17:42:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-02-20 17:42:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 17:42:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-02-20 17:42:44,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-02-20 17:42:44,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:44,433 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:42:44,433 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 17:42:44,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:42:44,434 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:44,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 251 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:42:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 17:42:44,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-20 17:42:44,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:44,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:42:44,447 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:42:44,447 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:42:44,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:44,448 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-02-20 17:42:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-02-20 17:42:44,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:44,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:44,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 41 states. [2022-02-20 17:42:44,449 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 41 states. [2022-02-20 17:42:44,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:44,450 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-02-20 17:42:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-02-20 17:42:44,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:44,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:44,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:44,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:42:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-02-20 17:42:44,452 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 57 [2022-02-20 17:42:44,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:44,453 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-02-20 17:42:44,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 17:42:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-02-20 17:42:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 17:42:44,453 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:44,454 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:44,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:42:44,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:44,670 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:44,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:44,671 INFO L85 PathProgramCache]: Analyzing trace with hash 66449050, now seen corresponding path program 5 times [2022-02-20 17:42:44,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:44,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948278905] [2022-02-20 17:42:44,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:44,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:44,681 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:44,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682625905] [2022-02-20 17:42:44,681 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:42:44,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:44,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:44,682 INFO L229 MonitoredProcess]: Starting monitored process 8 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:42:44,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process